An experimental evaluation of inversion- and transposition-based genomic distances through simulations

2007 IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology, CIBCB 2007

Volumn , Issue , 2007, Pages 151-158

  Kothari, Moulik ^a   Moret, Bernard M E ^a,b,c  

^a MSC01 1070   (United States)

^b EPFL   (Switzerland)

^c SWISS INSTITUTE OF BIOINFORMATICS   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPARATIVE GENOMICS; EVOLUTIONARY RATE; EXPERIMENTAL EVALUATION; GENOME COMPARISON; PAIRWISE DISTANCES; PHYLOGENETIC RECONSTRUCTION; SIMULATED EVOLUTIONS; TRANSPOSITION DISTANCES;

ARTIFICIAL INTELLIGENCE; GENES; TREES (MATHEMATICS);

BIOINFORMATICS;

EID: 84885964832     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. B. Moret, J. Tang, and T. Warnow, "Reconstructing phylogenies from gene-content and gene-order data," in Mathematics of Evolution and Phylogeny, O. Gascuel, Ed. Oxford University Press, 2005, pp. 321-352.
2. B. Moret and T. Warnow, "Advances in phylogeny reconstruction from gene order and content data," in Molecular Evolution: Producing the Biochemical Data, Part B, ser. Methods in Enzymology, E. Zimmer and E. Roalson, Eds. Elsevier Publishers, 2005, vol. 395, pp. 673-700. (Pubitemid 40754392)
3. G. Andelfinger, C. Hitte, L. Etter, R. Guyon, G. Bourque, G. Tesler, P. Pevzner, E. Kirkness, F. Galibert, and D. Benson, "Detailed four-way comparative mapping and gene order analysis of the canine ctvm locus reveals evolutionary chromosome rearrangements," Genomics, vol. 83, pp. 1053-1062, 2004. (Pubitemid 38726053)
4. P. Pevzner and G. Tesler, "Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution," Proc. Nat'l Acad. Sci., USA, vol. 100, no. 13, pp. 7672-7677, 2003. (Pubitemid 36760028)
5. -, "Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution," Proc. Nat'l Acad. Sci., USA, vol. 100, no. 13, pp. 7672-7677, 2003. (Pubitemid 36760028)
6. G. Tesler, "Efficient algorithms for multichromosomal genome rearrangements," J. Comput. Syst. Sci., vol. 65, no. 3, pp. 587-609, 2002.
7. G. Bourque, Y. Yacef, and N. El-Mabrouk, "Maximizing synteny blocks to identify ancestral homologs," in Proc. 3rd RECOMB Workshop Com- parative Genomics (RECOMBCG'05), ser. Lecture Notes in Computer Science, vol. 3678. Springer Verlag, 2005, pp. 21-34.
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). Imperial College Press, London, 2005, pp. 363-378.
9. K. Swenson, N. Pattengale, and B. Moret, "A framework for orthology assignment from gene rearrangement data," in Proc. 3rd RECOMB Workshop Comparative Genomics (RECOMBCG'05), ser. Lecture Notes in Computer Science, vol. 3678. Springer Verlag, 2005, pp. 153-166.
10. D. Sankoff and J. Nadeau, "Conserved synteny as a measure of genomic distance," Disc. Appl. Math., vol. 71, no. 1-3, pp. 247-257, 1996. (Pubitemid 126391782)
11. M. Blanchette, G. Bourque, and D. Sankoff, "Breakpoint phylogenies," in Genome Informatics, S. Miyano and T. Takagi, Eds. Tokyo: Univ. Academy Press, 1997, pp. 25-34.
12. D. Sankoff and M. Blanchette, "Multiple genome rearrangement and breakpoint phylogeny," J. Comput. Biol., vol. 5, pp. 555-570, 1998. (Pubitemid 28436301)
13. S. Hannenhalli and P. Pevzner, "Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals)," in Proc. 27th Ann. ACM Symp. Theory of Comput. (STOC'95). ACM Press, New York, 1995, pp. 178-189.
14. -, "Transforming mice into men (polynomial algorithm for genomic distance problems)," in Proc. 36th Ann. IEEE Symp. Foundations of Comput. Sci. (FOCS'95). IEEE Press, Piscataway, NJ, 1995, pp. 581-592.
15. D. Bader, B. Moret, and M. Yan, "A fast linear-time algorithm for inversion distance with an experimental comparison," J. Comput. Biol., vol. 8, no. 5, pp. 483-491, 2001. (Pubitemid 33044073)
16. V. Bafna and P. Pevzner, "Sorting permutations by transpositions," in Proc. 6th Ann. ACM/SIAM Symp. Discrete Algs. (SODA'95). SIAM Press, Philadelphia, 1995, pp. 614-623.
17. T. Hartman, "A simpler 1.5-approximation algorithm for sorting by transpositions," in Proc. 14th Ann. Symp. Combin. Pattern Matching (CPM'03), ser. Lecture Notes in Computer Science, vol. 2676. Springer Verlag, 2003, pp. 156-169.
18. I. Elias and T. Hartman, "A 1.375-approximation algorithm for sorting by transpositions," in Proc. 5th Int'l Workshop Algs. in Bioinformatics (WABI'05), ser. Lecture Notes in Computer Science, vol. 3692. Springer Verlag, 2005, pp. 204-215.
19. D. Christie, "Sorting permutations by block-interchanges," Inf. Process. Lett., vol. 60, no. 4, pp. 165-169, 1996. (Pubitemid 126383390)
20. S. Yancopoulos, O. Attie, and R. Friedberg, "Efficient sorting of genomic permutations by translocation, inversion and block interchange," Bioinformatics, vol. 21, no. 16, pp. 3340-3346, 2005. (Pubitemid 41222437)
21. A. Bergeron, J. Mixtacki, and J. Stoye, "A unifying view of genome rearrangements," in Proc. 6th Int'l Workshop Algs. in Bioinformatics (WABI'06), ser. Lecture Notes in Computer Science, vol. 4175. Springer Verlag, 2006, pp. 163-173. (Pubitemid 44609667)
22. B. Moret, J. Tang, L.-S. Wang, and T. Warnow, "Steps toward accurate reconstructions of phylogenies from gene-order data," J. Comput. Syst. Sci., vol. 65, no. 3, pp. 508-525, 2002. (Pubitemid 41161953)
23. L.-S. Wang and T. Warnow, "Distance-based genome rearrangement phylogeny," in Mathematics of Evolution and Phylogeny, O. Gascuel, Ed. Oxford University Press, 2005, pp. 353-383.
24. N. Saitou and M. Nei, "The neighbor-joining method: A new method for reconstructing phylogenetic trees," Mol. Biol. Evol., vol. 4, pp. 406-425, 1987.
25. D. Robinson and L. Foulds, "Comparison of phylogenetic trees," Math- ematical Biosciences, vol. 53, pp. 131-147, 1981. (Pubitemid 11129084)
26. B. Moret, A. Siepel, J. Tang, and T. Liu, "Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data," in Proc. 2nd Int'l Workshop Algs. in Bioinformatics (WABI'02), ser. Lecture Notes in Computer Science, vol. 2452. Springer Verlag, 2002, pp. 521-536.
27. L.-S. Wang, R. Jansen, B. Moret, L. Raubeson, and T. Warnow, "Distance-based genome rearrangement phylogeny," J. Mol. Evol., vol. 63, no. 4, pp. 473-483, 2006. (Pubitemid 44611734)
28. M. Sanderson, "r8s: inferring absolute rates of evolution and divergence times in the absence of a molecular clock," Bioinformatics, vol. 19, pp. 301-302, 2003. (Pubitemid 36181923)
29. J. Tang, B. Moret, L. Cui, and C. dePamphilis, "Phylogenetic reconstruction from arbitrary gene-order data," in Proc. 4th IEEE Symp. on Bioinformatics and Bioengineering BIBE'04. IEEE Press, Piscataway, NJ, 2004, pp. 592-599.
30. M. Marron, K. Swenson, and B. Moret, "Genomic distances under deletions and insertions," Theor. Computer Science, vol. 325, no. 3, pp. 347-360, 2004.
31. K. Swenson, M. Marron, J. Earnest-DeYoung, and B. Moret, "Approximating the true evolutionary distance between two genomes," in Proc. 7th SIAM Workshop on Algorithm Engineering & Experiments (ALENEX'05). SIAM Press, Philadelphia, 2005.
32. J.-F. Lefebvre, N. El-Mabrouk, E. Tillier, and D. Sankoff, "Detection and validation of single gene inversions," in Proc. 11th Int'l Conf. on Intelligent Systems for Mol. Biol. (ISMB'03), ser. Bioinformatics, vol. 19. Oxford U. Press, 2003, pp. i190-i196. (Pubitemid 41185618)
33. D. Sankoff, "Short inversions and conserved gene cluster," Bioinformat- ics, vol. 18, no. 10, p. 1305, 2002.