On the Approximability of Comparing Genomes with Duplicates
From MaRDI portal
Recommendations
- On the Approximability of Comparing Genomes with Duplicates
- Genomes Containing Duplicates Are Hard to Compare
- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
- The Approximability of the Exemplar Breakpoint Distance Problem
Cited in
(29)- Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints
- Solving the gene duplication feasibility problem in linear time
- On the solution bound of two-sided scaffold filling
- Parameterized complexity of two-interval pattern problem
- Computing a consensus trajectory in a vehicular network
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations
- A diffusion approach to approximating preservation probabilities for gene duplicates
- A 1.5-approximation algorithm for two-sided scaffold filling
- A fast and exact algorithm for the exemplar breakpoint distance
- New genome similarity measures based on conserved gene adjacencies
- A note on complexity of genetic mutations
- Repetition-free longest common subsequence of random sequences
- Approximation and nonapproximability for the one-sided scaffold filling problem
- Exemplar or matching: modeling DCJ problems with unequal content genome data
- Non-breaking Similarity of Genomes with Gene Repetitions
- Genomes Containing Duplicates Are Hard to Compare
- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
- New applications of interval generators to genome comparison
- Genomic scaffold filling: a progress report
- Notes on the \(\frac{6}{5}\)-approximation algorithm for one-sided scaffold filling
- Duplication-loss genome alignment: complexity and algorithm
- A retrospective on genomic preprocessing for comparative genomics
- The potential of family-free genome comparison
- Computing the rearrangement distance of natural genomes
- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications
- On the Approximability of Comparing Genomes with Duplicates
- Computing and Combinatorics
- Natural family-free genomic distance
This page was built for publication: On the Approximability of Comparing Genomes with Duplicates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627965)
