An Improved Algorithm for Sequence Comparison with Block Reversals

  • S. Muthukrishnan
  • S. Cenk Sahinalp
Conference paper

DOI: 10.1007/3-540-45995-2_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2286)
Cite this paper as:
Muthukrishnan S., Sahinalp S.C. (2002) An Improved Algorithm for Sequence Comparison with Block Reversals. In: Rajsbaum S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg


Given two sequences X and Y that are strings over some alphabet set, we consider the distance d(X, Y ) between them defined to be minimum number of character replacements and block (substring) reversals needed to transform X to Y (or vice versa). This is the “simplest” sequence comparison problem we know of that allows natural block edit operations. Block reversals arise naturally in genomic sequence comparison; they are also of interest in matching music data. We present an improved algorithm for exactly computing the distance d(X, Y ); it takes time O(X log2X), and hence, is near-linear. Trivial approach takes quadratic time and the best known previous algorithm for this problem takes time ω(X log3X).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • S. Muthukrishnan
    • 1
  • S. Cenk Sahinalp
    • 2
  1. 1.AT& T Labs - ResearchFlorham Park
  2. 2.Dept of EECS, Dept of Genetics, and Cntr for Computational GenomicsCase Western Reserve UniversityCleveland

Personalised recommendations