Fast text searching: allowing errors
Communications of the ACM
Statistical Identification of Uniformly Mutated Segments within Repeats
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Engineering a Fast Online Persistent Suffix Tree Construction
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Algorithms and theory of computation handbook
Foundations and Trends in Databases
On-line approximate string matching with bounded errors
Theoretical Computer Science
Search-Optimized suffix-tree storage for biological applications
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.02 |
The k differences approximate string matching problem specifies a text string of length n, a pattern string of length m, and the number k of differences (insertions, deletions, substitutions) allowed in a match, and asks for every location in the text where a match occurs. Previous algorithms required at least O(nk) time. When k is as large as a fraction of m, no substantial progress has been made over O(nm) dynamic programming. The authors have investigated much faster algorithms for restricted cases of the problem, such as when the text string is random and errors are not too frequent. They have devised an algorithm that, for k