An Exact Algorithm for the Zero Exemplar Breakpoint Distance Problem

The exemplar breakpoint distance problem is one of the most important problems in genome comparison and has been extensively studied in the literature. The exemplar breakpoint distance problem cannot be approximated within any factor even if each gene family occurs at most twice in a genome. This is due to the fact that its decision version, the zero exemplar breakpoint distance problem where each gene family occurs at most twice in a genome (ZEBD(2, 2) for short) is NP-hard. Thus, the basic version ZEBD(2, 2) has attracted the attention of many scientists. The best existing algorithm for ZEBD(2, 2) runs in O(n2n) time. In this paper, we propose a new algorithm for ZEBD(2, 2) with running time O(n21:86121n). We have implemented the algorithm in Java. The software package is available upon request.

[1]  David Sankoff,et al.  Genome rearrangement with gene families , 1999, Bioinform..

[2]  Guillaume Fertin,et al.  Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes , 2008, J. Comput. Biol..

[3]  Minghui Jiang,et al.  The Zero Exemplar Distance Problem , 2010, RECOMB-CG.

[4]  Guillaume Fertin,et al.  Comparing Genomes with Duplications: A Computational Complexity Point of View , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[5]  P. Bonizzoni,et al.  Exemplar Longest Common Subsequence , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[6]  Peter H. Sudmant,et al.  Evolution of Human-Specific Neural SRGAP2 Genes by Incomplete Segmental Duplication , 2012, Cell.

[7]  D. Bryant.  The Complexity of Calculating Exemplar Distances , 2000 .

[8]  Guillaume Fertin,et al.  The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated , 2009, WALCOM.

[9]  Bin Fu,et al.  Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes , 2006, COCOON.

[10]  Guillaume Fertin,et al.  On the Approximability of Comparing Genomes with Duplicates , 2008, J. Graph Algorithms Appl..

[11]  Bin Fu,et al.  A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance , 2011, ISBRA.

[12]  D. Sankoff,et al.  Comparative Genomics: "Empirical And Analytical Approaches To Gene Order Dynamics, Map Alignment And The Evolution Of Gene Families" , 2000 .

[13]  Guillaume Fertin,et al.  Combinatorics of Genome Rearrangements , 2009, Computational molecular biology.

[14]  Y. C. Tay,et al.  Divide-and-conquer approach for the exemplar breakpoint distance , 2005, Bioinform..

[15]  Binhai Zhu,et al.  Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems , 2009, TAMC.

[16]  Bin Fu,et al.  The Approximability of the Exemplar Breakpoint Distance Problem , 2006, AAIM.

[17]  Mam Riess Jones.  Color Coding , 1962, Human factors.