Pages that link to "Item:Q3011843"
From MaRDI portal
The following pages link to Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies (Q3011843):
Displaying 12 items.
- A 1.5-approximation algorithm for two-sided scaffold filling (Q261348) (← links)
- Group activity selection problem with approval preferences (Q1621725) (← links)
- On the solution bound of two-sided scaffold filling (Q2034400) (← links)
- Computing a consensus trajectory in a vehicular network (Q2091112) (← links)
- A new approximation algorithm for contig-based genomic scaffold filling (Q2220846) (← links)
- Comparing incomplete sequences via longest common subsequence (Q2333802) (← links)
- Fixed-parameter algorithms for scaffold filling (Q2513609) (← links)
- Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem (Q3196388) (← 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 1.4-Approximation Algorithm for Two-Sided Scaffold Filling (Q4632215) (← links)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)