On sorting by translocations

Journal of Computational Biology

Volumn 13, Issue 2, 2006, Pages 567-578

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

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

^b BIELEFELD UNIVERSITY   (Germany)

Author keywords

Comparative genomics; Genome rearrangement; Sorting by translocations; Translocation distance

Indexed keywords

ALGORITHM; CHROMATID EXCHANGE; COMPARATIVE GENOMICS; CONFERENCE PAPER; ERROR; GENE REARRANGEMENT; GENE TRANSLOCATION; GENETIC DISTANCE; GENOME ANALYSIS; GENOMICS; HANNENHALLI ALGORITHM; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; SORTING; TIME; TRANSLOCATION DISTANCE;

ALGORITHMS; ANIMALS; CHROMOSOME ABERRATIONS; CHROMOSOME MAPPING; DNA MUTATIONAL ANALYSIS; GENE REARRANGEMENT; HUMANS; INVERSION, CHROMOSOME; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; TRANSLOCATION, GENETIC;

EID: 33645990625     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.13.567     Document Type: Conference Paper

References (10)

1. Bergeron, A., Mixtacki, J., and Stoye, J. 2004. Reversal distance without hurdles and fortresses. Proc. 15th Ann. Symp. on Combinatorial Pattern Matching, CPM 2004, LNCS 3109, 388-399.
2. Bergeron, A., Mixtacki, J., and Stoye, J. 2005. The inversion distance problem, in Gascuel, O., ed., Mathematics of Evolution and Phylogeny, chap. 10, 262-290, Oxford University Press, Oxford, UK.
3. Bergeron, A., and Stoye, J. 2003. On the similarity of sets of permutations and its applications to genome comparison. Proc. 9th Ann. Int. Conf. on Computing and Combinatorics, COCOON 2003, LNCS 2697, 68-79.
4. Hannenhalli, S. 1996. Polynomial-time algorithm for computing translocation distance between genomes. Disc. Appl. Math. 71(1-3), 137-151.
5. Hannenhalli, S., and Pevzner, P.A. 1995. Transforming men into mice (polynomial algorithm for genomic distance problem). Proc. 36th Ann. Symp. on Foundation of Computer Science, FOCS 1995, 581-592.
6. Kececioglu, J.D., and Ravi, R. 1995. Of mice and men: Algorithms for evolutionary distances between genomes with translocation. Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA 1995, 604-613.
7. Li, G., Qi, X., Wang, X., and Zhu, B. 2004. A linear-time algorithm for computing translocation distance between signed genomes. Proc. 15th Ann. Symp. on Combinatorial Pattern Matching, CPM 2004, LNCS 3109, 323-332.
8. Mouse Genome Sequencing Consortium. 2002. Initial sequencing and comparative analysis of the mouse genome. Nature 420, 520-562.
9. Ozery-Flato, M., and Shamir, R. 2003. Two notes on genome rearrangements. J. Bioinf. Comp. Biol. 1(1), 71-94.
10. Tesler, G. 2002. Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci. 65(3), 587-609.