The inversion is one of the important operations in bio sequence analysis and the sequence alignment problem is well-studied for efficient bio sequence comparisons. Based on inversion operations, we introduce the alignment with non-overlapping inversion problem: Given two strings x and y, does there exist an alignment with non-overlapping inversions for x and y. We, in particular, consider the alignment problem when non-overlapping inversions are allowed for both x and y. We design an efficient algorithm that determines the existence of non-overlapping inversions and present another efficient algorithm that retrieves such an alignment, if exists. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Cho, D. J., Han, Y. S., & Kim, H. (2014). Alignment with non-overlapping inversions on two strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8344 LNCS, pp. 261–272). Springer Verlag. https://doi.org/10.1007/978-3-319-04657-0_25
Mendeley helps you to discover research relevant for your work.