Genomic Scaffold Filling Revisited.
From MaRDI portal
Publication:5369550
DOI10.4230/LIPIcs.CPM.2016.15zbMath1380.68478OpenAlexW2533256899MaRDI QIDQ5369550
Boting Yang, Daming Zhu, Farong Zhong, Binhai Zhu, Haitao Jiang, Chenglin Fan
Publication date: 17 October 2017
Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.CPM.2016.15
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Approximation algorithms (68W25) Algorithms on strings (68W32)
Related Items (4)
A Polynomial Time Solution for Permutation Scaffold Filling ⋮ A new approximation algorithm for contig-based genomic scaffold filling ⋮ Genomic Scaffold Filling: A Progress Report ⋮ On the solution bound of two-sided scaffold filling
This page was built for publication: Genomic Scaffold Filling Revisited.
