{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:30:30Z","timestamp":1725456630516},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647393"},{"type":"electronic","value":"9783540690542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0030781","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T02:49:24Z","timestamp":1133405364000},"page":"65-79","source":"Crossref","is-referenced-by-count":1,"title":["Approximate word sequence matching over Sparse Suffix Trees"],"prefix":"10.1007","author":[{"given":"Knut Magne","family":"Risvik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Cobbs A. L. (1995) \u201cFast Approximate Matching using Suffix Trees,\u201d In Proceedings of Sixth Symposium on Combinatorial Pattern Matching (CPM'95) Springer Verlag, pp. 41\u201354.","DOI":"10.1007\/3-540-60044-2_33"},{"key":"5_CR2","unstructured":"Gonnet G.H, Baeza-Yates R.A., Snider T. (1991) \u201cLexicographical indices for text: Inverted files vs. PAT trees.,\u201d Technical Report OED-91-10, Center for the new OED, University of Waterloo."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen J., Ukkonen E. \u201cSparse Suffix Trees\u201c In Proceedings of the Second Annual International Computing and Combinatorias Conference (COCOON 96), Springer Verlag, pp. 219\u2013230.","DOI":"10.1007\/3-540-61332-3_155"},{"issue":"4","key":"5_CR4","first-page":"845","volume":"163","author":"V.I. Levenstein","year":"1965","unstructured":"Levenstein, V.I. (1965) \u201cBinary codes capable of correcting deletions, insertions, and reversals,\u201d (Russian) Doklady Akademii nauk SSSR, Vol. 163, No. 4, p. 845\u20138 (also Cybernetics and Control Theory, Vol. 10, No. 8, p. 707\u201310, 1966).","journal-title":"Doklady Akademii nauk SSSR"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.R. Morrison","year":"1968","unstructured":"Morrison D.R. (1968) \u201cPATRICIA \u2014 Practical Algorithm To Retrieve Information Coded in Alphanumeric,\u201d Journal of the ACM, 15, pp. 514\u2013534.","journal-title":"Journal of the ACM"},{"issue":"4","key":"5_CR6","first-page":"540","volume":"5","author":"H. Sbang","year":"1996","unstructured":"Sbang H., Merrettal T.H. (1996) \u201cTries for Approximate String Matching,\u201d IEEE Transactions on Knowledge and Data Engineering, Vol 5, No. 4, p. 540\u2013547.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Ukkonen E. (1985) \u201cFinding Approximate Patterns in Strings,\u201d Journal of Algorithms, vol. 6, pp. 132\u2013137.","DOI":"10.1016\/0196-6774(85)90023-9"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Weiner P. (1973) \u201cLinear pattern matching algorithms,\u201d In Proceedings of the IEEE 14th Annual Symposium on Switching and Automata Theory, pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T11:37:23Z","timestamp":1554723443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030781"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647393","9783540690542"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0030781","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}