49 search results - page 2 / 10 » A Fast Algorithm for Approximate String Matching on Gene Seq... |
SOFSEM
2005
Springer
13 years 10 months ago
2005
Springer
IWOCA
2009
Springer
13 years 11 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
DASFAA
2003
IEEE
13 years 10 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
CORR
2008
Springer
13 years 5 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...
SPIRE
1998
Springer
13 years 9 months ago
1998
Springer
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...