Perfect sorting by reversals is not always difficult

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Volumn 4, Issue 1, 2007, Pages 4-16

  Bérard, Sèverine ^a   Bergeron, Anne ^b   Chauve, Cedric ^c   Paul, Christophe ^d  

^a CEMAGREF   (France)

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

^c SIMON FRASER UNIVERSITY   (Canada)

^d LIRMM   (France)

Author keywords

Common intervals; Evolution scenarios; Reversals

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; POLYNOMIALS; PROBLEM SOLVING;

COMMON INTERVALS; EVOLUTION SCENARIOS; HANNENHALLI-PEVZNER THEORY; REVERSALS;

SORTING;

RATTUS;

ALGORITHM; ANIMAL; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; GENE REARRANGEMENT; GENETICS; GENOME; GENOMICS; HUMAN; METHODOLOGY; MOLECULAR EVOLUTION; MOUSE; RAT; SYNTENY; X CHROMOSOMAL INHERITANCE;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; EVOLUTION, MOLECULAR; GENE REARRANGEMENT; GENES, X-LINKED; GENOME; GENOME, HUMAN; GENOMICS; HUMANS; MICE; MODELS, GENETIC; RATS; SYNTENY;

EID: 33847756694     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2007.1011     Document Type: Conference Paper

References (42)

1. Z. Adam, M. Turmel, C. Lemieux, and D. Sankoff, "Common Intervals and Symmetric Difference in a Model-Free Phylogenomics, with an Application to Streptophyte Evolution," Proc. Int'l Workshop Comparative Genomics (RCG '06), pp. 63-74, 2006.
2. D.A. Bader, B.ME. Moret, and M. Yan, "A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study," J. Computational Biology, vol. 8, no. 5, pp. 483-491, 2001.
3. E. Belda, A. Moya, and F.J. Silva, "Genome Rearrangement Distances and Gene Order Phylogeny in γ-Proteobacteria," Molecular Biology Evolution, vol. 22, no. 6, pp. 1456-1467, 2005.
4. S. Bérard, A. Bergeron, and C. Chauve, "Conserved Structures in Evolution Scenarios," Proc. Int'l Workshop Comparative Genomics (RECOMB '04), pp. 1-15, 2005.
5. A. Bergeron, M. Blanchette, A. Chateau, and C. Chauve, "Reconstructing Ancestral Gene Orders Using Conserved Intervals," Proc. Fourth Int'l Workshop Algorithms in Bioinformatics (WABI '04), pp. 14-25, 2004.
6. A. Bergeron, C. Chauve, T. Hartman, and K. St-Onge, "On the Properties of Sequences of Reversals that Sort a Signed Permutation," Proc. Journées Ouvertes Biologie, Informatique, Mathématiques (JOBIM '02), pp. 99-108, June 2002.
7. A. Bergeron, C. Chauve, F. de Montgolfier, and M. Raffinot, "Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs," Proc. 13th Ann. European Symp. Algorithms (ESA '05), pp. 779-790, 2005.
8. A. Bergeron, J. Mixtacki, and J. Stoye, "The Inversion Distance Problem," Math. Evolution and Phylogeny, O. Gascuel, ed., pp. 262-290, Oxford Univ. Press, 2005.
9. G. Bourque and P.A. Pevzner, "Genome-Scale Evolution: Reconstructing Gene Orders in the Ancestral Species," Genome Research, vol. 12, no. 1, pp. 26-36, 2002.
10. G. Bourque, E.M. Zdobnov, P. Bork, P.A. Pevzner, and G. Tesler, "Comparative Architectures of Mammalian and Chicken Genomes Reveal Highly Variables Rates of Genomic Rearrangements across Different Lineages," Genome Research, vol. 15, no. 1, pp. 98-110, 2005.
11. G. Bourque, P.A. Pevzner, and G. Tesler, "Reconstructing the Genomic Architecture of Ancestral Mammals: Lessons from Human, Mouse, and Rat Genomes," Genome Research, vol, 14, no. 4, pp. 507-516, 2004.
12. B.M.B. Xuan, M. Habib, and C. Paul, "Revisiting Uno and Yagiura's Algorithm," Proc. Int'l Symp. Algorithms and Computation (ISAAC '05), pp. 146-155, 2005.
13. A. Chateau, "Méthodes De Reconstruction de Génomes Ancestraux: Quelques Reflexions," Proc. Journées Ouvertes Biologie, Informatique, Mathématiques (JOBIM '05), July 2005.
14. M. Chein, M. Habib, and M.-C. Maurer, "Partitive Hypergraphs," Discrete Math., no. 37, pp. 35-50, 1981.
15. E. Dahlhaus, J. Gustedt, and R. McConnell, "Efficient and Practical Algorithm for Sequential Modular Decomposition Algorithm," /. Algorithms, vol. 41, no. 2, pp. 360-387, 2001.
16. J.V. Earnest-DeYoung, E. Lerat, and B.M.E. Moret, "Reversing Gene Erosion: Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data," Proc. Fourth Int'l Workshop Algorithms in Bioinformatics, (WABI '04), pp. 1-13, 2004.
17. M. Figeac and J.-S. Varré, "Sorting by Reversals with Common Intervals," Proc. Fourth Int'l Workshop Algorithms in Bioinformatics, (WABI '04), pp. 26-37, 2004.
18. R.A. Gibbs et al., "Genome Sequence of the Brown Norway Rat Yields Insights into Mammalian Evolution," Nature, vol. 428, no. 6982, pp. 493-521, 2004.
19. M. Habib, F. de Montgolfier, and C. Paul, "A Simple Linear-Time Modular Decomposition Algorithm," Proc. Ninth Scandinavian Workshop Algorithm Theory (SWAT '04), pp. 187-198, 2004.
20. M. Habib, C. Paul, and L. Viennot, "Partition Refinement: An Interesting Algorithmic Tool Kit," Int'l J. Foundations of Computer Science, vol. 10, no. 2, pp. 147-170, 1999.
21. S. Hannenhalli and P.A. Pevzner, "Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals," /. ACM, vol. 46, no. 1, pp. 1-27, 1999.
22. S. Heber and J. Stoye, "Finding All Common Intervals of k Permutations," Proc. 12th Int'l Symp. Combinatorial Pattern Matching (CPM '01), pp. 207-218, 2001.
23. H. Kaplan, R. Shamir, and R.E. Tarjan, "A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals," SIAM J. Computing, vol. 29, no, 3, pp. 880-892, 1999.
24. H. Kaplan and E. Verbin, "Sorting Signed Permutations by Reversals Revisited," J. Computing Systems Science, vol. 70, no. 3, pp. 321-341, 2005.
25. G.M. Landau, L. Parida, and O. Weimann, "Using PQ Trees for Comparative Genomics," Proc. 16th Ann. Symp. Combinatorial Pattern Matching (CPM '05), pp. 128-143, 2005.
26. B. Larget, D.L. Simon, J.B. Kadane, and D. Sweet, "A Bayesian Analysis of Metazoan Mitochondrial Genome Arrangements," Molecular Biology Evolution, vol. 22, no. 3, pp. 486-495, 2005.
27. W.C. Lathe III, B. Snel, and P. Bork, "Gene Context Conservation of a Highier Order than Operons," Trends Biochemical Science, vol. 25, no. 10, pp. 474-479, 2000.
28. R. McConnell and J. Spinrad, "Ordered Vertex Partitioning," Discrete Math. and Theoretical Computer Science, no. 4, pp. 45-60, 2000.
29. R.H. Möhring and F.J. Radermacher, "Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization," Annals of Discrete Math., no. 19, pp. 257-356, 1984.
30. F. de Montgolfier, "Décomposition Modulaire des Graphes. Theorie, Extensions et Algorithmes," PhD thesis, Univ. Montpellier II, France, 2003.
31. W.J. Murphy et al., "Dynamics of Mammalian Chromosome Evolution Inferred from Multispecies Comparative Maps," Science, vol. 309, no. 5734, pp. 613-617, 2005.
32. P.A. Pevzner and G. Tesler, "Genome Rearrangements in Mammalian Evolution: Lessons from Human and Mouse Genomes," Genome Research, vol. 13, no. 1, pp. 37-45, 2003.
33. P.A. Pevzner and G. Tesler, "Human and Mouse Genomic Sequences Reveal Extensive Breakpoint Reuse in Mammalian Evolution," Proc. Nat'1 Academy of Sciences USA, vol. 100, no. 13, pp. 7672-7677, 2003.
34. M.-F. Sagot and E. Tannier, "Perfect Sorting by Reversals," Proc. 11th Ann. Int'l Conf. Computing and Combinatorics (COCOON '05), pp. 42-52, 2005.
35. D. Sankoff, "Edit Distance for Genome Comparison Based on Non-Local Operations," Proc. Third Ann. Symp. Combinatorial Pattern Matching (CPM '92), pp. 121-135, 1992.
36. D. Sankoff and P. Trinh, "Chromosomal Breakpoint Reuse in Genome Sequence Rearrangements," J. Computational Biology, vol. 12, no. 6, pp. 812-821, 2005.
37. T. Schmidt and J. Stoye, "Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences," Proc. 15th Ann. Symp. Combinatorial Pattern Matching (CPM '04), pp. 347-358, 2004.
38. E. Tannier, A. Bergeron, and M.-F. Sagot, "Advances on Sorting by Reversals," Discrete Applied Math., 2005.
39. G. Tesler, "GRIMM: Genome Rearrangements Web Server," Bioinformatics, vol. 18, no. 3, pp. 492-493, 2002.
40. P. Trinh, A. McLysaght, and D. Sankoff, "Genomic Features in the Breakpoint Regions between Syntenic Blocks," Bioinformatics, vol. 20, suppl. 1: (ISMB/ECCB '04: Proc. 12th Int'l Conf. Intelligent Systems for Molecular Biology/Third European Conf. Computational Biology), pp. i318-i325, 2004.
41. T. Uno and M. Yagiura, "Fast Algorithms to Enumerate All Common Intervals of Two Permutations," Algorithmica, vol. 26, no. 2, pp. 290-309, 2000.
42. S. Yancopoulos, O. Attie, and S. Friedberg, "Efficient Sorting of Genomic Permutations by Translocation, Inversion and Block Interchange," Bioinformatics, vol. 21, no. 16, pp. 3340-3346, 2005.