A framework for orthology assignment from gene rearrangement data

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

Volumn 3678 LNBI, Issue , 2005, Pages 153-166

  Swenson, Krister M ^a   Pattengale, Nicholas D ^a   Moret, B M E ^a  

^a University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA ACQUISITION; GENETIC ENGINEERING; OPTIMIZATION;

COMPUTATIONAL BIOLOGY; GENE REARRANGEMENTS; ORGANELLAR GENOMES; PHYLOGENETIC RECONSTRUCTION;

GENE TRANSFER;

EID: 33646122213     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554714_14     Document Type: Conference Paper

References (27)

1. D.A. Bader, B.M.E. Moret, and M. Yan. A fast linear-time algorithm for inversion distance with an experimental comparison. J. Comput. Biol., 8(5):483-491, 2001.
2. M. Blanchette, T. Kunisawa, and D. Sankoff. Gene order breakpoint evidence in animal mitochondrial phylogeny. J. Mol. Evol., 49:193-203, 1999.
3. J.L. Boore. Phylogenies derived from rearrangements of the mitochondrial genome. In N. Saitou, editor, Proc. Int'l Inst. for Advanced Studies Symp. on Biodiversity, pages 9-20, Kyoto, Japan, 1999.
4. J.L. Boore and W.M. Brown. Big trees from little genomes: Mitochondrial gene order as a phylogenetic tool. Curr. Opinion Genet. Dev., 8(6):668-674, 1998.
5. J.L. Boore, T. Collins, D. Stanton, L. Daehler, and W.M. Brown. Deducing the pattern of arthropod phylogeny from mitochondrial DNA rearrangements. Nature, 376:163-165, 1995.
6. D. Bryant. The complexity of calculating exemplar distances. In D. Sankoff and J. Nadeau, editors, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pages 207-212. Kluwer Academic Publishers, Dordrecht, NL, 2000.
7. A. Caprara. On the tightness of the alternating-cycle lower bound for sorting by reversals. J. Combin. Optimization, 3:149-182, 1999.
8. X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi, and T. Jiang. Computing the assignment of orthologous genes via genome rearrangement. In Proc. 3rd Asia Pacific Bioinformatics Conf. (APBC'05), pages 363-378. Imperial College Press, London, 2005.
9. M.E. Cosner, R.K. Jansen, B.M.E. Moret, L.A. Raubeson, L. Wang, T. Warnow, and S.K. Wyman. An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae. In D. Sankoff and J.H. Nadeau, editors, Comparative Genomics, pages 99-122. Kluwer Academic Publishers, Dordrecht, NL, 2000.
10. S.R. Downie and J.D. Palmer. Use of chloroplast DNA rearrangements in reconstructing plant phylogeny. In D.E. Soltis, P.S. Soltis, and J. J. Doyle, editors, Molecular Systematics of Plants, pages 14-35. Chapman and Hall, New York, 1992.
11. J. Earnest-De Young, E. Lerat, and B.M.E. Moret. Reversing gene erosion: reconstructing ancestral bacterial genomes from gene-content and gene-order data. In Proc. 4th Int'l Workshop Algs. in Bioinformatics (WABI'04), volume 3240 of Lecture Notes in Computer Science, pages 1-13. Springer Verlag, Berlin, 2004.
12. N. El-Mabrouk. Genome rearrangement by reversals and insertions/deletions of contiguous segments. In Proc. 11th Ann. Symp. Combin. Pattern Matching (CPM'00), volume 1848 of Lecture Notes in Computer Science, pages 222-234. Springer Verlag, Berlin, 2000.
13. N. El-Mabrouk. Reconstructing an ancestral genome using minimum segments duplications and reversals. J. Comput. Syst. Sci., 65:442-464, 2002.
14. S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proc. 27th Ann. ACM Symp. Theory of Comput. (STOC'95), pages 178-189. ACM Press, New York, 1995.
15. B. Larget, D.L. Simon, and J.B. Kadane. Bayesian phylogenetic inference from animal mitochondrial genome arrangements. J. Royal Stat. Soc. B, 64(4):681-694, 2002.
16. M. Marron, K.M. Swenson, and B.M.E. Moret. Genomic distances under deletions and insertions. Theor. Computer Science, 325(3):347-360, 2004.
17. B.M.E. Moret, J. Tang, and T. Warnow. Reconstructing phytogenies from gene-content and gene-order data. In O. Gascuel, editor, Mathematics of Evolution and Phylogeny, pages 321-352. Oxford University Press, UK, 2005.
18. C. Thach Nguyen, Y.C. Tay, and L. Zhang. Divide-and-conquer approach for the exemplar breakpoint distance. Bioinformatics, 21(10):2171-2176, 2005.
19. D. Sankoff. Genome rearrangement with gene families. Bioinformatics, 15(11):990-917, 1999.
20. D. Sankoff and M. Blanchette. The median problem for breakpoints in comparative genomics. In Proc. 3rd Int'l Conf. Computing and Combinatorics (COCOON'97), volume 1276 of Lecture Notes in Computer Science, pages 251-264. Springer Verlag, Berlin, 1997.
21. D. Sankoff and M. Blanchette. Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol., 5:555-570, 1998.
22. D. Sankoff, D. Bryant, M. Deneault, B.F. Lang, and G. Burger. Early Eukaryote evolution based on mitochondrial gene order breakpoints. J. Comput. Biol., 7(3):521-536, 2000.
23. D. Sankoff and J. Nadeau, editors. Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families. Kluwer Academic Publishers, Dordrecht, NL, 2000.
24. J.C. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS Publishers, Boston, MA, 1997.
25. K.M. Swenson, M. Marron, I.V. Earnest-DeYoung, and B.M.E. Moret. Approximating the true evolutionary distance between two genomes. In Proc. 7th SIAM Workshop on Algorithm Engineering & Experiments (ALENEX'05). SIAM Press, Philadelphia, 2005.
26. J. Tang, B.M.E. Moret, L. Cui, and C.W. dePamphilis. Phylogenetic reconstruction from arbitrary gene-order data. In Proc. 4th IEEE Symp. on Bioinformatics and Bioengineering BIBE'04, pages 592-599. IEEE Press, Piscataway, NJ, 2004.
27. G. Tesler. Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci., 65(3):587-609, 2002.