Finding All sorting tandem duplication random loss operations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5577 LNCS, Issue , 2009, Pages 301-313

  Bernt, Matthias ^a   Chen, Ming 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

[No Author keywords available]

Indexed keywords

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

PATTERN MATCHING; PHASE MODULATION;

GENES;

EID: 70350655784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02441-2_27     Document Type: Conference Paper

References (16)

1. Ajana, Y., Lefebvre, J.-F., Tillier, E.R.M., El-Mabrouk, N.: Exploring the set of all minimal sequences of reversals an application to test the replication-directed reversal hypothesis. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 300-315. Springer, Heidelberg (2002)
2. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM Journal on Discrete Mathematics 11, 224-240 (1998)
3. Bernt, M., Merkle, D., Middendorf, M.: Using median sets for inferring phylogenetic trees. Bioinformatics 23(2), 129-135 (2007)
4. Boore, J.L.: The duplication/random loss model for gene rearrangement exemplified by mitochondrial genomes of deuterostome animals. In: Comparative genomics. Computational biology series, vol. 1, pp. 133-147. Kluwer, Dordrecht (2000)
5. Bouvel, M., Rossin, D.: A variant of the tandem duplication - random loss model of genome rearrangement. Theoretical Computer Science 410(8-10), 847-858 (2009)
6. Braga, M., Sagot, M.-F., Scornavacca, C., Tannier, E.: Exploring the solution space of sorting by reversals, with experiments and an application to evolution. IEEE/ACM Transactions on Computational Biology and Bioinformatics 5, 348-356 (2008)
7. Chaudhuri, K., Chen, K., Mihaescu, R., Rao, S.: On the tandem duplication-random loss model of genome rearrangement. In: SODA, pp. 564-570 (2006)
8. El-Mabrouk, N.: Genome rearrangement by reversals and insertions/deletions of contiguous segments. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 222-234. Springer, Heidelberg (2000)
9. Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. In: ACM Symposium on Theory of Computing, pp. 178-189 (1995)
10. Inoue, J.G., Miya, M., Tsukamoto, K., Nishida, M.: Evolution of the deep-sea guiper eel mitochondrial genomes: Large-scale gene rearrangements originated within the eels. Mol. Biol. Evol. 20, 1917-1924 (2003)
11. Lavrov, D.V., Boore, J.L., Brown, W.M.: Complete mtdna sequences of two millipedes suggest a new model for mitochondrial gene rearrangements: Duplication and nonrandom loss. Mol. Biol. Evol. 19, 163-169 (2002)
12. Mauro, D.S., Gower, D.J., Zardoya, R., Wilkinson, M.: A hotspot of gene order rearrangement by tandem duplication and random loss in the vertebrate mitochondrial genome. Mol. Biol. Evol. 23, 227-234 (2006)
13. Miya, M., Satoh, T.P., Nishida, M.: 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. Biol. J. Linn. Soc. Lond. 85, 289-306 (2005)
14. Siepel, A.C.: An algorithm to enumerate sorting reversals for signed permutations. Journal of Computational Biology 10(3-4), 575-597 (2003)
15. Swenson, K.M., Marron, M., Earnest-DeYoung, J.V., Moret, B.M.E.: Approximating the true evolutionary distance between two genomes. ACM Journal on Experimental Algorithmics 12(3.5) (2008)
16. Tang, J., Moret, B.M.E., Cui, L., de Pamphilis, C.W.: Phylogenetic reconstruction from arbitrary gene-order data. In: Proc. 4th IEEE Conf. on Bioinformatics and Bioengineering BIBE 2004, pp. 592-599 (2004)