An improved algorithm for sorting by block-interchanges based on permutation groups

Information Processing Letters

Volumn 110, Issue 8-9, 2010, Pages 345-350

  Huang, Yen Lin ^a   Huang, Cheng Chen ^b   Tang, Chuan Yi ^a   Lu, Chin Lung ^b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Block interchange; Data structure; Generalized transposition; Genome rearrangement; Permutation group; Permutation tree

Indexed keywords

BLOCK-INTERCHANGE; GENOME REARRANGEMENT; GENOME REARRANGEMENTS; IMPROVED ALGORITHM; NUMBER OF BLOCKS; PERMUTATION GROUP; TIME ALGORITHMS;

ALGORITHMS; DATA STRUCTURES; GENES; INTERCHANGES; SORTING;

INTERSECTIONS;

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

References (21)

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. Journal of Computational Biology 8 (2001) 483-491
2. Bafna V., and Pevzner P.A. Sorting by transpositions. SIAM Journal on Discrete Mathematics 11 (1998) 224-240
3. Belda E., Moya A., and Silva F.J. Genome rearrangement distances and gene order phylogeny in γ-Proteobacteria. Molecular Biology and Evolution 22 (2005) 1456-1467
4. Bergeron A., Mixtacki J., and Stoye J. On sorting by translocations. Journal of Computational Biology 13 (2006) 567-578
5. Bóna M., and Flynn R. The average number of block interchanges needed to sort a permutation and a recent result of Stanley. Information Processing Letters 109 (2009) 927-931
6. Christie D.A. Sorting permutations by block-interchanges. Information Processing Letters 60 (1996) 165-169
7. Elias I., and Hartman T. A 1.375-approximation algorithm for sorting by transpositions. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3 (2006) 369-379
8. Feng J., and Zhu D. Faster algorithms for sorting by transpositions and sorting by block interchanges. ACM Transactions on Algorithms 3 (2007) 25
9. Fraleigh J.B. A First Course in Abstract Algebra. 7th ed. (2003), Addison-Wesley, Boston
10. Hannenhalli S. Polynomial-time algorithm for computing translocation distance between genomes. Discrete Applied Mathematics 71 (1996) 137-151
11. Hannenhalli S., and Pevzner P.A. Transforming men into mice (polynomial algorithm for genomic distance problem). Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (1995), IEEE Computer Society Press, Los Alamitos, CA 581-592
12. Hannenhalli S., and Pevzner P.A. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM 46 (1999) 1-27
13. Kaplan H., Shamir R., and Tarjan R.E. Faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal on Computing 29 (1999) 880-892
14. Lin Y.C., Lu C.L., Chang H.-Y., and Tang C.Y. An efficient algorithm for sorting by block-interchanges and its application to the evolution of vibrio species. Journal of Computational Biology 12 (2005) 102-112
15. Lu C.L., Huang Y.-L., Wang T.C., and Chiu H.-T. Analysis of circular genome rearrangement by fusions, fissions and block-interchanges. BMC Bioinformatics 7 (2006) 295
16. Meidanis J., and Dias Z. An alternative algebraic formalism for genome rearrangements. In: Sankoff D., and Nadeau J.H. (Eds). Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families (2000), Kluwer Academic Publisher, New York 213-223
17. Meidanis J., and Dias Z. Genome rearrangements distance by fusion, fission, and transposition is easy. In: Navarro G. (Ed). Proceedings of String Processing and Information Retrieval (2001), IEEE Computer Society, Los Alamitos, CA 250-253
18. 3 / 2 sqrt(log n)) algorithm for sorting by reciprocal translocations. Lecture Notes in Computer Science vol. 4009 (2006) 258-269
19. Pevzner P.A., and Tesler G. Genome rearrangements in mammalian evolution: Lessons from human and mouse genomes. Genome Research 13 (2003) 37-45
20. Sankoff D., Leduc G., Antoine N., Paquin B., Lang B.F., and Cedergren R. Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proceedings of the National Academy of Sciences 89 (1992) 6575-6579
21. Tannier E., Bergeron A., and Sagot M.F. Advances on sorting by reversals. Discrete Applied Mathematics 155 (2007) 881-888