z-logo
open-access-imgOpen Access
Rearrangement Models and Single-Cut Operations
Author(s) -
Paul Medvedev,
Jens Stoye
Publication year - 2009
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/978-3-642-04744-2_8
Subject(s) - computer science , join (topology) , set (abstract data type) , algorithm , theoretical computer science , formal description , mathematics , programming language , combinatorics
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom