Fast text searching: allowing errors
Communications of the ACM
(Un)expected behavior of typical suffix trees
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Searching in Parallel for Similar Strings
IEEE Computational Science & Engineering
Approximate string matching: a simpler faster algorithm
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A fast bit-vector algorithm for approximate string matching based on dynamic programming
Journal of the ACM (JACM)
Faster algorithms for string matching with k mismatches
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Communications of the ACM
Information Processing Letters
Tune Retrieval in the Multimedia Library
Multimedia Tools and Applications
New and faster filters for multiple approximate string matching
Random Structures & Algorithms
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
The Max-Shift Algorithm for Approximate String Matching
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Approximate String Matching over Ziv-Lempel Compressed Text
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Faster Bit-Parallel Approximate String Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
A New Indexing Method for Approximate String Matching
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Information and Computation
Fast pattern matching for entropy bounded text
DCC '95 Proceedings of the Conference on Data Compression
Approximate string matching on Ziv-Lempel compressed text
Journal of Discrete Algorithms
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Average complexity of exact and approximate multiple string matching
Theoretical Computer Science
Approximate string matching with ordered q-grams
Nordic Journal of Computing
Edit distance for a run-length-encoded string and an uncompressed string
Information Processing Letters
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
On minimizing pattern splitting in multi-track string matching
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Algorithms and theory of computation handbook
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Parallel processing for stepwise generalisation method on multi-core PC cluster
International Journal of Knowledge and Web Intelligence
| Hi-index | 0.03 |