Sciweavers

47 search results - page 7 / 10
» Compressed Pattern Matching in DNA Sequences
Sort
View
ALMOB
2006
102views more  ALMOB 2006»
13 years 10 months ago
Mining, compressing and classifying with extensible motifs
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...
Alberto Apostolico, Matteo Comin, Laxmi Parida
ICDE
2003
IEEE
149views Database» more  ICDE 2003»
14 years 11 months ago
Indexing Weighted-Sequences in Large Databases
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...
Haixun Wang, Chang-Shing Perng, Wei Fan, Sanghyun ...
GCB
2000
Springer
75views Biometrics» more  GCB 2000»
14 years 1 months ago
Regexpcount, a Symbolic Package for Counting Problems on Regular Expressions and Words
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...
Pierre Nicodème
BMCBI
2008
129views more  BMCBI 2008»
13 years 10 months ago
Triad pattern algorithm for predicting strong promoter candidates in bacterial genomes
Background: Bacterial promoters, which increase the efficiency of gene expression, differ from other promoters by several characteristics. This difference, not yet widely exploite...
Michael Dekhtyar, Amelie Morin, Vehary Sakanyan
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
13 years 1 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi