{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:20:32Z","timestamp":1762100432226},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_2","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"16-27","source":"Crossref","is-referenced-by-count":29,"title":["Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey"],"prefix":"10.1007","author":[{"given":"Mathilde","family":"Bouvel","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Grebinski","sequence":"additional","affiliation":[]},{"given":"Gregory","family":"Kucherov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","volume-title":"Combinatorial Search","author":"M. Aigner","year":"1988","unstructured":"Aigner, M.: Combinatorial Search. John Wiley and Sons, Chichester (1988)"},{"key":"2_CR2","unstructured":"Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., Walter, P.: Molecular Biology of the Cell. Garland Science (1994)"},{"key":"2_CR3","unstructured":"Alon, N.: Separating matrices. Private communication (May 1997)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-27836-8_12","volume-title":"Automata, Languages and Programming","author":"N. Alon","year":"2004","unstructured":"Alon, N., Asodi, V.: Learning a hidden subgraph. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 110\u2013121. Springer, Heidelberg (2004)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1109\/SFCS.2002.1181943","volume-title":"Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2002","author":"N. Alon","year":"2002","unstructured":"Alon, N., Beigel, R., Kasif, S., Rudich, S., Sudakov, B.: Learning a hidden matching. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2002, Vancouver, BC, Canada, 16\u201319 November, pp. 197\u2013206. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"42","DOI":"10.4153\/CJM-1966-007-2","volume":"18","author":"D.G. Cantor","year":"1966","unstructured":"Cantor, D.G., Mills, W.H.: Determination of a subset from certain combinatorial properties. Can. J. Math.\u00a018, 42\u201348 (1966)","journal-title":"Can. J. Math."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1007\/11428848_130","volume-title":"Computational Science \u2013 ICCS 2005","author":"F. Cicalese","year":"2005","unstructured":"Cicalese, F., Damaschke, P., Vaccaro, U.: Optimal group testing algorithms with interval queries and their application to splice site detection. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol.\u00a03515, pp. 1029\u20131037. Springer, Heidelberg (2005)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Du, D., Hwang, F.: Combinatorial group testing and its applications. Series on applied Mathematics, vol.\u00a03 (1993)","DOI":"10.1142\/1936"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01895716","volume":"14","author":"P. Erd\u00f6s","year":"1963","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: Asymmetric graphs. Acta Math. Acad. Sci. Hung. Acad. Sci.\u00a014, 295\u2013315 (1963)","journal-title":"Acta Math. Acad. Sci. Hung. Acad. Sci."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-68535-9_23","volume-title":"Computing and Combinatorics","author":"V. Grebinski","year":"1998","unstructured":"Grebinski, V.: On the power of additive combinatorial search model. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol.\u00a01449, pp. 194\u2013203. Springer, Heidelberg (1998)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0166-218X(98)00070-5","volume":"88","author":"V. Grebinski","year":"1998","unstructured":"Grebinski, V., Kucherov, G.: Reconstructing a hamiltonian cycle by querying the graph: Application to DNA physical mapping. Discrete Applied Mathematics\u00a088, 147\u2013165 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR12","first-page":"915","volume-title":"Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999","author":"V. Grebinski","year":"1999","unstructured":"Grebinski, V., Kucherov, G.: Reconstructing set partitions. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, Baltimore, Maryland, January 17-19, pp. 915\u2013916. ACM, SIAM, New York (1999)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s004530010033","volume":"28","author":"V. Grebinski","year":"2000","unstructured":"Grebinski, V., Kucherov, G.: Optimal reconstruction of graphs under the additive model. Algorithmica\u00a028, 104\u2013124 (2000)","journal-title":"Algorithmica"},{"issue":"suppl. 1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1093\/bioinformatics\/bth936","volume":"20","author":"G.W. Klau","year":"2004","unstructured":"Klau, G.W., Rahmann, S., Schliep, A., Vingron, M., Reinert, K.: Optimal robust non-unique probe selection using integer linear programming. Bioinformatics\u00a020 (suppl. 1), i186\u2013i193 (2004)","journal-title":"Bioinformatics"},{"key":"2_CR15","unstructured":"Knill, E., Muthukrishnan, S.: Group testing problems in experimental molecular biology. Technical Report LAUR-95-1503, Los Alamos National Laboratory (March 1995)"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(94)90064-7","volume":"66","author":"M. Li","year":"1994","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: Kolmogorov complexity arguments in combinatorics. J. Comb.\u00a0Theory Series A\u00a066(2), 226\u2013236 (1994)","journal-title":"J. Comb.\u00a0Theory Series A"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"477","DOI":"10.4153\/CMB-1965-034-2","volume":"8","author":"B. Lindstr\u00f6m","year":"1965","unstructured":"Lindstr\u00f6m, B.: On a combinatorial problem in number theory. Canad. Math. Bull.\u00a08, 477\u2013490 (1965)","journal-title":"Canad. Math. Bull."},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/S0021-9800(69)80038-4","volume":"6","author":"B. Lindstr\u00f6m","year":"1969","unstructured":"Lindstr\u00f6m, B.: Determination of two vectors from the sum. J. Comb.\u00a0Theory\u00a06, 402\u2013407 (1969)","journal-title":"J. Comb.\u00a0Theory"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"513","DOI":"10.4153\/CMB-1971-092-9","volume":"14","author":"B. Lindstr\u00f6m","year":"1971","unstructured":"Lindstr\u00f6m, B.: On M\u00f6bius functions and a problem in combinatorial number theory. Canad. Math. Bull.\u00a014(4), 513\u2013516 (1971)","journal-title":"Canad. Math. Bull."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0022-314X(72)90052-2","volume":"4","author":"B. Lindstr\u00f6m","year":"1972","unstructured":"Lindstr\u00f6m, B.: On b 2 sequences of vectors. Journal of Number Theory\u00a04, 261\u2013265 (1972)","journal-title":"Journal of Number Theory"},{"key":"2_CR21","first-page":"407","volume-title":"A Survey of Statistical Designs and Linear Models","author":"B. Lindstr\u00f6m","year":"1975","unstructured":"Lindstr\u00f6m, B.: Determining subsets by unramified experiments. In: Srivastava, J.N. (ed.) A Survey of Statistical Designs and Linear Models, pp. 407\u2013418. North Holland, Amsterdam (1975)"},{"key":"2_CR22","unstructured":"Wilson, R.M.: Decomposition of complete graphs into subgraphs isomorphic to a given graph. In: Congressus Numerantium XV, pp. 647\u2013659 (1975)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:20Z","timestamp":1619507060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11604686_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}