Journal of the ACM (JACM)
Comparing Genomes with Duplications: A Computational Complexity Point of View
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
On the approximability of comparing genomes with duplicates
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
The approximability of the exemplar breakpoint distance problem
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
The zero exemplar distance problem
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
A polynomial algebra method for computing exemplar breakpoint distance
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Filling scaffolds with gene repetitions: maximizing the number of adjacencies
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Scaffold Filling under the Breakpoint and Related Distances
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Inapproximability of (1,2)-exemplar distance
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Inapproximability of (1,2)-Exemplar Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An Exact Algorithm for the Zero Exemplar Breakpoint Distance Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
A promising and active field of comparative genomics consists in comparing two genomes by establishing a one-to-one correspondence (i.e., a matching) between their genes. This correspondence is usually chosen in order to optimize a predefined measure. One such problem is the Exemplar Breakpoint Distance problem (or EBD , for short), which asks, given two genomes modeled by signed sequences of characters, to keep and match exactly one occurrence of each character in the two genomes (a process called exemplarization ), so as to minimize the number of breakpoints of the resulting genomes. Bryant [6] showed that EBD is NP -complete. In this paper, we close the study of the approximation of EBD by showing that no approximation factor can be derived for EBD considering non-trivial genomes --- i.e. genomes that contain duplicated genes.