An exact algorithm for the zero exemplar breakpoint distance problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Volumn 10, Issue 6, 2013, Pages 1469-1477

  Zhu, Daming ^a   Wang, Lusheng ^b  

^a SHANDONG UNIVERSITY   (China)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Algorithms; Exemplar breakpoint distance; Gene family; Genome; Time complexity

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; CHROMOSOME MAP; COMPUTER LANGUAGE; COMPUTER PROGRAM; COMPUTER SIMULATION; GENOME; METHODOLOGY;

ALGORITHMS; CHROMOSOME MAPPING; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; GENOME; MODELS, GENETIC; PROGRAMMING LANGUAGES; SOFTWARE;

EID: 84894573077     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2013.127     Document Type: Article

References (16)

1. N. Alon, R. Yuster, and U. Zwick, "Color Coding," J. ACM, vol. 42, no. 4, pp. 844-856, 1995.
2. S. Angibaud, G. Fertin, and I. Rusu, "On the Approximability of Comparing Genomes with Duplicates," Proc. Second Int'l Workshop Algorithms and Computation (WalCom '08), pp. 34-45, 2008.
3. S. Angibaud, G. Fertin, I. Rusu, A. Thévenin, and S. Vialette, "Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes," J. Computational Biology, vol. 15, no. 8, pp. 1093-1115, 2008.
4. G. Blin, G. Fertin, F. Sikora, and S. Vialette, "The Exemplar Breakpoint Distance for Nontrivial Genomes cannot be Approximated," Proc. Third Int'l Workshop Algorithms and Computation, 2009.
5. G. Blin, C. Chauve, G. Fertin, R. Rizzi, and S. Vialette, "Comparing Genomes with Duplications: A Computational Complexity Point of View," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 4, no. 4, pp. 523-534, Oct.-Dec. 2007. (Pubitemid 350125876)
6. D. Bryant, "The Complexity of Calculating Exemplar Distances," Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pp. 207-212, Kluwer Academic Publishers, 2000.
7. P. Bonizzoni, G.D. Vedova, R. Dondi, L. Fertin, R. Rizzi, and S. Vialette, "Exemplar Longest Common Subsequence," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 4, no. 4, pp. 535-543, Oct.-Dec. 2007. (Pubitemid 350125877)
8. Z. Chen, B. Fu, and B. Zhu, "The Approximability of the Exemplar Breakpoint Distance Problem," Proc. Second Int'l Conf. Algorithmic Aspects in Information and Management, pp. 291-302, 2006. (Pubitemid 44098487)
9. Z. Chen, R.H. Fowler, B. Fu, and B. Zhu, "Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes," Proc. 12th Ann. Int'l Conf. Computing and Combinatorics, pp. 245-254, 2006. (Pubitemid 44531976)
10. M.Y. Dennis, X. Nuttle, P.H. Sudmant, F. Antonacci, T.A. Graves, M. Nefedov, J.A. Rosenfeld, S. Sajjadian, M. Malig, H. Kotkiewicz, C.J. Curry, S. Shafer, L.G. Shaffer, P.J. Jong, R.K. Wilson, and E.E. Eichler, "Evolution of Human-Specific Neural SRGAP2 Genes by Incomplete Segmental Duplication," Cell, vol. 149, no. 4, pp. 912- 922, 2012.
11. G. Fertin, A. Labarre, I. Rusu, E. Tannier, and S. Vialette, Combinatorics of Genome Rearrangements. MIT Press, 2009.
12. B. Fu and L. Zhang, "A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance," Proc. Seventh Int'l Conf. Bioinformatics Research and Applications (ISBRA '11), pp. 297C305, 2011.
13. M. Jiang, "The Zero Exemplar Distance Problem," J. Computational Biology, vol. 18, no. 9, pp. 1077-1086, 2011.
14. D. Sankoff, "Genome Rearrangement with Gene Families," Bioinformatics, vol. 15, no. 11, pp. 909-917, 1999. (Pubitemid 30103161)
15. C. Thach Nguyen, Y.C. Tay, and L. Zhang, "Divide-and-Conquer Approach for the Exemplar Breakpoint Distance," Bioinformatics, vol. 21, pp. 2171-2176, 2005. (Pubitemid 40731567)
16. B. Zhu, "Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems," Proc. Sixth Ann. Conf. Theory and Applications of Models of Computation (TAMC '09), 2009.