Pages that link to "Item:Q5434407"
From MaRDI portal
The following pages link to The Approximability of the Exemplar Breakpoint Distance Problem (Q5434407):
Displaying 16 items.
- A 1.5-approximation algorithm for two-sided scaffold filling (Q261348) (← links)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials (Q1944393) (← links)
- On the solution bound of two-sided scaffold filling (Q2034400) (← links)
- A new approximation algorithm for contig-based genomic scaffold filling (Q2220846) (← links)
- On the inapproximability of the exemplar conserved interval distance problem of genomes (Q2427442) (← links)
- Can a breakpoint graph be decomposed into none other than 2-cycles? (Q2636497) (← links)
- Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies (Q3011843) (← links)
- Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem (Q3196388) (← links)
- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated (Q3605511) (← links)
- Genomic Scaffold Filling: A Progress Report (Q4632164) (← links)
- Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling (Q4632180) (← links)
- Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? (Q4632186) (← links)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
- On the Approximability of Comparing Genomes with Duplicates (Q5452150) (← links)
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)