Genomic distance with DCJ and indels

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

Volumn 6293 LNBI, Issue , 2010, Pages 90-101

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

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GENOMIC DISTANCE; LINEAR-TIME ALGORITHMS; DOUBLE CUT AND JOINS;

ALGORITHMS; BACTERIA; BIOINFORMATICS; CLUSTERING ALGORITHMS;

GENES;

EID: 78049474931     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15294-8_8     Document Type: Conference Paper

References (5)

1. 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)
2. Blanc, G., et al.: Reductive genome evolution from the mother of Rickettsia. PLoS Genetics 3(1), e14 (2007)
3. Braga, M.D.V., Stoye, J.: The solution space of sorting by DCJ. To appear in Journal of Computational Biology (2010)
4. Yancopoulos, S., Friedberg, R.: Sorting Genomes with Insertions, Deletions and Duplications by DCJ. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS (LNBI), vol. 5267, pp. 170-183. Springer, Heidelberg (2008)
5. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346 (2005) (Pubitemid 41222437)