Approximating the double-cut-and-join distance between unsigned genomes

BMC Bioinformatics

Volumn 12, Issue SUPPL. 9, 2011, Pages

  Chen, Xin ^a   Sun, Ruimin ^a   Yu, Jiadong ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; BREAKPOINT GRAPHS; LINEAR CHROMOSOME; OPTIMIZATION PROBLEMS; PACKING PROBLEMS; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS;

APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION;

GENES;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; CHROMOSOME; GENOME; GENOMICS; METHODOLOGY;

ALGORITHMS; CHROMOSOMES; GENOME; GENOMICS; MODELS, GENETIC;

EID: 80053490256     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-12-S9-S17     Document Type: Article

References (15)

1. Bafna V, Pevzner PA. Genome rearrangements and sorting by reversals. SFCS '93: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science 1993, 148-157. 3149665, 21706247.
2. Hannenhalli S, Pevzner P. To cut ... or not to cut (applications of comparative physical maps in molecular evolution). SODA '96: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms 1996, 304-313.
3. Kececioglu JD, Sankoff D. Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement. Algorithmica 1995, 13(1/2):180-210.
4. Yancopoulos S, Attie O, Friedberg R. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 2005, 21(16):3340-3346. 10.1093/bioinformatics/bti535, 15951307.
5. Hannenhalli S, Pevzner PA. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. STOC 1995, 178-189.
6. Hannenhalli S, Pevzner PA. Transforming Men into Mice (Polynomial Algorithm for Genomic Distance Problem). FOCS 1995, 581-592.
7. Caprara A. Sorting by reversals is difficult. RECOMB '97: Proceedings of the first annual international conference on Computational molecular biology 1997, 75-83.
8. Bergeron A, Mixtacki J, Stoye J. A Unifying View of Genome Rearrangements. WABI 2006, 163-173.
9. Chen X. On sorting permutations by double-cut-and-joins. Proceedings of the 16th annual international conference on Computing and combinatorics 2010, 439-448.
10. Jiang H, Zhu B, Zhu D. Algorithms for sorting unsigned linear genomes by the DCJ operations. Bioinformatics 2011, 27(3):311-316. 10.1093/bioinformatics/btq674, 21134895.
11. Sun R, Chen X. Approximating the degree-bounded k-set packing problem. 2011, http://www1.spms.ntu.edu.sg/~chenxin/paper/SP.pdf
12. Halldórsson MM. Approximating discrete collections via local improvements. SODA '95: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms 1995, 160-169.
13. Papadimitriou CM. Computational complexity. 1994, Addison-Wesley.
14. Caprara A, Rizzi R. Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. J. Comb. Optim. 2002, 6(2):157-182.
15. Lin G, Jiang T. A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition. J. Comb. Optim. 2004, 8(2):183-194.