Alignment with non-overlapping inversions on two strings

Da Jung Cho, Yo Sub Han, Hwee Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)


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 languageEnglish
Title of host publicationAlgorithms and Computation - 8th International Workshop, WALCOM 2014, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783319046563
Publication statusPublished - 2014
Event8th International Workshop on Algorithms and Computation, WALCOM 2014 - Chennai, India
Duration: 2014 Feb 132014 Feb 15

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8344 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other8th International Workshop on Algorithms and Computation, WALCOM 2014

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
  • General Computer Science


Dive into the research topics of 'Alignment with non-overlapping inversions on two strings'. Together they form a unique fingerprint.

Cite this