Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
From MaRDI portal
Publication:3011843
DOI10.1007/978-3-642-21458-5_7zbMath1339.92051OpenAlexW173661187MaRDI QIDQ3011843
Binhai Zhu, Farong Zhong, Haitao Jiang
Publication date: 29 June 2011
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_7
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Approximation algorithms (68W25)
Related Items (10)
Group activity selection problem with approval preferences ⋮ Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem ⋮ A new approximation algorithm for contig-based genomic scaffold filling ⋮ Genomic Scaffold Filling: A Progress Report ⋮ Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling ⋮ A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling ⋮ On the solution bound of two-sided scaffold filling ⋮ A Retrospective on Genomic Preprocessing for Comparative Genomics ⋮ Computing a consensus trajectory in a vehicular network ⋮ A 1.5-approximation algorithm for two-sided scaffold filling
Cites Work
- Unnamed Item
- The greedy algorithm for edit distance with moves
- Efficient algorithms for multichromosomal genome rearrangements.
- On the inapproximability of the exemplar conserved interval distance problem of genomes
- Non-breaking Similarity of Genomes with Gene Repetitions
- Minimum Common String Partition Revisited
- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- The Approximability of the Exemplar Breakpoint Distance Problem
- Algorithms and Computation
This page was built for publication: Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
