HP distance via double cut and join distance

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

Volumn 5029 LNCS, Issue , 2008, Pages 56-68

  Bergeron, Anne ^a   Mixtacki, Julia ^b   Stoye, Jens ^b  

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

^b BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING; PHASE MODULATION; TREES (MATHEMATICS);

DISTANCE FORMULA; GENOMIC DISTANCE; HANNENHALLI PEVZNER THEORY; HEIDELBERG (CO); NUMBER OF INVERSIONS; SPRINGER (CO); TREE STRUCTURES;

MATHEMATICAL TRANSFORMATIONS;

EID: 45849126475     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69068-9_8     Document Type: Conference Paper

References (11)

1. Bergeron, A.: A very elementary presentation of the hannenhalli-pevzner theory. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 106-117. Springer, Heidelberg (2001)
2. Bergeron, A., Mixtacki, J., Stoye, J.: Reversal distance without hurdles and fortresses. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 388-399. Springer, Heidelberg (2004)
3. Bergeron, A., Mixtacki, J., Stoye, J.: On sorting by translocations. J. Comput. Biol. 13(2), 567-578 (2006)
4. 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)
5. Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. In: Warnow, T., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 68-79. Springer, Heidelberg (2003)
6. Hannenhalli, S., Pevzner, P.A.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proceedings of FOCS 1995, pp. 581-592. IEEE Press, Los Alamitos (1995)
7. Jean, G., Nikolski, M.: Genome rearrangements: a correct algorithm for optimal capping. Inf. Process. Lett. 104, 14-20 (2007)
8. Ozery-Flato, M., Shamir, R.: Two notes on genome rearrangements. J. Bioinf. Comput. Biol. 1(1), 71-94 (2003)
9. Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci. 65(3), 587-609 (2002)
10. Tesler, G.: GRIMM: Genome rearrangements web server. Bioinformatics 18(3), 492-493 (2002)
11. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340-3346 (2005)