66 search results - page 14 / 14 » Comparison of Current BLAST Software on Nucleotide Sequences |
CPM
1998
Springer
13 years 10 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...