Genome rearrangements: a correct algorithm for optimal capping

Information Processing Letters

Volumn 104, Issue 1, 2007, Pages 14-20

  Jean, Géraldine ^a   Nikolski, Macha ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Algorithms; Breakpoint graph; Genome rearrangements; Genomic distance; Optimal capping

Indexed keywords

BREAKPOINT GRAPH; GENOME REARRANGEMENTS; GENOMIC DISTANCE; OPTIMAL CAPPING;

ALGORITHMS; DATA PROCESSING; GRAPH THEORY;

GENES;

EID: 34447289460     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.04.011     Document Type: Article

References (6)

1. S. Hannenhalli, P.A. Pevzner, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals), in: Proceedings of Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995, pp. 178-189
2. S. Hannenhalli, P.A. Pevzner, Transforming men into mice (polynomial algorithm for genomic distance problem), in: FOCS'95: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995, pp. 581-592
3. Nadeau J.H., and Taylor B.A. Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. USA, Part 1: Biol. Sci. 81 3 (1984) 814-818
4. Ozery-Flato M., and Shamir R. Two notes on genome rearrangement. J. Bioinformatics Comput. Biol. 1 1 (2003) 71-94
5. Tesler G. Efficient algorithms for multichromosomal genome rearrangements. J. Comput. System. Sci. 65 3 (2002) 587-609
6. Setubal J.S., and Meidanis J. Introduction to Computational Molecular Biology (1997), PWS Publishing