Algorithms for approximate string matching
Information and Control
Reducing the expected computational cost of template matching using run length representation
Pattern Recognition Letters
Polygonal shape recognition using string-matching techniques
Pattern Recognition
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
The String-to-String Correction Problem
Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences
Communications of the ACM
The SBC-tree: an index for run-length compressed sequences
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Hi-index | 0.00 |