{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T16:12:14Z","timestamp":1657901534942},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p> In this paper, we define an \u03b1-almost (k; 2e + 1)-separable matrix and an \u03b1-almostk<jats:sup>e<\/jats:sup>-disjunct matrix. Using their complements, we devise algorithms for fault-tolerant trivial two-stage group tests (pooling designs) for k-complexes. We derive the expected values for the given algorithms to identify all such positive complexes. <\/jats:p>","DOI":"10.1142\/s1793830909000191","type":"journal-article","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:53:30Z","timestamp":1246535610000},"page":"235-251","source":"Crossref","is-referenced-by-count":4,"title":["ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES"],"prefix":"10.1142","volume":"01","author":[{"given":"WEIWEI","family":"LANG","sequence":"first","affiliation":[{"name":"Institute of Mathematics and Information Science, Hebei Normal University, Shijiazhuang, 050016, P. R. China"}]},{"given":"YUEXUAN","family":"WANG","sequence":"additional","affiliation":[{"name":"Institute for Theoretical Computer Science, Tsinghua University, Beijing, 100084, P. R. China"}]},{"given":"JAMES","family":"YU","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA"}]},{"given":"SUOGANG","family":"GAO","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Information Science, Hebei Normal University, Shijiazhuang, 050016, P. R. China"}]},{"given":"WEILI","family":"WU","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812773463"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32777-6_3"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000017386.09330.70"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.11.004"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.07.009"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00191-4"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00465-9"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01609879"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.02.006"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830909000191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:57:58Z","timestamp":1565193478000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830909000191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":10,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.1142\/S1793830909000191"],"URL":"https:\/\/doi.org\/10.1142\/s1793830909000191","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}