Rearrangement Models and Single-Cut Operations

被引:2
作者
Bergeron, Anne [2 ]
Medvedev, Paul [1 ]
Stoye, Jens [3 ]
机构
[1] Univ Toronto, Dept Comp Sci, Toronto, ON M5S 3G4, Canada
[2] Univ Quebec, Dept Informat, Montreal, PQ H3C 3P8, Canada
[3] Univ Bielefeld, Tech Fak, Bielefeld, Germany
关键词
double-cut and join; rearrangement models; single-cut and join; SIGNED PERMUTATIONS; BREAKPOINT REUSE; GENOME; ALGORITHM; INVERSION; DISTANCE;
D O I
10.1089/cmb.2010.0091
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
There have been many widely used genome rearrangement models, such as reversals, Hannenhalli-Pevzner (HP), 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 settheoretic definition, which allows us to investigate and prove relationships between distances under various existing and new models. Among our results is that sorting in the HP model is equivalent to sorting in the reversal model when the initial and final genomes are linear uni-chromosomal. 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.
引用
收藏
页码:1213 / 1225
页数:13
相关论文
共 28 条
  • [1] Adam Z, 2008, EVOL BIOINFORM, V4, P69
  • [2] Are there rearrangement hotspots in the human genome?
    Alekseyev, Max A.
    Pevzner, Pavel A.
    [J]. PLOS COMPUTATIONAL BIOLOGY, 2007, 3 (11) : 2111 - 2121
  • [3] Alekseyev MA, 2007, PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P665
  • [4] A linear-time algorithm for computing inversion distance between signed permutations with an experimental study
    Bader, DA
    Moret, BME
    Yan, M
    [J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 2001, 8 (05) : 483 - 491
  • [5] Bergeron A, 2008, LECT N BIOINFORMAT, V5267, P226, DOI 10.1007/978-3-540-87989-3_17
  • [6] Bergeron A, 2006, LECT NOTES COMPUT SC, V4175, P163
  • [7] A new linear time algorithm to compute the genomic distance via the double cut and join distance
    Bergeron, Anne
    Mixtacki, Julia
    Stoye, Jens
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (51) : 5300 - 5316
  • [8] ON THE PROBLEM OF SORTING BURNT PANCAKES
    COHEN, DS
    BLUM, M
    [J]. DISCRETE APPLIED MATHEMATICS, 1995, 61 (02) : 105 - 120
  • [9] Dobzhansky T, 1938, GENETICS, V23, P28
  • [10] Feijao P, 2009, LECT N BIOINFORMAT, V5724, P85, DOI 10.1007/978-3-642-04241-6_8