{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:11:07Z","timestamp":1676941867696},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,1,30]],"date-time":"2010-01-30T00:00:00Z","timestamp":1264809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10878-010-9291-0","type":"journal-article","created":{"date-parts":[[2010,1,29]],"date-time":"2010-01-29T19:39:05Z","timestamp":1264793945000},"page":"270-281","source":"Crossref","is-referenced-by-count":12,"title":["Reconstruction of hidden graphs and threshold group testing"],"prefix":"10.1007","volume":"22","author":[{"given":"Huilan","family":"Chang","sequence":"first","affiliation":[]},{"given":"Hong-Bin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Hung-Lin","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Chie-Huai","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,30]]},"reference":[{"key":"9291_CR1","volume-title":"Combinatorial search","author":"M Aigner","year":"1988","unstructured":"Aigner M (1988) Combinatorial search. Wiley, New York"},{"key":"9291_CR2","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S0895480103431071","volume":"18","author":"N Alon","year":"2005","unstructured":"Alon N, Asodi V (2005) Learning a hidden subgraph. SIAM J Discrete Math 18:697\u2013712","journal-title":"SIAM J Discrete Math"},{"key":"9291_CR3","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/S0097539702420139","volume":"33","author":"N Alon","year":"2004","unstructured":"Alon N, Beigel R Kasif S, Rudich S, Sudakov B (2004) Learning a hidden matching. SIAM J Comput 33:487\u2013501","journal-title":"SIAM J Comput"},{"key":"9291_CR4","volume-title":"Combinatorial designs: construction methods","author":"I Anderson","year":"1990","unstructured":"Anderson I (1990) Combinatorial designs: construction methods. Ellis Horwood, Chichester"},{"key":"9291_CR5","first-page":"2215","volume":"7","author":"D Angluin","year":"2006","unstructured":"Angluin D, Chen J (2006) Learning a hidden hypergraph. J Mach Learn Res 7:2215\u20132236","journal-title":"J Mach Learn Res"},{"key":"9291_CR6","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/j.jcss.2007.06.006","volume":"74","author":"D Angluin","year":"2008","unstructured":"Angluin D, Chen J (2008) Learning a hidden graph using O(log\u2009n) queries per edge. J Comput Syst Sci 74:546\u2013556","journal-title":"J Comput Syst Sci"},{"key":"9291_CR7","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/369133.369152","volume-title":"Proceedings 2001 RECOMB","author":"R Beigel","year":"2001","unstructured":"Beigel R, Alon N, Apaydin MS, Fortnow L, Kasif S (2001) An optimal procedure for gap closing in whole genome shotgun sequencing. In: Proceedings 2001 RECOMB. ACM, New York, pp 22\u201330"},{"key":"9291_CR8","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/11604686_2","volume":"3787","author":"M Bouvel","year":"2005","unstructured":"Bouvel M, Grebinski V, Kucherov G (2005) Combinatorial search on graphs motivated by bioinformatics applications: a brief survey. Lect Notes Comput Sci 3787:16\u201327","journal-title":"Lect Notes Comput Sci"},{"key":"9291_CR9","doi-asserted-by":"crossref","first-page":"1581","DOI":"10.1016\/j.dam.2008.06.003","volume":"157","author":"HB Chen","year":"2009","unstructured":"Chen HB, Fu HL (2009) Nonadaptive algorithms for threshold group testing. Discrete Appl Math 157:1581\u20131585","journal-title":"Discrete Appl Math"},{"key":"9291_CR10","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/11889342_45","volume":"4123","author":"P Damaschke","year":"2006","unstructured":"Damaschke P (2006) Threshold group testing. Lect Notes Comput Sci 4123:707\u2013718","journal-title":"Lect Notes Comput Sci"},{"key":"9291_CR11","volume-title":"Pooling designs and nonadaptive group testing\u2014important tools for DNA sequencing","author":"DZ Du","year":"2006","unstructured":"Du DZ, Hwang FK (2006) Pooling designs and nonadaptive group testing\u2014important tools for DNA sequencing. World Scientific, Singapore"},{"key":"9291_CR12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0166-218X(98)00070-5","volume":"88","author":"V Grebinski","year":"1998","unstructured":"Grebinski V, Kucherov G (1998) Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping. Discrete Appl Math 88:147\u2013165","journal-title":"Discrete Appl Math"},{"key":"9291_CR13","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/s004530010033","volume":"28","author":"V Grebinski","year":"2000","unstructured":"Grebinski V, Kucherov G (2000) Optimal reconstruction of graphs under the additive model. Algorithmica 28:104\u2013124","journal-title":"Algorithmica"},{"key":"9291_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.3792\/pja\/1195570997","volume":"28","author":"J Nagura","year":"1952","unstructured":"Nagura J (1952) On the interval containing at least one prime number. Proc Jpn Acad 28:177\u2013181","journal-title":"Proc Jpn Acad"},{"key":"9291_CR15","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1101\/gr.6.5.448","volume":"6","author":"A Sorokin","year":"1996","unstructured":"Sorokin A, Lapidus A, Capuano V, Galleron N, Pujic P, Ehrlich SD (1996) A new approach using multiplex long accurate PCR and yeast artificial chromosomes for bacterial chromosome mapping and sequencing. Genome Res 6:448\u2013453","journal-title":"Genome Res"},{"key":"9291_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01609879","volume":"3","author":"DC Torney","year":"1999","unstructured":"Torney DC (1999) Sets pooling designs. Ann Comb 3:95\u2013101","journal-title":"Ann Comb"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9291-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9291-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9291-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9291-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,30]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9291"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9291-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,30]]}}}