An algorithm for inferring mitogenome rearrangements in a phylogenetic tree

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

Volumn 5267 LNBI, Issue , 2008, Pages 143-157

  Bernt, Matthias ^a   Merkle, Daniel ^b   Middendorf, Martin ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON INTERVALS; EXTENDED VERSIONS; GENE GROUPS; GENE ORDERS; MITOCHONDRIAL GENES; PHYLOGENETIC RELATIONSHIPS; PHYLOGENETIC TREES; RANDOM LOSS; STRONG INTERVAL TREES;

ALGORITHMS; DATA STRUCTURES; SET THEORY;

GRAPH THEORY;

EID: 70350545666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87989-3_11     Document Type: Conference Paper

References (21)

1. Arndt, A., Smith, M.J.: Mitochondrial gene rearrangement in the sea cucumber genus cucumaria. Mol. Biol. Evol. 15(8), 9-16 (1998)
2. Bérard, S., Bergeron, A., Chauve, C., Paul, C.: Perfect sorting by reversals is not always difficult. IEEE/ACM Transaction on Computational Biology and Bioinformatics 4(1), 4-16 (2007)
3. Bergeron, A., Chauve, C., de Montgolfier, F., Raffinot, M.: Computing common intervals of k permutations, with applications to modular decomposition of graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 779-790. Springer, Heidelberg (2005)
4. Bernt, M., Merkle, D., Ramsch, K., Fritzsch, G., Perseke, M., Bernhard, D., Schlegel, M., Stadler, P.F., Middendorf, M.: Crex: inferring genomic rearrangements based on common intervals. Bioinformatics 23, 2957-2958 (2007)
5. Blanchette, M., Kunisawa, T., Sankoff, D.: Gene order breakpoint evidence in animal mitochondrial phylogeny. J. Mol. Evol. 49, 193-203 (1999)
6. Boore, J.L.: Mitochondrial gene arrangement database (2006), http://evogen.jgi.doe.gov/
7. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. Journal of Computer and System Sciences 13, 335-379 (1976)
8. Caprara, A.: The reversal median problem. INFORMS Journal on Computing 15, 93-113 (2003)
9. Chaudhuri, K., Chen, K., Mihaescu, R., Rao, S.: On the tandem duplicationrandom loss model of genome rearrangement. In: SODA, pp. 564-570 (2006)
10. Heber, S., Stoye, J.: Algorithms for finding gene clusters. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol. 2149, pp. 252-263. Springer, Heidelberg (2001)
11. Inoue, J.G., Miya, M., Tsukamoto, K., Nishida, M.: Evolution of the deep-sea gulper eel mitochondrial genomes: large-scale gene rearrangements originated within the eels. Mol. Biol. Evol. 20, 1917-1924 (2003)
12. 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)
13. Littlewood, D.T.J., Smith, A.B., Cloug, h.K.A., Emson, R.H.: The interrelationships of the echinoderm classes: morphological and molecular evidence. Biol. J. Linn. Soc. 61, 409-438 (1997)
14. Miya, M., Takeshima, H., Endo, H., Ishiguro, N.B., Inous, J.G., Mukai, T., Satoh, T.P., Yamagucki, M., Kawaguchi, A., Mabuchi, K., Shirai, S.M., Nishida, M.: Major patterns of higher teleost phylogenies: a new perspective based on 100 complete mitochondrial dna sequences. Mol. Phyl. Evol. 26, 121-138 (2003)
15. Mooi, R., David, B.: Skeletal homologies of echinoderms. Paleont. Soc. Papers 3, 305-335 (1997)
16. Parida, L.: Using pq structures for genomic rearrangement phylogeny. Journal of Computational Biology 13(10), 1685-1700 (2006)
17. Perseke, M., Fritzsch, G., Ramsch, K., Bernt, M., Merkle, D., Middendorf, M., Bernhard, D., Stadler, P.F., Schlegel, M.: Evolution of mitochondrial gene orders in echinoderms. Mol. Phyl. Evol. (in press, 2008)
18. Sankoff, D.: Analytical approaches to genomic evolution. Biochimie 75, 409-413 (1993)
19. Scouras, A., Beckenbach, K., Arndt, A., Smith, M.J.: Complete mitochondrial genome dna sequence for two ophiuroids and a holothuroid: the utility of protein gene sequence and gene maps in the analyses of deep deuterostome phylogeny. Mol. Phyl. Evol. 31(1), 50-65 (2004)
20. Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26(2), 290-309 (2000)
21. Zhao, H., Bourque, G.: Recovering true rearrangement events on phylogenetic trees. In: Tesler, G., Durand, D. (eds.) RECMOB-CG 2007. LNCS (LNBI), vol. 4751, pp. 149-161. Springer, Heidelberg (2007)