Algorithms for sorting unsigned linear genomes by the DCJ operations

Bioinformatics

Volumn 27, Issue 3, 2011, Pages 311-316

  Jiang, Haitao ^a,b   Zhu, Binhai ^a   Zhu, Daming ^b  

^a Idaho National Laboratory   (United States)

^b SHANDONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; GENOME; GENOMICS; METHODOLOGY;

ALGORITHMS; GENOME; GENOMICS; SOFTWARE;

EID: 79551594936     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btq674     Document Type: Article

References (16)

1. Bafna,V. and Pevzner,P. (1998) Sorting by Transpositions. SIAM J. Discrete Math., 11, 224-240.
2. Bergeron,A. et al. (2006) A unifying view of genome rearrangements. In Proceedings of the 6th International Workshop on Algorithms in Bioinformatics (WABI'06), Springer, Germany, pp. 163-173.
3. Berman,P. et al. (2002) 1.375-Approximation algorithm for sorting by reversals. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02), Springer, Germany, pp. 200-210.
4. Caprara,A. (1999) Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discrete Math., 12, 91-110.
5. Chen,X. (2010) On sorting permutations by double-cut-and-joins. In Proceedings of the 16th International Conf. on Computing and Combinatorics (COCOON'10), Springer, Germany, pp. 439-448.
6. Christie,D. (1998) A 3/2-Approximation algorithm for sorting by reversals. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98), ACM, New York, pp. 244-252.
7. Cui,Y. et al. (2008) A (1.5 + ∈)-Approximation algorithm for unsigned translocation distance. IEEE/ACM Trans. Comput. Biol. Bioinform., 5, 56-66.
8. Downey,D. and Fellows,M. (1999) Parameterized Complexity, Springer.
9. Elias,I. and Hartman,T. (2006) A 1.375-Approximation algorithm for sorting by transpositions. IEEE/ACM Trans. Comput. Biol. Bioinform., 3, 369-379.
10. Flum,J. and Grohe,M. (2006) Parameterized Complexity Theory. Springer, Germany.
11. Galil,Z. et al. (1986) An O(EVlog V) algorithm for finding a maximal weighted matching in general graphs. SIAM J. Comput., 15, 120-130.
12. Hannenhalli,S. and Pevzner,P. (1995) Transforming men into mice (polynomial algorithm for genomic distance problem). In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS'95), IEEE Computer Society, pp. 581-589.
13. Hannenhalli,S. and Pevzner,P. (1999) Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM, 46, 1-27.
14. Jiang,H. et al. (2010) Weak kernels. ECCC Report, TR10-005.
15. Jiang,H. and Zhu,D. (2011) A 14/11-Approximation algorithm for sorting by short block-moves. To appear in Science in China Series F.
16. Yancopoulos,S. et al. (2005) Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics, 21, 3340-3346.