Engineering Competitive and Query-Optimal Minimal-Adaptive Randomized Group Testing Strategies
Licentiate thesis, 2011
learning by queries
combinatorial search
competitive ratio
randomization
pooling design
group testing
linear program
Author
Muhammad Azam Sheikh
Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)
Competitive group testing and learning hidden vertex covers with minimum adaptivity
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),;Vol. 5699(2009)p. 84-95
Paper in proceeding
Bounds for nonadaptive group tests to estimate the amount of defectives
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),;Vol. 6509(2010)p. 117-130
Paper in proceeding
Competitive group testing and learning hidden vertex covers with minimum adaptivity
Discrete Mathematics, Algorithms and Applications,;Vol. 2(2010)p. 291-311
Journal article
Areas of Advance
Information and Communication Technology
Driving Forces
Sustainable development
Roots
Basic sciences
Subject Categories
Bioinformatics and Systems Biology
Computer Science
Technical report L - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University: 81L
Publisher
Chalmers
room EA, EDIT building, Chalmers University of Technology, Gothenburg.
Opponent: Prof. Dr. Eberhard Triesch, Chair for Mathematics,Technical University (RWTH) Aachen, Germany.