Abstract
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.
Original language | English |
---|---|
Title of host publication | Algorithms and Computation - 8th International Workshop, WALCOM 2014, Proceedings |
Publisher | Springer Verlag |
Pages | 261-272 |
Number of pages | 12 |
ISBN (Print) | 9783319046563 |
DOIs | |
Publication status | Published - 2014 |
Event | 8th International Workshop on Algorithms and Computation, WALCOM 2014 - Chennai, India Duration: 2014 Feb 13 → 2014 Feb 15 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 8344 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Other
Other | 8th International Workshop on Algorithms and Computation, WALCOM 2014 |
---|---|
Country/Territory | India |
City | Chennai |
Period | 14/2/13 → 14/2/15 |
Bibliographical note
Funding Information:This research was supported by the Basic Science Research Program through NRF funded by MEST (2012R1A1A2044562).
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)