{"title":"基于CCCP的DNA文库筛选阳性检测算法","authors":"Hiroaki Uehara, Masakazu Jimbo","doi":"10.14490/JJSS.39.89","DOIUrl":null,"url":null,"abstract":"We describe an algorithm for extracting as much information as possible from pooling experiments for library screening based on the concave-convex procedure (CCCP). Called the CCCP pool result decoder (CCPD), it is a positive clone de- tecting algorithm. Its performance is compared, by simulation, with the Bayesian network pool result decoder (BNPD) proposed by Uehara and Jimbo and the Markov chain pool result decoder (MCPD) proposed by Knill et al. in 1996. To find a few positives among a large number of items, one can use group testing. In group testing, multiple items are assayed in groups. If a group has a negative outcome, all items contained in it are negative. This can reduce the total number of tests. On the other hand, if a group is positive, we know that the group contains at least one positive item. By designing many kinds of groups and by testing each of them, we obtain the results for all groups. After knowing the group results, we may be able to estimate which items are likely to be positive. For each of such items, we apply individual tests to determine whether it is positive or negative. Group testing has been used in medical, chemical, and electrical testing; drug screening; pollution control; multiaccess channel communication; and recently in gene assays like clone library screening, protein-protein interaction tests, and other subjects. See for example Du and Hwang (1999), Schliep and Rahmann (2006), Thierry-Mieg (2006), Klau et al. (2007), Thierry-Mieg and Bailly (2008). In this paper we restrict ourselves to group testing for DNA library screening to give a concrete image of testing and to consider a specialized problem in clone library screening. However, the algorithm given in this paper can be applied to any other fields of group testing. In DNA library screening experiments there are a large number of clones, which are short strings of nucleotides A, T, G and C. Through the use of high-quality gene libraries, the study of gene functions has been developed into a very important research field. The gene libraries are obtained from extensive testing and screening of DNA clones. For each clone,","PeriodicalId":326924,"journal":{"name":"Journal of the Japan Statistical Society. Japanese issue","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A POSITIVE DETECTING ALGORITHM FOR DNA LIBRARY SCREENING BASED ON CCCP\",\"authors\":\"Hiroaki Uehara, Masakazu Jimbo\",\"doi\":\"10.14490/JJSS.39.89\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe an algorithm for extracting as much information as possible from pooling experiments for library screening based on the concave-convex procedure (CCCP). Called the CCCP pool result decoder (CCPD), it is a positive clone de- tecting algorithm. Its performance is compared, by simulation, with the Bayesian network pool result decoder (BNPD) proposed by Uehara and Jimbo and the Markov chain pool result decoder (MCPD) proposed by Knill et al. in 1996. To find a few positives among a large number of items, one can use group testing. In group testing, multiple items are assayed in groups. If a group has a negative outcome, all items contained in it are negative. This can reduce the total number of tests. On the other hand, if a group is positive, we know that the group contains at least one positive item. By designing many kinds of groups and by testing each of them, we obtain the results for all groups. After knowing the group results, we may be able to estimate which items are likely to be positive. For each of such items, we apply individual tests to determine whether it is positive or negative. Group testing has been used in medical, chemical, and electrical testing; drug screening; pollution control; multiaccess channel communication; and recently in gene assays like clone library screening, protein-protein interaction tests, and other subjects. See for example Du and Hwang (1999), Schliep and Rahmann (2006), Thierry-Mieg (2006), Klau et al. (2007), Thierry-Mieg and Bailly (2008). In this paper we restrict ourselves to group testing for DNA library screening to give a concrete image of testing and to consider a specialized problem in clone library screening. However, the algorithm given in this paper can be applied to any other fields of group testing. In DNA library screening experiments there are a large number of clones, which are short strings of nucleotides A, T, G and C. Through the use of high-quality gene libraries, the study of gene functions has been developed into a very important research field. The gene libraries are obtained from extensive testing and screening of DNA clones. For each clone,\",\"PeriodicalId\":326924,\"journal\":{\"name\":\"Journal of the Japan Statistical Society. Japanese issue\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Japan Statistical Society. Japanese issue\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14490/JJSS.39.89\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Japan Statistical Society. Japanese issue","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14490/JJSS.39.89","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
我们描述了一种基于凹凸过程(CCCP)的从池化实验中提取尽可能多的信息用于图书馆筛选的算法。CCCP池结果解码器(CCPD)是一种正克隆检测算法。通过仿真,将其性能与Uehara和Jimbo提出的贝叶斯网络池结果解码器(BNPD)和Knill等人1996年提出的马尔可夫链池结果解码器(MCPD)进行了比较。为了在大量的项目中找到一些阳性的,可以使用群体测试。在分组测试中,多个项目被分组分析。如果一个组的结果是否定的,那么其中包含的所有项都是否定的。这可以减少测试的总数。另一方面,如果一个组是正的,我们知道这个组至少包含一个正的元素。通过设计多种组,并对每个组进行测试,得到了所有组的结果。在知道分组结果之后,我们可能能够估计哪些项目可能是积极的。对于每一个这样的项目,我们应用单独的测试来确定它是阳性还是阴性。在医疗、化学和电气测试中使用了分组测试;药物筛选;污染控制;多址信道通信;最近在基因分析,如克隆文库筛选,蛋白质-蛋白质相互作用测试,和其他科目。参见Du and Hwang (1999), Schliep and Rahmann (2006), Thierry-Mieg (2006), Klau et al. (2007), Thierry-Mieg and Bailly(2008)。本文将DNA文库筛选限定为群体检测,以给出具体的检测形象,并考虑克隆文库筛选中的一个专门问题。然而,本文给出的算法可以应用于群测试的任何其他领域。在DNA文库筛选实验中存在大量的克隆,这些克隆是核苷酸a、T、G和c的短链,通过使用高质量的基因库,基因功能的研究已经发展成为一个非常重要的研究领域。基因库是从DNA克隆的广泛测试和筛选中获得的。对于每一个克隆体,
A POSITIVE DETECTING ALGORITHM FOR DNA LIBRARY SCREENING BASED ON CCCP
We describe an algorithm for extracting as much information as possible from pooling experiments for library screening based on the concave-convex procedure (CCCP). Called the CCCP pool result decoder (CCPD), it is a positive clone de- tecting algorithm. Its performance is compared, by simulation, with the Bayesian network pool result decoder (BNPD) proposed by Uehara and Jimbo and the Markov chain pool result decoder (MCPD) proposed by Knill et al. in 1996. To find a few positives among a large number of items, one can use group testing. In group testing, multiple items are assayed in groups. If a group has a negative outcome, all items contained in it are negative. This can reduce the total number of tests. On the other hand, if a group is positive, we know that the group contains at least one positive item. By designing many kinds of groups and by testing each of them, we obtain the results for all groups. After knowing the group results, we may be able to estimate which items are likely to be positive. For each of such items, we apply individual tests to determine whether it is positive or negative. Group testing has been used in medical, chemical, and electrical testing; drug screening; pollution control; multiaccess channel communication; and recently in gene assays like clone library screening, protein-protein interaction tests, and other subjects. See for example Du and Hwang (1999), Schliep and Rahmann (2006), Thierry-Mieg (2006), Klau et al. (2007), Thierry-Mieg and Bailly (2008). In this paper we restrict ourselves to group testing for DNA library screening to give a concrete image of testing and to consider a specialized problem in clone library screening. However, the algorithm given in this paper can be applied to any other fields of group testing. In DNA library screening experiments there are a large number of clones, which are short strings of nucleotides A, T, G and C. Through the use of high-quality gene libraries, the study of gene functions has been developed into a very important research field. The gene libraries are obtained from extensive testing and screening of DNA clones. For each clone,