On the similarity of sets of permutations and its applications to genome comparison

Journal of Computational Biology

Volumn 13, Issue 7, 2006, Pages 1340-1354

  Bergeron, Anne ^a   Stoye, Jens ^b  

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

^b BIELEFELD UNIVERSITY   (Germany)

Author keywords

Conserved intervals; Gene order analysis; Genome comparison; Interval distance

Indexed keywords

ARTICLE; GENE LOCATION; GENE ORDER; GENE REARRANGEMENT; GENE SEQUENCE; GENETIC ALGORITHM; GENETIC ANALYSIS; GENETIC DISTANCE; GENETIC PARAMETERS; GENOME ANALYSIS; MATHEMATICAL GENETICS; MATHEMATICAL PARAMETERS; PERMUTATION; PRIORITY JOURNAL;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; GENE ORDER; GENE REARRANGEMENT; GENOME; MITOCHONDRIA;

EID: 33846231454     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.13.1340     Document Type: Article

References (24)

1. Ajana, Y., Lefebvre, J.-F., Tillier, E.R.M., et al. 2002. Exploring the set of all minimal sequences of reversals-an application to test the replication-directed reversal hypothesis. Lect. Notes Comput. Sci. 2452, 300-315.
2. Bader, D.A., Moret, B.M.E., and Yan, M. 2001. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comput. Biol. 8, 483-491.
3. Bafna, V., and Pevzner, P.A. 1998. Sorting by transpositions. SIAM J. Discrete Math. 11, 224-240.
4. Bergeron, A., Blanchette, M., Chateau, A., et al. 2004. Reconstructing ancestral gene orders using conserved intervals. LNBI 3240, 14-25.
5. Bergeron, A., Heber, S., and Stoye, J. 2002. Common intervals and sorting by reversals: a marriage of necessity. Bioinformatics 18, S54-S63.
6. Bergeron, A., and Stoye, J. 2003. On the similarity of sets of permutations and its applications to genome comparison. Lect. Notes Comput. Sci. 2697, 68-79.
7. Blanchette, M., Kunisawa, T., and Sankoff, D. 1999. Gene order breakpoint evidence in animal mitochondrial phylogeny. J. Mol. Evol. 49, 193-203.
8. Booth, K.S., and Lueker, G.S. 1976. Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335-379.
9. Bourque, G., and Pevzner, P.A. 2002. Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res. 12, 26-36.
10. Christie, D.A. 1998. Genome rearrangement problems. [Ph.D. dissertation thesis]. University of Glasgow, Scotland.
11. DOE Joint Genome Institute Mitochondrial Database, http://evogen.jgi. doe.gov/cgi-bin/Mt_gene_order_browser.cgi. Accessed August 21, 2006.
12. Hannenhalli, S. 1996. Polynomial algorithm for computing translocation distance between genomes. Discrete Appl. Math. 71, 137-151.
13. Hannenhalli, S., and Pevzner, P.A. 1995. Transforming men into mice (polynomial algorithm for genomic distance problem). Proc. FOCS, 581-592.
14. Hannenhalli, S., and Pevzner, P.A. 1999. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46, 1-27.
15. Heber, S., and Stoye, J. 2001. Finding all common intervals of k permutations. Lect. Notes Comput. Sci. 2089, 207-218.
16. Kaplan, H., Shamir, R., and Tarjan, R.E. 1999. A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput. 29, 880-892.
17. Kececioglu, J.D., and Sankoff, D. 1994. Efficient bounds for oriented chromosome inversion distance. Lect. Notes Comput. Sci. 807, 307-325.
18. Larget, B., Kadane, J., and Simon, D. 2002. A Markov chain Monte Carlo approach to reconstructing ancestral genome rearrangements. Technical report. Carnegie Mellon University, Pittsburgh. http://www.stat.cmu.edu/tr/tr765/ tr765.pdf. Accessed August 21, 2006.
19. Moret, B.M.E., Siepel, A.C., Tang, J., et al. 2002. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. Lect. Notes Comput. Sci. 2452, 521-536.
20. Ozery-Flato, M., and Shamir, R. 2003. Two notes on genome rearrangements. J. Bioinf. Comput. Biol. 1, 71-94.
21. Sankoff, D. 2002. Short inversions and conserved gene clusters. Bioinformatics 18, 1305-1308.
22. Siepel, A. 2002. An algorithm to find all sorting reversals. Proc. RECOMB'02 281-290.
23. Tesler, G. 2002. Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci. 65, 587-609.
24. Uno, T., and Yagiura, M. 2000. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26, 290-309.