The complexity of calculating exemplar distances
From MaRDI portal
Publication:5457092
zbMATH Open1137.92335MaRDI QIDQ5457092FDOQ5457092
Authors: David Bryant 
Publication date: 14 April 2008
Recommendations
- A fast and exact algorithm for the exemplar breakpoint distance
- The Approximability of the Exemplar Breakpoint Distance Problem
- On the inapproximability of the exemplar conserved interval distance problem of genomes
- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
- Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
Cited In (13)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
- Repetition-free longest common subsequence
- Genomic distances under deletions and insertions
- On the Approximability of Comparing Genomes with Duplicates
- A fast and exact algorithm for the exemplar breakpoint distance
- New genome similarity measures based on conserved gene adjacencies
- Computing the tandem duplication distance is NP-hard
- Repetition-free longest common subsequence
- On the solution bound of two-sided scaffold filling
- Computing the rearrangement distance of natural genomes
- On the inapproximability of the exemplar conserved interval distance problem of genomes
- Natural family-free genomic distance
- On the computational complexity of closest genome problems
This page was built for publication: The complexity of calculating exemplar distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5457092)
