Algorithm Theory - SWAT 2004

DOI10.1007/B98413MaRDI QIDQ5315401zbMATH OpenOpenAlexFDO

Authors Piotr Berman, Bhaskar Dasgupta, Ming-Yang Kao

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98413

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Protein sequences, DNA sequences (92D20)

Recommendations

• Tight approximability results for test set problems in bioinformatics
• scientific article; zbMATH DE number 1875415
• Deep approximation of set cover greedy algorithm for test set
• Approximation algorithms for the test cover problem
• scientific article; zbMATH DE number 1305456

Cited in

(5)

• Phage typing sets
• Approximation algorithms for the test cover problem
• Tight approximability results for test set problems in bioinformatics
• scientific article; zbMATH DE number 1875415 (Why is no real title available?)
• Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks

This page was built for publication: Algorithm Theory - SWAT 2004

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