Sciweavers

11 search results - page 2 / 3
» An Adaptive Hybrid Pattern-Matching Algorithm on Indetermina...
Sort
View
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
13 years 9 months ago
Approximate String Matching over Ziv-Lempel Compressed Text
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
Juha Kärkkäinen, Gonzalo Navarro, Esko U...
CSB
2005
IEEE
132views Bioinformatics» more  CSB 2005»
13 years 6 months ago
A Fast Shotgun Assembly Heuristic
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
Christopher Wilks, Sami Khuri
TNN
1998
92views more  TNN 1998»
13 years 4 months ago
Inductive inference from noisy examples using the hybrid finite state filter
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
Marco Gori, Marco Maggini, Enrico Martinelli, Giov...
JSS
2007
120views more  JSS 2007»
13 years 4 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta
BMCBI
2005
90views more  BMCBI 2005»
13 years 4 months ago
An algorithm for the determination and quantification of components of nucleic acid mixtures based on single sequencing reaction
Background: Determination and quantification of nucleic acid components in a mixture is usually accomplished by microarray approaches, where the mixtures are hybridized against sp...
Alexander E. Pozhitkov, Kathryn Stemshorn, Diethar...