Parameterized lower bound and inapproximability of polylogarithmic string barcoding
From MaRDI portal
Publication:941834
DOI10.1007/S10878-007-9097-XzbMath1144.92015OpenAlexW2070508961MaRDI QIDQ941834
Legand L. Burge, Chunmei Liu, Yinglei Song
Publication date: 2 September 2008
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9097-x
Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Unnamed Item
- Unnamed Item
- Tight approximability results for test set problems in bioinformatics
- The importance of being biased
- Efficient algorithms for finding maximum matching in graphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Computational Science – ICCS 2005
This page was built for publication: Parameterized lower bound and inapproximability of polylogarithmic string barcoding
