Computation of perfect DCJ rearrangement scenarios with linear and circular chromosomes

Journal of Computational Biology

Volumn 16, Issue 10, 2009, Pages 1287-1309

  Bérard, Sèverine ^a,b   Chateau, Annie ^b   Chauve, Cedric ^c   Paul, Christophe ^b   Tannier, Eric ^d  

^a UNIV MONTPELLIER   (France)

^b CNRS   (France)

^c SIMON FRASER UNIVERSITY   (Canada)

^d UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; CHROMOSOME REARRANGEMENT; CHROMOSOME TRANSLOCATION; DOUBLE CUT AND JOIN REARRANGEMENT; GENETIC ALGORITHM; GENOME; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; SIMULATION;

ALGORITHMS; CHROMOSOMES; GENE REARRANGEMENT; GENOME; MODELS, GENETIC; NUCLEIC ACID CONFORMATION;

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

References (34)

1. Alekseyev, M., and Pevzner, P. 2008. Multi-break rearrangements and chromosomal evolution. Theor. Comput. Sci. 395, 193-202.
2. Bérard, S., Bergeron, A., and Chauve, C. 2004. Conservation of combinatorial structures in evolution scenarios. LNCS/ LNBI 3388, 1-14.
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. Bérard, S., Chateau, A., Chauve, C., et al. 2008a. Perfect DCJ rearrangements. LNCS 5267, 158-169.
5. Bérard, S., Chauve, C., and Paul, C. 2008b. A more efficient algorithm for perfect sorting by reversals. Inform. Proc. Letters 106, 90-95.
6. Bergeron, A., Mixtacki, J., and Stoye, J. 2005. Mathematics of Evolution and Phylogeny. Oxford University Press, New York.
7. Bergeron, A., Mixtacki, J., and Stoye, J. 2006. A unifying view of genome rearrangements. LNCS/LNBI 4175, 163-173.
8. Bergeron, A., Chauve, C., de Montgolfier, F., et al. 2008. Computing common intervals of k permutations, with applications to modular decomposition of graphs. SIAM J. Discrete Math. 22, 1022-1039.
9. Bernt, M., Merkle, D., and Middendorf, M. 2007. A fast and exact algorithm for the perfect reversal median. LNCS/ LNBI 4463, 305-316.
10. Bouvel, M., and Rossin, D. 2006. The longest common pattern problem for two permutations. Pure Math. Appl. 17, 55-69.
11. Bouvel, M., Chauve, C., Mishna, M., et al. 2009. Average-case analysis of perfect sorting by reversals. LNCS 5577, 314-325.
12. Braga, M., 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.
13. Caprara, A. 2003. The reversal median problem. INFORMS J. Comp. 15, 93-113.
14. Cunningham, W., and Edmonds, J. 1980. A combinatorial decomposition theory. Can. J. Math. 32, 734-765.
15. Darling, A., Mikls, I., and Ragan, M. 2008. Dynamics of genome rearrangement in bacterial populations. PLoS Genet. 4.
16. de Montgolfier, F. 2003. Décomposition modulaire des graphes. Théorie, extensions et algorithmes [Ph.D. dissertation]. Université Montpellier II, France.
17. 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-1109
18. El-Mabrouk, N., and Sankoff, D. 2003. The reconstruction of doubled genomes. SIAM. Comput. 32, 754-792.
19. Fertin, G., Labarre, A., Rusu, I., et al. 2009. Combinatorics of Genome Rearrangements. MIT Press, Cambridge, MA.
20. Figeac, M., Varré, J.-S. 2004. Sorting by reversals with common intervals. LNCS/LNBI 3240, 26-37.
21. Habib, M., Paul, C., and Raffinot, M. 2004. Common connected components of interval graphs. LNCS 3109, 347-358.
22. Hannenhalli, S., and Pevzner, P. 1999. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46, 1-27.
23. Hannenhalli, S., and Pevzner, P.A. 1995. Transforming men into mice: polynomial algorithm for genomic distance problem. FOCS 581-592.
24. Hoberman, R., and Durand, D. 2005. The incompatible desiderata of gene cluster properties. LNCS/LNBI 3678, 73-87.
25. Hsu, W.-L., and McConnell, R.M. 2003. PC trees and circular-ones arrangements. Theor. Comput. Sci. 296, 99-116.
26. Jean, G., and Nikolski, M. 2007. Genome rearrangements: a correct algorithm for optimal capping. Inform. Proc. Lett. 104, 14-20.
27. Lemaitre, C., Braga, M., Sagot, M.-F., et al. 2009. Footprints of inversions at present and past pseudoautosomal boundaries in human sex chromosomes. Genome Biol. Evol. (in press).
28. McConnell, R., and de Montgolfier, F. 2005. Algebraic operations on pq-trees and modular decomposition trees. 31st Int. Workshop Graph-Theoretic Concepts Comput. Sci.
29. Mixtacki, J. 2008. Genome halving under DCJ revisited. LNCS 5092, 276-286.
30. Sagot, M.-F., and Tannier, E. 2005. Perfect sorting by reversals. LNCS 3595, 42-51.
31. Tannier, E., Bergeron, A., and Sagot, M.-F. 2007. Advances on sorting by reversals. Discrete Appl. Math. 155, 881-888.
32. Tannier, E., Zheng, C., and Sankoff, D. 2009. Multichromosomal median and halving problems under different genomic distances. BMC Bioinform. 10, 120.
33. Warren, R., and Sankoff, D. 2008. Genome halving with double cut and join. APBC 231-240.
34. Yancopoulos, S., Attie, O., and Friedberg, R., 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346.