A new linear time algorithm to compute the genomic distance via the double cut and join distance

Theoretical Computer Science

Volumn 410, Issue 51, 2009, Pages 5300-5316

  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 rearrangements; Genomic distance computation; Sorting by translocations, fusions, fissions and inversions

Indexed keywords

COMPARATIVE GENOMICS; DISTANCE FORMULA; GENOME REARRANGEMENTS; GENOMIC DISTANCE; GENOMIC DISTANCE COMPUTATION; LINEAR-TIME ALGORITHMS; TREE STRUCTURES;

GENES;

COMPUTATION THEORY;

EID: 70349965982     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.09.008     Document Type: Article

References (19)

1. Bader D.A., Moret B.M.E., and Yan M. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comput. Biol. 8 5 (2001) 483-491
2. Bergeron A. A very elementary presentation of the Hannenhalli-Pevzner theory. Proceedings of CPM 2001. LNCS vol. 2089 (2001), Springer Verlag 106-117
3. Berman P., and Hannenhalli S. Fast sorting by reversal. Proceedings of CPM 1996. LNCS vol. 1075 (1996), Springer Verlag 168-185
4. Bergeron A., Heber S., and Stoye J. Common intervals and sorting by reversals: A marriage of necessity. Bioinformatics 18 Suppl. 2 (2002) S54-S63
5. Bergeron A., Mixtacki J., and Stoye J. Reversal distance without hurdles and fortresses. Proceedings of CPM 2004. LNCS vol. 3109 (2004), Springer Verlag 388-399
6. Bergeron A., Mixtacki J., and Stoye J. The inversion distance problem. In: Gascuel O. (Ed). Mathematics of Evolution and Phylogeny (2005), Oxford University Press, Oxford, UK 262-290 chapter 10
7. Bergeron A., Mixtacki J., and Stoye J. On sorting by translocations. J. Comput. Biol. 13 2 (2006) 567-578
8. Bergeron A., Mixtacki J., and Stoye J. A unifying view of genome rearrangements. Proceedings of WABI 2006. LNBI vol. 4175 (2006), Springer Verlag 163-173
9. Bergeron A., and Stoye J. On the similarity of sets of permutations and its applications to genome comparison. In: Warnow T., and Zhu B. (Eds). Proceedings of COCOON 2003. LNCS vol. 2697 (2003), Springer Verlag 68-79
10. Dobzhansky T., and Sturtevant A.T. Inversions in the Chromosomes of Drosophila pseudoobscura. Genetics 23 (1938) 28-64
11. Fitch W.M. Homology: a personal view on some of the problems. Trends Genet. 16 5 (2000) 227-231
12. Hannenhalli S., and Pevzner P.A. Transforming men into mice (polynomial algorithm for genomic distance problem). Proceedings of FOCS 1995 (1995), IEEE Press 581-592
13. Hannenhalli S., and Pevzner P.A. Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. J. ACM 46 1 (1999) 1-27
14. Jean G., and Nikolski M. Genome rearrangements: A correct algorithm for optimal capping. Inform Process. Lett. 104 (2007) 14-20
15. Kaplan H., Shamir R., and Tarjan R.E. A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput. 29 3 (1999) 880-892
16. Ozery-Flato M., and Shamir R. Two notes on genome rearrangements. J. Bioinf. Comput. Biol. 1 1 (2003) 71-94
17. Tesler G. Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci. 65 3 (2002) 587-609
18. Tesler G. GRIMM: Genome rearrangements web server. Bioinformatics 18 3 (2002) 492-493
19. Yancopoulos S., Attie O., and Friedberg R. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21 16 (2005) 3340-3346