56 search results - page 3 / 12 » Approximate String Matching in DNA Sequences |
ICDAR
1999
IEEE
13 years 10 months ago
1999
IEEE
Abstract
CSB
2004
IEEE
13 years 10 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 ...
ISMB
1998
13 years 7 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
IPPS
2002
IEEE
13 years 11 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
CORR
2004
Springer
13 years 6 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...