Issues in the reconstruction of gene order evolution

Journal of Computer Science and Technology

Volumn 25, Issue 1, 2010, Pages 10-25

  Sankoff, David ^a   Zheng, Chunfang ^a,b   Muñoz, Adriana ^a   Yang, Zhenyu ^a   Adam, Zaky ^a,c   Warren, Robert ^a   Choi, Vicky ^d   Zhu, Qian ^a,e  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c PENNSYLVANIA STATE UNIVERSITY   (United States)

^d VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^e Princeton University   (United States)

Author keywords

Chromosome rearrangement; Comparative genomics; Gene clusters; Phylogenomics

Indexed keywords

HARDWARE; SOFTWARE ENGINEERING;

ANCESTRAL GENOMES; CHROMOSOME REARRANGEMENT; COMPARATIVE GENOMICS; GENE CLUSTERS; GENE ORDERS; MATHEMATICAL ALGORITHMS; PHYLOGENOMICS;

GENES;

EID: 75749134075     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-010-9301-9     Document Type: Article

References (73)

1. JC Venter MD Adams EW Myers PW Li RJ Mural GG SUtton, et al. 2001 The sequence of the human genome Science 291 5507 1304 1351 10.1126/science.1058040 (Pubitemid 32173090)
2. Mouse Genome Sequencing Consortium 2002 Initial sequencing and comparative analysis of the mouse genome Nature 420 6915 520 562 10.1038/nature01262 (Pubitemid 35477048)
3. D Sankoff G Leduc N Antoine B Paquin BF Lang R Cedergren 1992 Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome Proc. the National Academy of Sciences USA 89 14 6575 6579 10.1073/pnas.89.14. 6575
4. Sankoff D. Edit distance for genome comparison based on nonlocal operations. In Proc. the Third Annual Symposium on Combinatorial Pattern Matching (CPM1992), Tucson, USA, April 29-May 1, 1992, pp.121-135.
5. Cosner M E, Jansen R K, Moret B M E, Raubeson L A, Wang L-S, Warnow T, Wyman S. An Empirical Comparison of Phylogenetic Methods on Chloroplast Gene Order Data in Campanulaceae. Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, Sankoff D, Nadeau J (eds.), Dordrecht: Kluwer Academic Publishers, 2000, pp.99-121.
6. Ajana Y, Lefebvre J-F, Tillier E R M, El-Mabrouk N. Exploring the set of all minimal sequences of reversals - An application to test the replication-directed reversal hypothesis. In Proc. the Second International Workshop on Algorithms in Bioinformatics (WABI 2002), Rome, Italy, Sept. 17-21, 2002, pp.300-315.
7. S Hannenhalli PA Pevzner 1999 Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals Journal of the ACM 46 1 1 27 1064.92510 10.1145/300515.300516 1692509
8. A Caprara 1999 Sorting permutations by reversals and Eulerian cycle decompositions SIAM Journal on Discrete Mathematics 12 1 91 110 0916.68074 10.1137/S089548019731994X 1666069
9. GA Watterson WJ Ewens TE Hall A Morgan 1982 The chromosome inversion problem Journal of Theoretical Biology 99 1 1 7 10.1016/0022-5193(82)90384-8 (Pubitemid 13209093)
10. D Sankoff 1989 Mechanisms of genome evolution: Models and inference Bulletin of the International Statistical Institute 47 3 461 475 1093701
11. AH Sturtevant E Novitski 1941 The homologies of the chromosome elements in the genus Drosophila Genetics 26 5 517 541
12. Hannenhalli S, Pevzner P A. Transforming men into mice (polynomial algorithm for genomic distance problem). In Proc. the Thirty-Sixth Annual Symposium on Foundations of Computer Science (FOCS 1995), Milwaukee, USA, Oct. 23-25, 1995, pp.581-592.
13. G Tesler 2002 Efficient algorithms for multichromosomal genome rearrangements Journal of Computer and System Sciences 65 3 587 609 1059.68160 10.1016/S0022-0000(02)00011-9 1955950
14. D Sankoff M Blanchette 1998 Multiple genome rearrangement and breakpoint phylogeny Journal of Computational Biology 5 3 555 570 10.1089/cmb.1998.5.555
15. El-Mabrouk N, Bryant D, Sankoff D. Reconstructing the pre-doubling genome. In Proc. the Third Annual International Conference on Computational Molecular Biology (RECOMB), Lyon, France, April 11-14, 1999, pp.154-163.
16. N El-Mabrouk D Sankoff 2003 The reconstruction of doubled genomes SIAM Journal on Computing 32 2 754 792 1046.68056 10.1137/S0097539700377177 2001754
17. P Pevzner G Tesler 2003 Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution Proceedings of the National Academy of Sciences USA 100 13 7672 7677 10.1073/pnas.1330369100 (Pubitemid 36760028)
18. WJ Kent R Baertsch A Hinrichs W Miller D Haussler 2003 Evolution's cauldron: Duplication, deletion, and rearrangement in the mouse and human genomes Proceedings of the National Academy of Sciences USA 100 20 11484 11489 10.1073/pnas.1932072100 (Pubitemid 37205962)
19. WJ Kent CW Sugnet TS Furey KM Roskin TH Pringle AM Zahler AD Haussler 2002 The Human genome browser at UCSC Genome Research 12 6 996 1006
20. M Mazowita L Haque D Sankoff 2006 Stability of rearrangement measures in the comparison of genome sequences Journal of Computational Biology 13 2 554 566 10.1089/cmb.2006.13.554 2255275
21. AU Sinha J Meller 2008 Sensitivity analysis for reversal distance and breakpoint reuse in genome rearrangements Pacific Symposium on Biocomputing 13 37 38
22. T Jiang 2010 Some algorithmic challenges in genome-wide ortholog assignment J. Comput. Sci. & Technol. 25 1 42 52 10.1007/s11390-010-9304-6
23. E Tannier C Zheng D Sankoff 2009 Multichromosomal median and halving problems under different genomic distances BMC Bioinformatics 10 120 10.1186/1471-2105-10-120
24. Fertin G, Labarre A, Rusu I, Tannier E, Vialette S. Combinatorics of Genome Rearrangements. Cambridge, Massachusetts: The MIT Press, 2009.
25. S Yancopoulos O Attie R Friedberg 2005 Efficient sorting of genomic permutations by translocation, inversion and block interchange Bioinformatics 21 16 3340 3346 10.1093/bioinformatics/bti535 (Pubitemid 41222437)
26. Bergeron A, Mixtacki J, Stoye J. A unifying view of genome rearrangements. In Proc. the Sixth International Workshop on Algorithms in Bioinformatics (WABI 2000), Zurich, Switzerland, Sept. 11-13, 2006, pp.163-173.
27. D Dalevi N Eriksen 2008 Expected gene-order distances and model selection in bacteria Bioinformatics 24 11 1332 1338 10.1093/bioinformatics/btn111 (Pubitemid 351737137)
28. N Eriksen A Hultman 2004 Estimating the expected reversal distance after a fixed number of reversals Advances in Applied Mathematics 32 3 439 453 1051.92029 10.1016/S0196-8858(03)00054-X 2041958 (Pubitemid 38457666)
29. L-S Wang T Warnow 2006 Distance-Based Genome Rearrangement Phylogeny J. Mol. Wvol. 63 4 473 483 10.1007/s00239-005-0216-y (Pubitemid 44611734)
30. Muñoz A, Sankoff D. Rearrangement phylogeny of genomes in contig form. In Proc. the Fifth International Symposium on Bioinformatics Research and Applications (ISBRA2009), Fort Lauderdale, USA, May 13-16, 2009, pp.160-172.
31. Z Adam M Turmel C Lemieux D Sankoff 2007 Common intervals and symmetric difference in a model-free phylogenomics, with an application to streptophyte evolution Journal of Computational Biology 14 4 436 445 10.1089/cmb.2007.A005 2318610
32. Q Zhu Z Adam V Choi D Sankoff 2009 Generalized gene adjacencies, graph bandwidth, and clusters in yeast evolution Transactions on Computational Biology and Bioinformatics 6 2 213 220 10.1109/TCBB.2008.121
33. Tannier E. Yeast ancestral genome reconstructions: The possibilities of computational methods. In Proc. the 7th Ann. RECOMB Satellite Workshop on Comparative Genomics (RECOMB CG2009), Budapest, Hungary, Sept. 27-29, 2009, pp.1-12.
34. Sankoff D, Blanchette M. The median problem for breakpoints in comparative genomics. In Proc. the Third Annual International Conference on Computing and Combinatorics (COCOON1997), Shanghai, China, Aug. 20-22, 1997, pp.251-263.
35. Bader D, Moret B M. GRAPPA runs in record time. HPCwire. November 23, 2000, 9(47).
36. Siepel A C. Exact algorithms for the reversal median problem [Master's Thesis]. University of New Mexico, 2001.
37. Caprara A. On the practical solution of the reversal median problem. In Proc. the First International Workshop on Algorithms in Bioinformatics (WABI 2001), Aarhus, Denmark, Aug. 28-31, 2001, pp.238-251.
38. G Bourque PA Pevzner 2002 Genome-scale evolution: Reconstructing gene orders in the ancestral species Genome Research 12 1 26 36
39. Xu A W. A fast and exact algorithm for the median of three problem - A graph decomposition approach. In Proc. Sixth Annual RECOMB Satellite Workshop Comparative Genomics (RECOMB CG2008), Paris, France, Oct. 13-15, 2008, pp.184-197.
40. Xu A W, Sankoff D. Decompositions of multiple breakpoint graphs and rapid exact solutions to the median problem. In Proc. the Eighth International Workshop on Algorithms in Bioinformatics (WABI 2008), Karlsruhe, Germany, Sept. 15-17, 2008, pp.25-37.
41. Adam Z, Sankoff D. A statistically fair comparison of ancestral genome reconstructions, based on breakpoint and rearrangement distances. In Proc. the Seventh Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB CG2009), Budapest, Hungary, Sept. 16-18, 2009, pp.193-204.
42. Z Adam D Sankoff 2008 The ABCs of MGR with DCJ Evolutionary Bioinformatics Online 4 69 74
43. R Warren D Sankoff 2009 Genome halving with double cut and join Journal of Bioinformatics and Computational Biology 7 2 357 371 10.1142/ S0219720009004102
44. Mixtacki J. Genome halving under DCJ revisited. In Proc. the Fourteenth Annual Conference on Computing and Combinatorics (COCOON), Dalian, China, June 27-29, 2008, pp.276-286.
45. G Blin C Chauve G Fertin R Rizzi S Vialette 2007 Comparing genomes with duplications: A computational complexity point of view Transactions on Computational Biology and Bioinformatics 4 4 523 534 10.1109/TCBB.2007.1069 (Pubitemid 350125876)
46. C Zheng Q Zhu D Sankoff 2006 Genome halving with an outgroup Evolutionary Bioinformatics 2 13 319 326
47. D Sankoff C Zheng Q Zhu 2007 Polyploids, genome halving and phylogeny Bioinformatics 23 13 i433 i439 10.1093/bioinformatics/btm169 (Pubitemid 47244430)
48. C Zheng Q Zhu Z Adam D Sankoff 2008 Guided genome halving: Hardness, heuristics and the history of the Hemiascomycetes Bioinformatics 24 13 i96 i104 10.1093/bioinformatics/btn146 (Pubitemid 351911662)
49. D Sankoff C Zheng PK Wall C dePamphilis J Leebens-Mack VA Albert 2009 Towards improved reconstruction of ancestral gene order in angiosperm phylogeny Journal of Computational Biology 16 10 1353 1367 10.1089/cmb.2009.0103
50. R Warren D Sankoff 2009 Genome aliquoting with double cut and join BMC Bioinformatics 10 S2 10.1186/1471-2105-10-S1-S2
51. C Zheng A Lenert D Sankoff 2005 Reversal distance for partially ordered genomes Bioinformatics 21 Suppl. 1 i502 i508 10.1093/bioinformatics/bti1037 (Pubitemid 41794525)
52. C Zheng D Sankoff 2006 Genome rearrangements with partially ordered chromosomes Journal of Combinatorial Optimization 11 2 133 144 1095.92045 10.1007/s10878-006-7120-2 2212912
53. G Blin E Blais D Hermelin P Guillon M Blanchette N El-Mabrouk 2007 Gene maps linearization using genomic rearrangement distances Journal of Computational Biology 14 4 394 407 10.1089/cmb.2007.A002 2318607 (Pubitemid 46911214)
54. X Chen Y Cui 2009 An approximation algorithm for the minimum breakpoint linearization problem Transactions on Computational Biology and Bioinformatics 6 3 401 409 10.1109/TCBB.2009.3 2530833
55. Gaul E, Blanchette M. Ordering partially assembled genomes using gene arrangements. In Proc. the Fourth Annual Workshop on Comparative Genomics (RECOMB CG2006), Montreal, Canada, Sept. 24-26, 2006, pp.113-128.
56. A Bhutkar S Russo TF Smith WM Gelbart 2006 Techniques for multi-genome synteny analysis to overcome assembly limitations Genome Informatics 17 2 152 161
57. C Zheng Q Zhu D Sankoff 2007 Removing noise and ambiguities from comparative maps in rearrangement analysis Transactions on Computational Biology and Bioinformatics 4 4 515 522 10.1109/TCBB.2007.1075 (Pubitemid 350125875)
58. Choi V, Zheng C, Zhu Q, Sankoff D. Algorithms for the extraction of synteny blocks from comparative maps. In Proc. the Seventh International Workshop on Algorithms in Bioinformatics (WABI 2007), Philadelphia, USA, Sept. 8-9, 2007, pp.277-288.
59. PRJ Ostergard 2001 A new algorithm for the maximum-weight clique problem Nordic Journal of Computing 8 4 424 436 1892778
60. Kumlander D. A new exact algorithm for the maximumweight clique problem based on a heuristic vertex-coloring and a backtrack search. In The Fourth European Congress of Mathematics, Stockholm, Sweden, June 27-July 2, 2004, MS. and Poster.
61. Bulteau L, Fertin G, Rusu I. Maximal strip recovery problem with gaps: Hardness and approximation algorithms. In Proc. the 20th Int. Symp. Algorithms and Computation (ISAAC 2009), Hawaii, USA, Dec. 16-18, 2009, pp.710-719.
62. Chen Z, Fu B, Jiang M, Zhu B. On recovering syntenic blocks from comparative maps. In Proc. the Second Annual Int. Conf. Combinatorial Optimization and Applications (COCOA2008). St. John's, Canada, Aug. 21-24, 2008, pp.319-327.
63. Jiang M. Inapproximability of maximal strip recovery. In Proc. the 20th Int. Symp. Algorithms and Computation (ISAAC 2009), Hawaii, USA, Dec. 16-18, 2009, pp.616-625.
64. Wang L, Zhu B. On the tractability of maximal strip recovery. In Proc. the Sixth Annual Conf. Theory and Applications of Models of Computation (TAMC2009), Changsha, China, May 18-22, 2009, pp.400-409.
65. Hoberman R, Durand D. The incompatible desiderata of gene cluster properties. In Proc. the Fifth Annual Workshop on Comparative Genomics (RECOMB CG2005), Dublin, Ireland, Sept. 18-20, 2005, pp.73-87.
66. Sankoff D, Haque L. Power boosts for cluster tests. In Proc. the Fifth Annual Workshop on Comparative Genomics (RECOMB CG), Dublin, Ireland, Sept. 18-20, 2005. pp.121-130.
67. Xu X, Sankoff D. Tests for gene clusters satisfying the generalized adjacency criterion. In Proc. the Third Brazilian Symposium on Bioinformatics, Advances in Bioinformatics and Computational Biology (BSB 2008), Santo Andre, Brazil, Aug. 28-30, 2008, pp.152-160.
68. Yang Z, Sankoff D. Natural parameter values for generalized gene adjacency. In Proc. the Seventh Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB CG), San Diego, USA, Sept. 16-18, 2009, pp.13-23.
69. R Hoberman D Sankoff D Durand 2005 The statistical analysis of spatially clustered genes under the maximum gap criterion Journal of Computational Biology 12 8 1083 1102 10.1089/cmb.2005.12.1083 (Pubitemid 41580024)
70. P Erdös A Rényi 1959 On random graphs Publicationes Mathematicae 6 290 297 0092.15705
71. P Erdös A Rényi 1960 On the evolution of random graphs Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5 17 61 0103.16301
72. P Erdös A Rényi 1961 On the strength of connectedness of a random graph Acta Mathematica Scientia Hungary 12 261 267 0103.16302 10.1007/BF02066689
73. R D'Souza D Achlioptas J Spencer 2009 Explosive percolation in random networks Science 323 5920 1453 1455 10.1126/science.1167782 2502843