15 search results - page 1 / 3 » An Efficient Matching Algorithm for Encoded DNA Sequences an... |
CPM
2009
Springer
14 years 2 months ago
2009
Springer
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
BIRD
2008
Springer
14 years 21 days ago
2008
Springer
Exact matching of single patterns in DNA and amino acid sequences is studied. We performed an extensive experimental comparison of algorithms presented in the literature. In additi...
CSB
2004
IEEE
14 years 2 months ago
2004
IEEE
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
112
click to vote
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...