Sciweavers

126 search results - page 8 / 26
» The Construction of Minimal DNA Expressions
Sort
View
CUZA
2010
150views Cryptology» more  CUZA 2010»
13 years 7 months ago
Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions
In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realise...
Helle Hvid Hansen, Jan J. M. M. Rutten
BMCBI
2007
109views more  BMCBI 2007»
13 years 9 months ago
Discarding duplicate ditags in LongSAGE analysis may introduce significant error
Background: During gene expression analysis by Serial Analysis of Gene Expression (SAGE), duplicate ditags are routinely removed from the data analysis, because they are suspected...
Jeppe Emmersen, Anna M. Heidenblut, Annabeth Laurs...
CIARP
2004
Springer
14 years 3 months ago
Detecting Inflection Patterns in Natural Language by Minimization of Morphological Model
One of the most important steps in text processing and information retrieval is stemming—reducing of words to stems expressing their base meaning, e.g., bake, baked, bakes, bakin...
Alexander F. Gelbukh, Mikhail Alexandrov, Sang-Yon...
BMCBI
2005
133views more  BMCBI 2005»
13 years 9 months ago
Ab initio identification of putative human transcription factor binding sites by comparative genomics
Background: Understanding transcriptional regulation of gene expression is one of the greatest challenges of modern molecular biology. A central role in this mechanism is played b...
Davide Corà, Carl Herrmann, Christoph Diete...
WIA
2005
Springer
14 years 3 months ago
Shorter Regular Expressions from Finite-State Automata
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
Yo-Sub Han, Derick Wood