Algorithm Theory - SWAT 2004

DOI10.1007/B98413zbMATH Open1095.68596OpenAlexW2615963353MaRDI QIDQ5315401FDOQ5315401

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

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

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
• Approximation algorithms for the test cover problem
• Phage typing sets
• Tight approximability results for test set problems in bioinformatics

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)