Combinatorics of chromosomal rearrangements based on synteny blocks and synteny packs

Journal of Logic and Computation

Volumn 23, Issue 4, 2013, Pages 815-838

  Drillon, Guénola ^a   Carbone, Alessandra ^a   Fischer, Gilles ^a  

^a UMR 7238   (France)

Author keywords

ancestral genome; combinatorics of genome rearrangements; pairwise comparison; Synteny block

Indexed keywords

GENES; REPAIR;

ANCESTRAL GENOMES; CHROMOSOMAL REARRANGEMENT; COMBINATORIC OF GENOME REARRANGEMENT; COMBINATORICS; GENOME REARRANGEMENTS; NOVEL SOLUTIONS; PAIR-WISE COMPARISON; SYNTENY; SYNTENY BLOCKS; YEAST GENOME;

COMBINATORIAL MATHEMATICS;

EID: 84880569474     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exr047     Document Type: Conference Paper

References (26)

1. B. Alberts, A. Johnson, J. Lewis, M. Raff, K. Roberts, and P.Walter. Molecular Biology of the Cell, 4th edn., Garland Science, 2002.
2. M. A. Alekseyev and P. A. Pevzner. Breakpoint graphs and ancestral genome reconstructions. Genome Research, 19, 943-957, 2009.
3. S. Altschul, T. Madden, A. Schaffer, J. Zhang, Z. Zhang, W. Miller, and D. Lipman. Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucleic Acids Research, 25, 3389-3402, 1997.
4. V. Bafna and P. A. Pevzner. Genome rearrangements and sorting by reversals. SIAM Journal on Computing, 25, 272-289, 1996.
5. A. Bergeron, J. Mixtacki, and J. Stoye. On computing the breakpoint reuse rate in rearrangement scenarios. In Comparative Genomics, Vol. 5267 of Lecture Notes in Computer Science, C. Nelson and S. Vialette, eds, pp. 226-240. Springer, 2008.
6. A. Bhutkar, S.W. Schaeffer, S.M. Russo, M. Xu, T. F. Smith, andW. M. Gelbart. Chromosomal rearrangement inferred from comparisons of 12 drosophila genomes. Genetics, 179, 1657-1680, 2008.
7. G. Bourque and P. A. Pevzner. Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Research, 12, 26-36, 2002.
8. C. Chauve and E. Tannier. A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genomes. PLoS Computational Biology, 4, e1000234, 2008.
9. G. Fertin, A. Labarre, I. Rusu, E. Tannier, and S. Vialette. Combinatorics of Genome Rearrangements. MIT Press, 2009.
10. J. L. Gordon, K. P. Byrne, and K. H. Wolfe. Additions, losses, and rearrangements on the evolutionary route from a reconstructed ancestor to the modern Saccharomyces cerevisiae genome. PLoS Genetics, 5, e1000485, 2009.
11. S. Hannenhalli and P. A. Pevzner. Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of Association for Computing Machinery, 46, 1-27, 1999.
12. G. Jean, D. J. Sherman, and M. Nikolski. Mining the semantics of genome super-blocks to infer ancestral architectures. Journal of Computational Biology, 16, 1267-1284, 2009.
13. H. Kaplan, R. Shamir, and R. E. Tarjan. A faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal of Computing, 29, 880-892, 2000.
14. C. Lemaitre, E. Tannier, C. Gautier, and M-F. Sagot. Precise detection of rearrangement breakpoints in mammalian chromosomes. BMC Bioinformatics, 9, 286, 2008.
15. W-H. Li. Molecular Evolution. Sinauer Associates, 1997.
16. M. Lynch. The Origins of Genome Architecture, Vol. 98. Sinauer Associates, 2007.
17. J. Ma, L. Zhang, B. B. Suh, B. J. Raney, R. C. Burhans,W. J. Kent, M. Blanchette, D. Haussler, and W. Miller. Reconstructing contiguous regions of an ancestral genome. Genome Research, 16, 1557-1565, 2006.
18. 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 WABI '02: Proceedings of the Second InternationalWorkshop on Algorithms in Bioinformatics, pp. 521-536. Springer, 2002.
19. J. H. Nadeau and B. A. Taylor. Lengths of chromosomal segments conserved since divergence of man and mouse. Proceedings of the National Academy of Sciences of the United States of America, 81, 814-818, 1984.
20. J. D. Palmer and L. A. Herbon. Plant mitochondrial DNA evolved rapidly in structure, but slowly in sequence. Journal of Molecular Evolution, 28, 87-97, 1988.
21. Q. Peng, P. A. Pevzner, and G. Tesler. The fragile breakage versus random breakage models of chromosome evolution. PLoS Computational Biology, 2, e14, 2006.
22. P. A. Pevzner. Computational Molecular Biology : An Algorithmic Approach. MIT Press, 2000.
23. G. Tesler. GRIMM: Genome rearrangements web server . Bioinformatics, 18, 492-493, 2002.
24. S. Yancopoulos, O. Attie, and R. Friedberg. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics, 21, 3340-3346, 2005.
25. F. Zhang, C. M. Carvalho, and J. R. Lupski. Complex human chromosomal and genomic rearrangements. Trends in Genetics, 25, 298-307, 2009.
26. H. Zhao and G. Bourque. Recovering genome rearrangements in the mammalian phylogeny. Genome Research, 19, 934-942, 2009.