Abstract
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(nm2)-time algorithm. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Cantone, D., Cristofaro, S., & Faro, S. (2011). Efficient matching of biological sequences allowing for non-overlapping inversions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6661 LNCS, pp. 364–375). https://doi.org/10.1007/978-3-642-21458-5_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
