There have been many widely used genome rearrangement models, such as reversals, Hannenhalli-Pevzner, and double-cut and join. Though each one can be precisely defined, the general notion of a model remains undefined. In this paper, we give a formal set-theoretic definition, which allows us to investigate and prove relationships between distances under various existing and new models. We also initiate the formal study of single-cut operations by giving a linear time algorithm for the distance problem under a new single-cut and join model. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Medvedev, P., & Stoye, J. (2009). Rearrangement models and single-cut operations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5817 LNBI, pp. 84–97). https://doi.org/10.1007/978-3-642-04744-2_8
Mendeley helps you to discover research relevant for your work.