Faster Algorithm for the Set Variant of the String Barcoding Problem

DOI10.1007/978-3-540-69068-9_10MaRDI QIDQ3506944zbMATH OpenOpenAlexFDO

Authors Cindy Y. Li, Meng Zhang, Leszek Gąsieniec

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69068-9_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Computational Science – ICCS 2005
• Parameterized lower bound and inapproximability of polylogarithmic string barcoding
• Tight approximability results for test set problems in bioinformatics
• scientific article; zbMATH DE number 1305456
• Distinguishing string selection problems.

Cites work

• Computational Science – ICCS 2005
• scientific article; zbMATH DE number 3551946 (Why is no real title available?)
• Tight approximability results for test set problems in bioinformatics

Cited in

(3)

• Tight approximability results for test set problems in bioinformatics
• Computational Science – ICCS 2005
• Parameterized lower bound and inapproximability of polylogarithmic string barcoding

This page was built for publication: Faster Algorithm for the Set Variant of the String Barcoding Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506944)