An efficient algorithm for sequence comparison with block reversals

Authors:
S. Muthukrishnan;S. Cenk Sahinalp
Affiliations:
Department of CS, Rutgers University, and AT&T Labs - Research, Florham, Park, NJ;Department of EECS, Case Western Reserve University, Cleveland, OH and Department of Genetics, Case Western Reserve University, Cleveland, OH and Center for Computational Genomics, Case Western Re ...
Venue:
Theoretical Computer Science - Latin American theorotical informatics
Year:
2004

Citing 8
Cited 1

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
Data compression: methods and theory

Data compression: methods and theory
Block edit models for approximate string matching

Theoretical Computer Science - Special issue: Latin American theoretical informatics
Approximate nearest neighbors and sequence comparison with block operations

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The string-to-string correction problem with block moves

ACM Transactions on Computer Systems (TOCS)
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
An Improved Algorithm for Sequence Comparison with Block Reversals

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Rapid identification of repeated patterns in strings, trees and arrays

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing

An algorithm with linear expected running time for string editing with substitutions and substring reversals

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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). The operations are required to be disjoint. 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 algorithm for exactly computing the distance d(X,Y); it takes time O(|X|log2|X|), and hence, is near-linear. Trivial approach takes quadratic time.