Finding all sorting tandem duplication random loss operations

Journal of Discrete Algorithms

Volumn 9, Issue 1, 2011, Pages 32-48

  Bernt, Matthias ^a   Chen, Kuan Yu ^b   Chen, Ming Chiang ^b   Chu, An Chiang ^b   Merkle, Daniel ^c   Wang, Hung Lung ^b   Chao, Kun Mao ^b   Middendorf, Martin ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Genome rearrangement; Permutation; Tandem duplication random loss; TDRL

Indexed keywords

BIOLOGICAL STUDIES; DUPLICATED GENES; EVOLUTIONARY HISTORY; GENE ORDERS; GENOME REARRANGEMENTS; MITOCHONDRIAL GENES; PERMUTATION; RANDOM LOSS; TANDEM DUPLICATION RANDOM LOSS; TDRL; THEORETICAL POINTS;

GENES;

EID: 79551578902     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2010.09.006     Document Type: Conference Paper

References (24)

1. Y. Ajana, J.F. Lefebvre, E.R. Tillier, and N. El-Mabrouk Exploring the set of all minimal sequences of reversals - an application to test the replication-directed reversal hypothesis Algorithms in Bioinformatics, Second International Workshop, WABI 2002, Proceedings Lecture Notes in Computer Science vol. 2452 2002 Springer 300 315
2. D. Aldous, and P. Diaconis Shuffling cards and stopping times The American Mathematical Monthly 93 1986 333 348
3. V. Bafna, and P.A. Pevzner Sorting permutations by transpositions Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 1995 Society for Industrial and Applied Mathematics 614 623
4. D. Bayer, and P. Diaconis Trailing the dovetail shuffle to its lair The Annals of Applied Probability 2 1992 294 313
5. M. Bernt, Gene order rearrangement methods for the reconstruction of phylogeny, PhD thesis, Universität Leipzig, 2010.
6. M. Bernt, M.C. Chen, D. Merkle, H.L. Wang, K.M. Chao, M. Middendorf, Finding all sorting tandem duplication random loss operations, in: Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Proceedings, in: Lecture Notes in Computer Science, vol. 5577, Springer, pp. 301-313.
7. M. Bernt, D. Merkle, and M. Middendorf Using median sets for inferring phylogenetic trees Bioinformatics 23 2007 129 135
8. J.L. Boore The duplication/random loss model for gene rearrangement exemplified by mitochondrial genomes of deuterostome animals D. Sankoff, J.H. Nadeau, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families Computational Biology Series vol. 1 2000 Kluwer Academic Publishers 133 147
9. M. Bouvel, and D. Rossin A variant of the tandem duplication - random loss model of genome rearrangement Theoretical Computer Science 410 2009 847 858
10. M. Braga, M.F. Sagot, C. Scornavacca, and E. Tannier Exploring the solution space of sorting by reversals, with experiments and an application to evolution IEEE/ACM Transactions on Computational Biology and Bioinformatics 5 2008 348 356
11. K. Chaudhuri, K. Chen, R. Mihaescu, and S. Rao On the tandem duplication-random loss model of genome rearrangement Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006 2006 ACM 564 570
12. N. El-Mabrouk Duplication, rearrangement and reconciliation D. Sankoff, J.H. Nadeau, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families Computational Biology Series vol. 1 2000 Kluwer Academic Publishers 537 550
13. C.M. Grinstead, and J.L. Snell Introduction to Probability 2006 American Mathematical Society http://www.dartmouth.edu/~chance/teaching-aids/books- articles/probability-book/book.html
14. S. Hannenhalli, and P.A. Pevzner Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing 1995 ACM 178 189
15. J.G. Inoue, M. Miya, K. Tsukamoto, and M. Nishida Evolution of the deep-sea gulper eel mitochondrial genomes: Large-scale gene rearrangements originated within the eels Molecular Biology and Evolution 20 2003 1917 1924
16. D.V. Lavrov, J.L. Boore, and W.M. Brown Complete mtDNA sequences of two millipedes suggest a new model for mitochondrial gene rearrangements: Duplication and nonrandom loss Molecular Biology and Evolution 19 2002 163 169
17. D.S. Mauro, D.J. Gower, R. Zardoya, and M. Wilkinson A hotspot of gene order rearrangement by tandem duplication and random loss in the vertebrate mitochondrial genome Molecular Biology and Evolution 23 2006 227 234
18. M. Miya, T.P. Satoh, and M. Nishida The phylogenetic position of toadfishes (order batrachoidiformes) in the higher ray-finned fish as inferred from partitioned Bayesian analysis of 102 whole mitochondrial genome sequences Biological Journal of the Linnean Society 85 2005 289 306
19. A. Ouangraoua, and A. Bergeron Parking functions, labeled trees and DCJ sorting scenarios Comparative Genomics Lecture Notes in Computer Science vol. 5817 2009 Springer 24 35
20. A.J. Schwenk Elementary problem: E3143 The American Mathematical Monthly 93 1986 299
21. A.J. Schwenk E3143 The American Mathematical Monthly 95 1988 352
22. A.C. Siepel An algorithm to enumerate sorting reversals for signed permutations Journal of Computational Biology 10 2003 575 597
23. K.M. Swenson, M. Marron, J.V. Earnest-DeYoung, and B.M.E. Moret Approximating the true evolutionary distance between two genomes ACM Journal of Experimental Algorithmics 12 2006 3.5
24. J. Tang, B.M.E. Moret, L. Cui, and C.W. dePamphilis Phylogenetic reconstruction from arbitrary gene-order data 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004) 2004 IEEE Computer Society 592 599