Efficient two-stage group testing algorithms for genetic screening

DOI10.1007/s00453-013-9791-2zbMath1290.68132arXiv1306.4664OpenAlexW3101256766MaRDI QIDQ378260

Michael Huber

Publication date: 11 November 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.4664

zbMATH Keywords

combinatorial designDNA librarygenetic screeninggroup testing algorithmtwo-stage disjunctive testing

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial optimization (90C27) Protein sequences, DNA sequences (92D20) Randomized algorithms (68W20)

Cites Work

• On resolvable difference families
• On large sets of disjoint Steiner triple systems. IV
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
• On cyclically resolvable cyclic Steiner 2-designs
• Some new 2-resolvable Steiner quadruple systems
• Resolvable balanced incomplete block designs with block size 8
• A universal bound for a covering in regular posets and its application to pool testing
• Steiner systems for two-stage disjunctive testing
• Coding Theory and Algebraic Combinatorics
• A class of Steiner 4-wise balanced designs derived from preparata codes
• Cyclic resolvability of cyclic Steiner 2-designs
• On simple radical difference families
• Asymptotic efficiency of two-stage disjunctive testing
• Flag-transitive Steiner Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item