Genomic Scaffold Filling: A Progress Report
From MaRDI portal
Publication:4632164
DOI10.1007/978-3-319-39817-4_2zbMath1475.68472OpenAlexW2498338562MaRDI QIDQ4632164
Publication date: 26 April 2019
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-39817-4_2
Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)
Related Items
A new approximation algorithm for contig-based genomic scaffold filling, Comparing incomplete sequences via longest common subsequence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A 1.5-approximation algorithm for two-sided scaffold filling
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
- On the inapproximability of the exemplar conserved interval distance problem of genomes
- Parameterized complexity of Vertex Cover variants
- Parametrized complexity theory.
- Fixed-parameter algorithms for scaffold filling
- A Polynomial Time Solution for Permutation Scaffold Filling
- Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
- Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem
- Non-breaking Similarity of Genomes with Gene Repetitions
- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
- On the Approximability of Comparing Genomes with Duplicates
- On Syntactic versus Computational Views of Approximability
- Color-coding
- An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
- A Retrospective on Genomic Preprocessing for Comparative Genomics
- Genomic Scaffold Filling Revisited.
- The Approximability of the Exemplar Breakpoint Distance Problem
