Combinatorial structure of genome rearrangements scenarios

Journal of Computational Biology

Volumn 17, Issue 9, 2010, Pages 1129-1144

  Ouangraoua, Aïda ^a,b,c   Bergeron, Anne ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

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

^c INRIA   (France)

Author keywords

computational molecular biology; dynamic programming; genomic rearrangements

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; CHROMOSOME MAP; GENE REARRANGEMENT; GENOME;

ALGORITHMS; CHROMOSOME MAPPING; GENE REARRANGEMENT; GENOME; MODELS, GENETIC;

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

References (26)

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. Proc. WABI '02 300-315. Springer-Verlag.
2. Barcucci, E., Del Lungo, A., and Pergola, E. 1999. Random generation of trees and other combinatorial objects. Theoret. Comput. Sci. 218:219-232.
3. Bérard, S., Bergeron, A., Chauve, C., et al. 2007. Perfect sorting by reversals is not always difficult. IEEE/ACM Trans. Comput. Biol. Bioinform. 4:4-16.
4. Bergeron, A., Chauve, C., Hartman, T., et al. 2002. On the properties of sequences of reversals that sort a signed permutation. Proc. Troisiemes J. Ouvertes Biol. Inform. Math. 99-108.
5. Bergeron, A., Mixtacki, J., and Stoye, J. 2006. A unifying view of genome rearrangements. Lect. Notes Bioinform. 4175, 163-173.
6. Braga, M. D. V., Sagot, M.-F., Scornavacca, C., et al. 2008. Exploring the solution space of sorting by reversals, with experiments and an application to evolution. IEEE/ACM Trans. Comput. Biol. Bioinform. 5:348-356.
7. Cayley, A. 1897. The Collected Mathematical Papers of Arthur Cayley, Volume XIII. Cambridge University Press, Cambridge, UK.
8. Diekmann, Y., Sagot, M.-F., and Tannier, E. 2007. Evolution under reversals: parsimony and conservation of common intervals. IEEE/ACM Trans. Comput. Biol. Bioinform. 4:301-309.
9. Kalikow, L. H. 1999. Enumeration of parking functions, allowable permutation pairs, and labeled trees [Ph. D. dissertation]. Brandeis University.
10. Konheim, A. G., and Weiss, B. 1966. An occupancy discipline and applications. SIAM J. Appl. Math. 14:1266-1274.
11. Kreweras, G. 1972. Sur les partitions non croisées d'un cycle. Discrete Math. 1:333-350.
12. McLysaght, A., Seoighe, C., and Wolfe, K. H. 2000. High frequency of inversions during eukaryote gene order evolution, 47-58. In: Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families. Kluwer Academic Press, New York.
13. Miklós, I., and Darling, A. 2009. Efficient sampling of parsimonious inversion histories with application to genome rearrangement in Yersinia. Genome Biol. Evol. 1:153-164.
14. Miklós, I., and Hein, J. 2004. Genome rearrangement in mitochondria and its computational biology. Lect. Notes Bioinform. 3388, 85-96.
15. Ozery-Flato, M., and Shamir, R. 2007. Sorting by translocations via reversals theory. J. Comput. Biol. 14:408-422.
16. Pevzner, P., and Tesler, G. 2003. Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc. Natl. Acad. Sci. USA 100:7672-7677.
17. Prüfer, H. 1918. Neuer beweis eines satzes ber permutationen. Arch. Math. Phys. 27:742-744.
18. Sankoff, D., Lefebvre, J.-F., Tillier, E. R. M., et al. 2004. The distribution of inversion lengths in bacteria. Lect. Notes Comput. Sci. 3388, 97-108.
19. Sankoff, D., and Trinh, P. 2005. Chromosomal breakpoint reuse in genome sequence rearrangement. J. Comput. Biol. 12:812-821.
20. Siepel, A. C. 2002. An algorithm to enumerate all sorting reversals. Proc. RECOMB '02 281-290.
21. Stanley, R. P. 1986. Enumerative Combinatorics Volume I. Wadsworth and Brookes/Cole, Monterey, CA.
22. Stanley, R. P. 1997. Parking functions and noncrossing partitions. Electron. J. Combin. 4: R20.
23. Stanley, R. P. 1999. Enumerative Combinatorics Volume II. Cambridge University Press, Cambridge, UK.
24. Swenson, K. M., Dong, Y., Tang, J. et al. 2009. Maximum independent sets of commuting and noninterfering inversions. Proc. 7th Asia Pac. Bioinform. Conf.
25. Xu, A. W., Zheng, C., and Sankoff, D. 2007. Paths and cycles in breakpoint graphs of random multichromosomal genomes. J. Comput. Biol. 14:423-435.
26. Yancopoulos, S., Attie, O., and Friedberg, R. 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21:3340-3346.