Alignment with Non-overlapping Inversions on Two Strings
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.
Unable to display preview. Download preview PDF.
- 2.Cantone, D., Faro, S., Giaquinta, E.: Approximate string matching allowing for inversions and translocations. In: Proceedings of the Prague Stringology Conference 2010, pp. 37–51 (2010)Google Scholar
- 5.Ignatova, Z., Zimmermann, K., Martinez-Perez, I.: DNA Computing Models. Advances in Information Security (2008)Google Scholar