{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:05:44Z","timestamp":1761743144355},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853626"},{"type":"electronic","value":"9783540853633"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85363-3_28","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T15:29:28Z","timestamp":1219850968000},"page":"343-356","source":"Crossref","is-referenced-by-count":31,"title":["Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms"],"prefix":"10.1007","author":[{"given":"Guy","family":"Bresler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elchanan","family":"Mossel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allan","family":"Sly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"IT-14","author":"C.K. Chow","year":"1968","unstructured":"Chow, C.K., Liu, C.N.: Approximating discrete probability distributions with dependence trees. IEEE Trans. Info. Theory\u00a0IT-14, 462\u2013467 (1968)","journal-title":"IEEE Trans. Info. Theory"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Chickering, D.: Learning Bayesian networks is NP-complete. In: Proceedings of AI and Statistics (1995)","DOI":"10.1007\/978-1-4612-2404-4_12"},{"key":"28_CR3","first-page":"1743","volume":"7","author":"P. Abbeel","year":"2006","unstructured":"Abbeel, P., Koller, D., Ng, A.: Learning factor graphs in polynomial time and sample complexity. Journal of Machine Learning Research\u00a07, 1743\u20131788 (2006)","journal-title":"Journal of Machine Learning Research"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Santhanam, N., Wainwright, M.J.: Information-theoretic limits of graphical model selection in high dimensions (submitted, January 2008)","DOI":"10.1109\/ISIT.2008.4595367"},{"key":"28_CR5","unstructured":"Wainwright, M.J., Ravikumar, P., Lafferty, J.D.: High-dimensional graphical model selection using \u21131-regularized logistic regression. In: NIPS 2006, Vancouver, BC, Canada (2006)"},{"key":"28_CR6","unstructured":"Baldassi, C., Braunstein, A., Brunel, N., Zecchina, R.: Efficient supervised learning in networks with binary synapses; arXiv:0707.1295v1"},{"key":"28_CR7","unstructured":"Mahmoudi, H., Pagnani, A., Weigt, M., Zecchina, R.: Propagation of external and asynchronous dynamics in random Boolean networks; arXiv:0704.3406v1"},{"key":"28_CR8","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-1-4899-6653-7_21","volume-title":"Statistical mechanics and dynamical systems","author":"R.L. Dobrushin","year":"1985","unstructured":"Dobrushin, R.L., Shlosman, S.B.: Completely analytical Gibbs fields. In: Fritz, J., Jaffe, A., Szasz, D. (eds.) Statistical mechanics and dynamical systems, pp. 371\u2013403. Birkhauser, Boston (1985)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Friedman, N.: Infering cellular networks using probalistic graphical models. In: Science (February 2004)","DOI":"10.1126\/science.1094068"},{"key":"28_CR10","unstructured":"Kasif, S.: Bayes networks and graphical models in computational molecular biology and bioinformatics, survey of recent research (2007), http:\/\/genomics10.bu.edu\/bioinformatics\/kasif\/bayes-net.html"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/1132516.1132540","volume-title":"STOC 2006: Proceedings of the 38th Annual ACM Symposium on Theory of Computing","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Mossel, E., Roch, S.: Optimal phylogenetic reconstruction. In: STOC 2006: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 159\u2013168. ACM, New York (2006)"},{"issue":"2","key":"28_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/(SICI)1098-2418(199903)14:2<153::AID-RSA3>3.0.CO;2-R","volume":"14","author":"P.L. Erd\u00f6s","year":"1999","unstructured":"Erd\u00f6s, P.L., Steel, M.A., Sz\u00e9kely, L.A., Warnow, T.A.: A few logs suffice to build (almost) all trees (part 1). Random Struct. Algor.\u00a014(2), 153\u2013184 (1999)","journal-title":"Random Struct. Algor."},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TCBB.2007.1010","volume":"4","author":"E. Mossel","year":"2007","unstructured":"Mossel, E.: Distorted metrics on trees and phylogenetic forests. IEEE\/ACM Trans. Comput. Bio. Bioinform.\u00a04(1), 108\u2013116 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Bio. Bioinform."},{"key":"28_CR14","unstructured":"Bresler, G., Mossel, E., Sly, A.: Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms; arXiv:0712.1402v1"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85363-3_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:24:18Z","timestamp":1606166658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85363-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540853626","9783540853633"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85363-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}