Analysis of circular genome rearrangement by fusions, fissions and block-interchanges

BMC Bioinformatics

Volumn 7, Issue , 2006, Pages

  Lu, Chin Lung ^a   Huang, Yen Lin ^b   Wang, Tsui Ching ^a   Chiu, Hsien Tai ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS ANALYSIS; CHROMOSOMAL SEQUENCES; COMBINATORIAL PROBLEM; COMPARATIVE ANALYSIS; EVOLUTIONARY HISTORY; EVOLUTIONARY RELATIONSHIPS; GENOME REARRANGEMENTS; MULTIPLE CHROMOSOMES;

BIOINFORMATICS; EVOLUTIONARY ALGORITHMS; RNA;

GENES;

RNA 16S;

ARTICLE; BACTERIAL GENETICS; BACTERIAL GENOME; BIOINFORMATICS; CHROMOSOME REARRANGEMENT; COMPUTER ANALYSIS; CONTROLLED STUDY; GENE FUSION; GENE NUMBER; GENE REARRANGEMENT; GENETIC ALGORITHM; GENOME ANALYSIS; MOLECULAR EVOLUTION; NONHUMAN; NUCLEOTIDE SEQUENCE; RNA SEQUENCE; SPECIES COMPARISON; VIBRIO; ALGORITHM; BIOLOGICAL MODEL; BIOLOGY; CHROMOSOME INVERSION; COMPUTER PROGRAM; DNA SEQUENCE; GENETIC RECOMBINATION; GENETICS; GENOMICS; PROCEDURES; THEORETICAL MODEL;

VIBRIO;

ALGORITHMS; CHROMOSOME INVERSION; COMPUTATIONAL BIOLOGY; EVOLUTION, MOLECULAR; GENOME, BACTERIAL; GENOMICS; MODELS, GENETIC; MODELS, THEORETICAL; RECOMBINATION, GENETIC; RNA, RIBOSOMAL, 16S; SEQUENCE ANALYSIS, DNA; SOFTWARE; VIBRIO;

EID: 33748901317     PISSN: 14712105     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-7-295     Document Type: Article

References (36)

1. Hannenhalli S, Pevzner PA: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J Assoc Comput Mach 1999, 46:1-27.
2. Bader DA, Yan M, Moret BMW: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J Comput Biol 2001, 8:483-491.
3. Bafna V, Pevzner PA: Genome rearrangements and sorting by reversals. SIAM J Comput 1996, 25:272-289.
4. Berman P, Hannenhalli S: Fast sorting by reversal. In Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching (CPM1996), Volume 1075 of Lecture Notes in Computer Science Edited by: Hirschberg DS, Myers E. Springer-Verlag; 1996:168-185.
5. Berman P, Hannenhalli S, Karpinski M: 1.375-approximation algorithm for sorting by reversals. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA2002), Volume 2461 of Lecture Notes in Computer Science Edited by: Mohring RH, Raman R. Springer-Verlag; 2002:200-210.
6. Caprara A: Sorting by reversal is difficult. In Proceedings of the 1th Annual International Conference on Research in Computational Molecular Biology (RECOMB1997) ACM Press; 1997:75-83.
7. Caprara A: Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J Discrete Math 1999, 12:91-110.
8. Christie DA. A 3/2-approximation algorithm for sorting by reversals. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA1998), ACM/SIAM 1998:244-252.
9. Kaplan H, Shamir R, Tarjan RE: Faster and simpler algorithm for sorting signed permutations by reversals. SIAM J Comput 2000, 29:880-892.
10. Kececioglu JD, Sankoff D: Exact and approximation algorithms for the inversion distance between two permutations. In Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching (CPM1993), Volume 684 of Lecture Notes on Computer Science Edited by: Apostolico A, Crochemore M, Galil Z, Manber U. Springer-Verlag; 1993:87-105.
11. Bafna V, Pevzner PA: Sorting by transpositions. SIAM J Discrete Math 1998, 11:221-240.
12. Walter MEMT, Dias Z, Meidanis J: Reversal and transposition distance of linear chromosomes. In Proceedings of String Processing and Information Retrieval (SPIRE1998) IEEE Computer Society; 1998:96-102.
13. Christie DA: Sorting by block-interchanges. Inform Process Lett 1996, 60:165-169.
14. Lin YC, Lu CL, Chang HY, Tang CY: An efficient algorithm for sorting by block- interchanges and its application to the evolution of Vibrio species. J Comput Biol 2005, 12:102-112.
15. Lu CL, Wang TC, Lin YC, Tang CY: ROBIN: a tool for genome rearrangement of block-interchanges. Bioinformatics 2005, 21:2780-2782.
16. Hannenhalli S: Polynomial algorithm for computing translocation distance between genomes. Discrete Appl Math 1996, 71:137-151.
17. Kececioglu JD, Ravi R: Of mice and men: algorithms for evolutionary distances between genomes with translocation. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms (SODA1995) ACM/SIAM, San Francisco; 1995:604-613.
18. Hannenhalli S, Pevzner PA: Transforming men into mice (polynomial algorithm for genomic distance problem). In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOCS1995) IEEE Computer Society; 1995:581-592.
19. Meidanis J, Bias Z: Genome rearrangements distance by fusion, fission, and transposition is easy. In Proceedings of the 8th International Symposium on String Processing and Information Retrieval (SPIRE2001) Edited by: Navarro G. IEEE Computer Society; 2001:250-253.
20. Tillier ER, Collins RA: Genome rearrangement by replication-directed translocation. Nat Genet 2000, 26:195-197.
21. Yancopoulos S, Attie O, Friedberg R: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 2005, 21:3340-3346.
22. FFBI: a tool of circular genome rearrangement by fusions, fissions and block-interchanges [http://genome.life.nctu.edu.tw/FFBI/]
23. The COG database [http://www.ncbi.nlm.nih.gov/COG/]
24. Dorsch M, Lane D, Stackebrandt E: Towards a phylogeny of the genus Vibrio based on 16S rRNA sequences. Int J Syst Bacterial 1992, 42:58-63.
25. Kita-Tsukamoto K, Oyaizu H, Nanba K, Simidu U: Phylogenetic relationships of marine bacteria, mainly members of the family Vibrionaceae, determined on the basis of 16S rRNA sequences. Int J Syst Bacteriol 1993, 43:8-19.
26. Okada K, Iida T, Kita-Tsukamoto K, Honda T: Vibrios commonly possess two chromosomes. J Bacteriol 2005, 187:752-757.
27. Thompson JD, Higgins DG, Gibson TJ: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res 1994, 22:4673-4680.
28. Felsenstein J: PHYLIP: phylogeny inference package (version 3.2). Cladistics 1989, 5:164-166.
29. Fraleigh JB: A First Course in Abstract Algebra 7th edition. Addison-Wesley; 2003.
30. Meidanis J, Dias Z: An alternative algebraic formalism for genome rearrangements. In Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families Edited by: Sankoff D, Nadeau JH. Kluwer Academic Publisher; 2000:213-223.
31. Cormen TH, Leiserson CE, Rivest RL, Stein C: Introduction to Algorithms 2nd edition. The MIT Press; 2001.
32. Gabow HN, Tarjan RE: A linear-time algorithm for a special case of disjoint set union. J Comput Syst Sci 1985, 30:209-221.
33. Tatusov RL, Koonin EV, Lipman DJ: A genomic perspective on protein families. Science 1997, 278:631-637.
34. Koonin EV: Orthologs, paralogs, and evolutionary genomics. Annu Rev Genet 2005, 39:309-338.
35. GenePlot [http://www.ncbi.nim.nih.gov/sutils/geneplot.cgi]
36. Garcia-Vallve S, Guzman E, Montero MA, Romeu A: HGT-DB: a database of putative horizontally transferred genes in prokaryotic complete genomes. Nucleic Acids Res 2003, 31:187-189 [http://www.fut.es/~debb/HGT/].