The solution space of sorting by DCJ

Journal of Computational Biology

Volumn 17, Issue 9, 2010, Pages 1145-1165

  Braga, Marília D V ^a   Stoye, Jens ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

algorithms; combinatorics; evolution; genomic rearrangements

Indexed keywords

ALGORITHM; ANIMAL; ARTICLE; BIOLOGICAL MODEL; GENE REARRANGEMENT; GENOME; HUMAN; MOLECULAR EVOLUTION; NUCLEOTIDE SEQUENCE;

ALGORITHMS; ANIMALS; BASE SEQUENCE; EVOLUTION, MOLECULAR; GENE REARRANGEMENT; GENOME; HUMANS; MODELS, GENETIC;

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

References (13)

1. Alekseyev, M. A., and Pevzner, P. A. 2009. Breakpoint graphs and ancestral genome reconstructions. Genome Res. 19, 943-957.
2. Bergeron, A., Chauve, C., Hartmann, T., et al. 2002. On the properties of sequences of reversals that sort a signed permutation. Proc. JOBIM 2002 99-108.
3. Bergeron, A., Mixtacki, J., and Stoye, J. 2006. A unifying view of genome rearrangements. Lect. Notes Comput. Sci. 4175, 163-173.
4. 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.
5. Braga, M. D. V., and Stoye, J. 2009. Counting all DCJ sorting scenarios. Lect. Notes Bioinform. 5817, 36-47.
6. Fertin, G., Labarre, A., Rusu, I., et al. 2009. Combinatorics of Genome Rearrangements. The MIT Press, Cambridge, MA.
7. Hannenhalli, S., and Pevzner, P. 1995. Transforming men into mice (polynomial algorithm for genomic distance problem). Proc. FOCS 1995 581-592.
8. Ouangraoua, A., and Bergeron, A. 2010. Parking functions, labeled trees and DCJ sorting scenarios. Lect. Notes Bioinform. 5817, 24-35.
9. Sankoff, D. 1992. Edit distance for genome comparison based on non-local operations. Lect. Notes Comput. Sci. 644, 121-135.
10. Siepel, A. 2003. An algorithm to enumerate sorting reversals for signed permutations. J. Comput. Biol. 10, 575-597.
11. Tannier, E., Zheng, C., and Sankoff, D. 2009. Multichromosomal median and halving problems under different genomic distances. BMC Bioinform. 10, 120.
12. Yancopoulos, S., Attie, O., and Friedberg, R. 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346.
13. Zeilberger, D. 2010. Yet another proof of Cayley's formula for the number of labelled trees. Available at: www.math.rutgers.edu/~zeilberg/mamarim/ mamarimPDF/cayley.pdf. Accessed July 1, 2010.