A comparison of approximate string matching algorithms
Software—Practice & Experience
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Introduction to algorithms
New and faster filters for multiple approximate string matching
Random Structures & Algorithms
A space-efficient algorithm for sequence alignment with inversions and reversals
Theoretical Computer Science - Special papers from: COCOON 2003
String matching with inversions and translocations in linear average time (most of the time)
Information Processing Letters
Alignment with non-overlapping inversions in O(n3)-time
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Text searching allowing for inversions and translocations of factors
Discrete Applied Mathematics
| Hi-index | 5.23 |
Inversions are a class of chromosomal mutations, widely regarded as one of the major mechanisms for reorganizing the genome. In this paper we present a new algorithm for the approximate string matching problem allowing for non-overlapping inversions which runs in O(nm) worst-case time and O(m^2) space, for a character sequence of size n and pattern of size m. This improves upon a previous O(nm^2)-time algorithm. In addition we present a variant of our algorithm with the same complexity in the worst case, but with a O(n) time complexity in the average case.