{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:29:41Z","timestamp":1725492581555},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662785"},{"type":"electronic","value":"9783540484523"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48452-3_17","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T01:55:40Z","timestamp":1191722140000},"page":"223-242","source":"Crossref","is-referenced-by-count":2,"title":["Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology"],"prefix":"10.1007","author":[{"given":"Carola","family":"Wenk","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,7,8]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1139\/x90-028","volume":"20","author":"P. C. Deusen Van","year":"1989","unstructured":"Paul C. Van Deusen. A dynamic program for cross-dating tree rings. Canadian Journal of Forest Research, 20:200\u2013205, 1989.","journal-title":"Canadian Journal of Forest Research"},{"key":"17_CR2","unstructured":"Douglas F. Elliott and K. Ramamohan Rao. Fast Transforms-Algorithms, Analyses, Applications. Academic Press, 1982."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Dan Gusfield. Algorithms on Strings, Trees and Sequences. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"17_CR4","first-page":"69","volume":"43","author":"R. L. Holmes","year":"1983","unstructured":"Richard L. Holmes. Computer-assisted quality control in tree-ring dating and measurement. Tree-Ring Bulletin, 43:69\u201375, 1983.","journal-title":"Tree-Ring Bulletin"},{"key":"17_CR5","unstructured":"Joseph B. Kruskal and David Sankoff. An anthology of algorithms and concepts for sequence comparison. In David Sankoff and Joseph B. Kruskal, editors, Time Warps, String Edits, and Mocromolecules: The Theory and Practice of Sequence Comparison, chapter 10. Addison-Wesley Publishing Company, 1983."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"H.J. Nussbaumer. Fast Fourier Transform and Convolution Algorithms. Springer Verlag, 1981.","DOI":"10.1007\/978-3-662-00551-4"},{"key":"17_CR7","unstructured":"William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. Numerical Recipes in C. Cambridge University Press, 2. edition, 1992."},{"key":"17_CR8","unstructured":"Frank Rinn. TSAP Reference Manual. Heidelberg. http:\/\/ourworld.compuserve.com\/homepages\/frankrinn\/ ."},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"ASSP-26","author":"H. Sakoe","year":"1978","unstructured":"Hiroaki Sakoe and Seibi Chiba. Dynamic programming algorithm optimization for spoken word recognition. IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-26(1):43\u201349, 1978.","journal-title":"IEEE Transactions on Acoustics, Speech, and Signal Processing"},{"key":"17_CR10","unstructured":"David Sankoff and Joseph B. Kruskal, editors. Time Warps, String Edits, and Mocromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley Publishing Company, 1983."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"F.H. Schweingruber. Trees and Wood in Dendrochronology. Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-77157-6"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Graham A. Stephen. String Searching Algorithms. World Scientific, 1994.","DOI":"10.1142\/9789814317368"},{"key":"17_CR13","unstructured":"Carola Wenk. Algorithmen f\u00fcr das Crossdating in der Dendrochronologie. Master\u2019s thesis, Freie Universit\u00e4t Berlin, Institut f\u00fcr Informatik, 1997."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48452-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:42:16Z","timestamp":1556898136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48452-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662785","9783540484523"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48452-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}