{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:04:46Z","timestamp":1743123886711,"version":"3.40.3"},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131856"},{"type":"electronic","value":"9783319131863"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13186-3_45","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T20:09:58Z","timestamp":1417464598000},"page":"504-510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Size of the Zero-Suppressed Binary Decision Diagram that Represents All the Subtrees in a Tree"],"prefix":"10.1007","author":[{"given":"Norihito","family":"Yasuda","sequence":"first","affiliation":[]},{"given":"Masaaki","family":"Nishino","sequence":"additional","affiliation":[]},{"given":"Shin-ichi","family":"Minato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,26]]},"reference":[{"issue":"8","key":"45_CR1","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"100","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 100(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"45_CR2","series-title":"Combinatorial Algorithms Part 1","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"2011","unstructured":"Knuth, D.E.: The Art of Computer Programming. Combinatorial Algorithms Part 1, vol. 4A. Addison-Wesley, Upper Saddle River (2011)"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BFb0015427","volume-title":"Algorithms and Computations","author":"K Sekine","year":"1995","unstructured":"Sekine, K., Imai, H., Tani, S.: Computing the tutte polynomial of a graph of moderate size. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 224\u2013233. Springer, Heidelberg (1995)"},{"issue":"4","key":"45_CR4","first-page":"682","volume":"80","author":"K Sekine","year":"1997","unstructured":"Sekine, K.: Counting the number of paths in a graph via bdds. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 80(4), 682\u2013688 (1997)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Gagie, T., Hermelin, D., Landau, G.M., Weimann, O.: Binary jumbled pattern matching on trees and tree-like structures. arXiv preprint arXiv:1301.6127 (2013)","DOI":"10.1007\/978-3-642-40450-4_44"}],"container-title":["Lecture Notes in Computer Science","Trends and Applications in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13186-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T01:37:17Z","timestamp":1674178637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13186-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131856","9783319131863"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13186-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"26 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}