Efficient Two-Stage Group Testing Algorithms for Genetic Screening
Efficient Two-Stage Group Testing Algorithms for Genetic Screening
复制标题
DOI：
10.1007/s00453-013-9791-2
复制
发表时间：
2011-06
期刊：
影响因子：
1.1
通讯作者：
Michael Huber
中科院分区：
文献类型：
--
作者：
Michael Huber
高效的两阶段组测试算法，特别适合于快速和廉价的DNA文库筛选和其他大规模的生物组测试的努力，在本文中进行了研究。主要的重点是新的组合结构，以尽量减少在第二阶段的两阶段析取测试程序的个人测试的数量。基于Levenshtein最近的工作（离散数学，266：293-309，2003）和Tonchev（J. Comb. Optim.，15：1-6，2008），提出了几个新的无限类这样的组合设计。
Efficient two-stage group testing algorithms that are particularly suited for rapid and less-expensive DNA library screening and other large scale biological group testing efforts are investigated in this paper. The main focus is on novel combinatorial constructions in order to minimize the number of individual tests at the second stage of a two-stage disjunctive testing procedure. Building on recent work by Levenshtein (Discrete Math., 266:293–309, 2003) and Tonchev (J. Comb. Optim., 15:1–6, 2008), several new infinite classes of such combinatorial designs are presented.