Reconstructing ancestral gene orders using conserved intervals

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

Volumn 3240, Issue , 2004, Pages 14-25

  Bergeron, Anne ^a   Blanchette, Mathieu ^b   Chateau, Annie ^a   Chauve, Cedric ^b  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; BIOLOGY; TOPOLOGY;

CONSERVED INTERVALS; GENE ORDERS; INTERNAL NODES; MEASURE OF SIMILARITIES; PHYLOGENETIC RECONSTRUCTION; SET-THEORETIC OPERATIONS; SIMILARITY MEASURE; TREE TOPOLOGY;

GENES;

EID: 35048875232     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30219-3_2     Document Type: Article

References (23)

1. D.A. Bader, B.M.E. Moret, and M. Yan. A linear-time algorithm for computing inversion distances between signed permutations with an experimental study. J. Comput. Biol., 8(5):483-491, 2001.
2. A. Bergeron, M. Blanchette, A. Chateau, and G. Chauve. Implementation of operations on sets of conserved intervals. Technical report, Computer Science Department, UQAM, To appear.
3. A. Bergeron, J. Mixtaci, and J. Stoye. The reversal distance problem. In O. Gascuel, editor, Mathematics of phylogeny and evolution. Oxford University Press, To appear in 2004.
4. A. Bergeron and J. Stoye. On the similarity of sets of permutations and its applications to genome comparison. In 9th Annual International Conference on Computing and Combinatorics (COCOON 2003), volume 2697 of Lecture Notes in Comput. Sci., pages 68-79. Springer, 2003.
5. M. Blanchette, T. Kunisawa, and D. Sankoff. Gene order breakpoint evidence in animal mitochondrial phylogeny. J. Mol. Evol., 19(2):193-203, 1999.
6. M. Blanchette, T. Kunisawa, and D. Sankoff. Parametric genome rearrangement. Gene, 172(1):GC11-17, 2001.
7. K.S. Booth and G.S. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. System Sci., 13(3):335-379, 1976.
8. G. Bourque and P.A. Pevzner. Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res., 12(1):26-36, 2002.
9. A. Caprara. Formulations and complexity of multiple sorting by reversals. In 3rd Annual International Conference on Research in Computational Molecular Biology (RECOMB 1999), pages 84-93. ACM Press, 1999.
10. M.E. Cosner, R.K. Jansen, B.M.E. Moret, L.A. Raubeson, L.S. 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. Nadeau, editors, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families (DCAF 2000), pages 99-212. Kluwer Academic Publishers, 2000.
11. J. Felsenstein. Inferring phylogenies. Sinauer Associates, 2003.
12. W. Fitch. Toward defining the course of evolution: Minimum change for a specific tree topology. Systematic Zoology, 20:406-416, 1971.
13. S. Hannenhalli and P.A. Pevzner. Transforming men into mice (polynomial algorithm for genomic distance problem). In 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pages 581-592. IEEE Comput. Soc. Press, 1995.
14. S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM, 46(1):l-27, 1999.
15. J.A. Hartigan. Minimum mutation fits to a given tree. Biometrics, 29:53-65, 1973.
16. B. Larget, D.L. Simon, and J.B. Kadane. Bayesian phylogenetic inference from animal mitochondrial genome arrangements. J. R. Stat. Soc. Ser. B Stat. Methodol., 64(4):681-693, 2002.
17. B.M.E. Moret, A.C. Siepel, J. Tang, and T. Liu. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In 2nd International Workshop on Algorithms in Bioinformatics (WABI 2002), volume 2452 of Lecture Notes in Comput. Sci., pages 521-536. Springer, 2001.
18. B.M.E. Moret, J. Tang, and T. Warnow. Reconstructing phylogenies from gene-content and gene-order data. In O. Gascuel, editor, Mathematics of phylogeny and evolution. Oxford University Press, To appear in 2004.
19. B.M.E. Moret, S. Wyman, D.A. Bader, T. Warnow, and M. Yan. A new implementation and detailed study of breakpoint analysis. In 6th Pacific Symposium on Biocomputing (PSB 2001), pages 583-594, 2001.
20. D. Sankoff. Rearrangements and chromosomal evolution. Curr. Opin. Genet. Dev., 13(6):583-587, 2003.
21. D. Sankoff and M. Blanchette. Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol., 5(3):555-570, 1998.
22. D. Sankoff, G. Leduc, N. Antoine, B. Paquin, B.F. Lang, and R. Cedergren. Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. U.S.A., 89(14):6575-6579, 1992.
23. J. Tang and B.M.E. Moret. Scaling up accurate phylogenetic reconstruction from gene-order data. Bioinformatics, 19(Suppl. 1):i305-312, 2003.