GENESIS: Genome evolution scenarios

Bioinformatics

Volumn 24, Issue 5, 2008, Pages 711-712

  Gog, Simon ^a   Bader, Martin ^a   Ohlebusch, Enno ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANOPHELES; ARTICLE; CHROMOSOME REARRANGEMENT; CHROMOSOME TRANSLOCATION; COMPUTER INTERFACE; COMPUTER PROGRAM; DNA TRANSPOSITION; DROSOPHILA MELANOGASTER; GENE FUSION; GENETIC ALGORITHM; GENOME ANALYSIS; INSECT GENETICS; INTERNET; MOLECULAR EVOLUTION; NONHUMAN; PRIORITY JOURNAL;

ALGORITHMS; ANIMALS; ANOPHELES; DNA; DROSOPHILA MELANOGASTER; EVOLUTION; GENOME;

EID: 40049106824     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btn026     Document Type: Article

References (12)

1. Bader,M. and Ohlebusch,E. (2007) Sorting by weighted reversals, transpositions, and inverted transpositions. J. Comput. Biol., 14, 615-636.
2. Bafna,V. and Pevzner,P.A. (1996) Genome rearrangements and sorting by reversals. SIAM J. Comput., 25, 272-289.
3. Blanchette,M. et al. (1996) Parametric genome rearrangement. Gene, 172, GC 11-17.
4. Elias,I. and Hartman,J. (2006) A 1.375-approximation algorithm for sorting by transpositions. IEEE/ACM Trans. Comput. Biol. Bioinformatics, 3, 369-379.
5. Garesse,R. (1988) Drosophila melanogaster mitochondrial DNA: Gene organization and evolutionary considerations. Genetics, 118, 649-663.
6. Hannenhalli,S. and Pevzner,P.A. (1995) Transforming men into mice (polynomial algorithm for genetic distance problem). In Proc. 36th Annual IEEE Symposium on Foundations of Computer Science. 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. Hartman,T. and Sharan,R. (2005) A 1.5-approximation algorithm for sorting by transpositions and transreversals. J. Comput. Syst. Sci. 70, 300-320.
9. Michell,S. et al. (1993) The mitochondrial genome of Anopheles quadrimaculalus species: Complete nucleotide sequence and gene organization. Genome, 36, 1058-1073.
10. Ozery-Flato,M. and Shamir,R. (2003) Two notes on genome rearrangement. J. Bioinformatics Comput. Biol., 1, 71-94.
11. Tesler,G. (2002) Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci., 65, 587-609.
12. Yancopoulos,S. et al. (2005) Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics, 21, 3340-3346.