Counting all DCJ sorting scenarios

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5817 LNBI, Issue , 2009, Pages 36-47

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

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GENERAL MODEL; GENOME REARRANGEMENTS; GENOME STRUCTURES; LOWER BOUNDS; MULTICHROMOSOMAL GENOMES; SOLUTION SPACE;

ALGORITHMS; OPTIMIZATION;

GENES;

EID: 77958033601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04744-2_4     Document Type: Conference Paper

References (11)

1. Alekseyev, M.A., Pevzner, P.A.: Breakpoint graphs and ancestral genome reconstructions. Genome Res. 19, 943-957 (2009)
2. Bergeron, A., Chauve, C., Hartmann, T., St-Onge, K.: On the properties of sequences of reversals that sort a signed permutation. In: Proceedings of JOBIM 2002, pp. 99-108 (2002)
3. Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163-173. Springer, Heidelberg (2006)
4. Braga, M.D.V., Sagot, M.-F., Scornavacca, C., Tannier, E.: Exploring the solution space of sorting by reversals with experiments and an application to evolution. IEEE/ACM Trans. Comput. Biol. Bioinf. 5(3), 348-356 (2008);
5. Preliminary version in Proceedings of ISBRA 2007. LNCS (LNBI), vol. 4463, pp. 293-304 (2007)
6. Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proceedings of FOCS 1995, pp. 581-592 (1995)
7. Ouangraoua, A., Bergeron, A.: Parking functions, labeled trees and DCJ sorting scenarios. In: Ciccarelli, F.D., Miklós, I. (eds.) RECOMB-CG 2009. LNCS (LNBI), vol. 5817, pp. 24-35. Springer, Heidelberg (2009)
8. Sankoff, D.: Edit Distance for Genome Comparison Based on Non-Local Operations. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol. 644, pp. 121-135. Springer, Heidelberg (1992)
9. Siepel, A.: An algorithm to enumerate sorting reversals for signed permutations. J. Comput. Biol. 10, 575-597 (2003)
10. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346 (2005)
11. Zeilberger, D.: Yet another proof of Cayley's formula for the number of labeled trees, http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimPDF/cayley. pdf