Pages that link to "Item:Q3627965"

The following pages link to On the Approximability of Comparing Genomes with Duplicates (Q3627965):

Displaying 20 items.

• A 1.5-approximation algorithm for two-sided scaffold filling (Q261348) (← links)
• Repetition-free longest common subsequence of random sequences (Q299053) (← links)
• Exemplar or matching: modeling DCJ problems with unequal content genome data (Q346504) (← links)
• On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
• New applications of interval generators to genome comparison (Q414431) (← links)
• Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints (Q1784981) (← links)
• On the solution bound of two-sided scaffold filling (Q2034400) (← links)
• Parameterized complexity of two-interval pattern problem (Q2067621) (← links)
• Computing a consensus trajectory in a vehicular network (Q2091112) (← links)
• \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations (Q2250447) (← links)
• A NOTE ON COMPLEXITY OF GENETIC MUTATIONS (Q2890984) (← 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)
• A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
• The Potential of Family-Free Genome Comparison (Q4992763) (← links)
• Computing the Rearrangement Distance of Natural Genomes (Q5041791) (← links)
• Tandem Duplications, Segmental Duplications and Deletions, and Their Applications (Q5042229) (← links)
• Natural family-free genomic distance (Q6487622) (← links)