A new approach to text searching
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
A technique for computer detection and correction of spelling errors
Communications of the ACM
Handbook of Exact String Matching Algorithms
Handbook of Exact String Matching Algorithms
A new model to solve the swap matching problem and efficient algorithms for short patterns
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
String matching with inversions and translocations in linear average time (most of the time)
Information Processing Letters
| Hi-index | 0.00 |
In this paper, we study the approximate string matching problem under a string distance whose edit operations are translocations of equal length factors. We extend a graph-theoretic approach proposed by Rahman and Illiopoulos (2008) to model our problem. In the sequel, we devise efficient algorithms based on this model to solve a number of variants of the string matching problem with translocations.