UniMoG-a unifying framework for genomic distance calculation: And sorting based on DCJ

Bioinformatics

Volumn 28, Issue 19, 2012, Pages 2509-2511

  Hilker, Rolf ^a   Sickinger, Corinna ^a   Pedersen, Christian N S ^b   Stoye, Jens ^a  

^a BIELEFELD UNIVERSITY   (Germany)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; COMPUTER INTERFACE; COMPUTER PROGRAM; GENOMICS; INTERNET; METHODOLOGY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; GENOMICS; INTERNET; MODELS, GENETIC; SOFTWARE; USER-COMPUTER INTERFACE;

EID: 84867316116     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/bts440     Document Type: Article

References (16)

1. Bergeron,A. et al. (2005) The inversion distance problem. In Gascuel,O. (ed.) Mathematics of Evolution and Phylogeny. Oxford University Press, Oxford, UK, pp. 262-290.
2. Bergeron,A. et al. (2006a) On sorting by translocations. J. Comput. Biol., 13, 567-578.
3. Bergeron,A. et al. (2006b) A unifying view of genome rearrangements. In Proceedings of WABI 2006. LNBI 4175. Springer Verlag, Heidelberg, pp. 163-173.
4. Erdos,P.L. et al. (2011) Balanced vertices in trees and a simpler algorithm to compute the genomic distance. Appl. Math. Lett., 24, 82-86.
5. Hannenhalli,S. (1996) Polynomial-time algorithm for computing translocation distance between genomes. Discrete Appl. Math., 71, 137-151.
6. Hannenhalli,S. and Pevzner,P.A. (1995) Transforming men into mice (polynomial algorithm for genomic distance problem). In Proceedings of FOCS 1995. IEEE Computer Society Press, Los Alamitos, CA, pp. 581-592.
7. Hannenhalli,S. and Pevzner,P.A. (1999) Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM, 46, 1-27.
8. Jean,G. and Nikolski,M. (2007) Genome rearrangements: a correct algorithm for optimal capping. Inform. Process. Lett., 104, 14-20
9. Kováč,J. et al. (2011) Restricted DCJ model: rearrangement problems with chromosome reincorporation. J. Comput. Biol., 18, 1231-1241.
10. Lin,Y. and Moret,B.M.E. (2008) Estimating true evolutionary distances under the DCJ model. Bioinformatics, 24, 114-122.
11. Pevzner,P.A. and Tesler,G. (2003) Genome rearrangements in mammalian evolution: lessons from human and mouse genomes. Genome Res., 13, 37-45
12. Tannier,E. et al. (2007) Advances on sorting by reversals. Discrete Appl.Math., 155, 881-888.
13. Tesler,G. (2002a) Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Systems Sci., 65, 587-609.
14. Tesler,G. (2002b) GRIMM: genome rearrangements web server. Bioinformatics, 18, 492-493.
15. The Chimpanzee Sequencing and Analysis ConsortiumInitial sequence of the chimpanzee genome and comparison with the human genome. Nature, 437, 69-87.
16. Yancopoulos,S. et al. (2005) Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics, 21, 3340-3346.