Approximation algorithms for a genetic diagnostics problem

DOI10.1007/3-540-63307-3_49zbMath1500.92055OpenAlexW1539937237MaRDI QIDQ5096927

S. Rao Kosaraju, Leslie G. Biesecker, Alejandro A. Schäffer

Publication date: 19 August 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_49

zbMATH Keywords

greedy algorithmlocal searchdetection probabilitygreedy heuristicdetection power

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Medical applications (general) (92C50) Genetics and epigenetics (92D10) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• A Greedy Heuristic for the Set-Covering Problem
• Reducibility among Combinatorial Problems

This page was built for publication: Approximation algorithms for a genetic diagnostics problem