{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:31:19Z","timestamp":1753889479322},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642409349"},{"type":"electronic","value":"9783642409356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40935-6_14","type":"book-chapter","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T01:14:50Z","timestamp":1380244490000},"page":"188-202","source":"Crossref","is-referenced-by-count":6,"title":["Learning a Bounded-Degree Tree Using Separator Queries"],"prefix":"10.1007","author":[{"given":"M.","family":"Jagadish","sequence":"first","affiliation":[]},{"given":"Anindya","family":"Sen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. MIT Press (2009)"},{"key":"14_CR2","unstructured":"Federico, S.: A survey on independence-based Markov networks learning. Artificial Intelligence Review, 1\u201325 (2012)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Onak, K., Parys, P.: Generalization of binary search: Searching in trees and forest-like partial orders. In: 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006, pp. 379\u2013388. IEEE (2006)","DOI":"10.1109\/FOCS.2006.32"},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(89)90216-0","volume":"30","author":"J.C. Culberson","year":"1989","unstructured":"Culberson, J.C., Rudnicki, P.: A fast algorithm for constructing trees from distance matrices. Information Processing Letters\u00a030(4), 215\u2013220 (1989)","journal-title":"Information Processing Letters"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ipl.2006.08.013","volume":"101","author":"L. Reyzin","year":"2007","unstructured":"Reyzin, L., Srivastava, N.: On the longest path algorithm for reconstructing trees from distance matrices. Information Processing Letters\u00a0101(3), 98\u2013100 (2007)","journal-title":"Information Processing Letters"},{"issue":"5","key":"14_CR6","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF02459968","volume":"51","author":"J.J. Hein","year":"1989","unstructured":"Hein, J.J.: An optimal algorithm to reconstruct trees from additive distance data. Bulletin of Mathematical Biology\u00a051(5), 597\u2013603 (1989)","journal-title":"Bulletin of Mathematical Biology"},{"key":"14_CR7","unstructured":"King, V., Zhang, L., Zhou, Y.: On the complexity of distance-based evolutionary tree reconstruction. In: Proceedings of the fourteenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, pp. 444\u2013453 (2003)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"C.K. Chow","year":"1968","unstructured":"Chow, C.K., Liu, C.N.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory\u00a014, 462\u2013467 (1968)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR9","unstructured":"Karger, D., Srebro, N.: Learning Markov networks: Maximum bounded tree-width graphs. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 392\u2013401. Society for Industrial and Applied Mathematics (2001)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 177\u2013189 (1979)","DOI":"10.1137\/0136016"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40935-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T11:09:00Z","timestamp":1558091340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40935-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409349","9783642409356"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40935-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}