{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:40:10Z","timestamp":1736084410712,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540605737"},{"type":"electronic","value":"9783540477662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0015431","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:50:06Z","timestamp":1131864606000},"page":"264-273","source":"Crossref","is-referenced-by-count":0,"title":["Fast approximate dictionary matching"],"prefix":"10.1007","author":[{"given":"Fei","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"No.6","key":"30_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"A. V. Aho and M. Corasick, Efficient string matching: an aid to bibliographic search. Communications of the ACM, June 1975, Vol. 18, No. 6, pp. 333\u2013340","journal-title":"Communications of the ACM"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"A. Amir and M. Farach, Adaptive dictionary matching. Proc. of the 32nd IEEE Annual Symposium on Foundation of Computer Science, 1991, pp. 760\u2013766","DOI":"10.1109\/SFCS.1991.185445"},{"key":"30_CR3","unstructured":"A. Amir, M. Farach, R. Indury, J. A. Poutre and A. Schaeffer, Improved dynamic dictionary matching, Proc. of the fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 392\u2013400"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Amir, M. Farach and Y. Matias, efficient randomized dictionary matching algorithms. Proc. of the 3rd Ann. Symp. on Combinatorial Pattern Matching, 1992","DOI":"10.1007\/3-540-56024-6_21"},{"key":"30_CR5","unstructured":"E. Bugnion, T. Roos, F. Shi, P. Widmayer and F. Widmer, Approximate multiple string matching using spatial indexes. in Proc. of the 1st South American Workshop on String Processing, (eds.) R. Baeza-Yates and N. Ziviani, pp. 43\u201353, 1993"},{"issue":"3","key":"30_CR6","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. L. Fredman","year":"1984","unstructured":"M. L. Fredman, J. Komlos and E. Szemeredi, Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31, 3(1984), 538\u2013544","journal-title":"Journal of the ACM"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"R. Indury and A. Schaeffer, Dynamic dictionary matching with failure functions. in Proc. of the 3rd Annual Symposium on Combinatorial Pattern Matching, 1992","DOI":"10.1007\/3-540-56024-6_22"},{"key":"30_CR8","unstructured":"T. Kohonen and E. Reuhkala, A very fast associative method for the recognition and correction of misspellt words, based on redundant hash-addressing. Proc. 4th Joint Conf. on Pattern Recognition, 1978, Kyoto, Japan, 807\u2013809"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"G. M. Landau and U. Vishkin, in Proc. 18th ACM Symposium on Theory of Computing, 1986, pp. 220\u2013250","DOI":"10.1145\/12130.12152"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"H. Noltmeier, K. Verbarg and C. Zirkelbach, Monotonous bisector* trees \u2014 a tool for efficient partitioning of complex scenes of geometric objects. In Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint Initiative Vol. 594 of L.N.C., Spring-Verlag, 1992","DOI":"10.1007\/3-540-55488-2_27"},{"issue":"4","key":"30_CR11","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1002\/spe.4380180407","volume":"18","author":"O. Owolabi","year":"1988","unstructured":"O. Owolabi and D. R. McGregor: Fast approximate string matching. Software \u2014 Practice and Experience 18(4) (1988), 387\u2013393","journal-title":"Software \u2014 Practice and Experience"},{"key":"30_CR12","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C. E. Shannon","year":"1948","unstructured":"C. E. Shannon, A mathematical theory of communications. The Bell Systems Techn. Journal 27 (1948), 379\u2013423","journal-title":"The Bell Systems Techn. Journal"},{"key":"30_CR13","volume-title":"Approximate string matching with q-grams and maximal matches. Report","author":"E. Ukkonen","year":"1991","unstructured":"E. Ukkonen, Approximate string matching with q-grams and maximal matches. Report, Department of Computer Science, University of Helsinki, Finland, 1991"},{"key":"30_CR14","volume-title":"Diploma Thesis","author":"K. Verbarg","year":"1992","unstructured":"K. Verbarg, R\u00e4umliche Indizes-Celltrees: Analyse und Vergleich mit Monotonen Bisektorb\u00e4umen, Diploma Thesis, Department of Computer Science, University of W\u00fcrzburg, Germany, 1992"},{"issue":"No.1","key":"30_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/321921.321923","volume":"23","author":"C. K. Wong","year":"1976","unstructured":"C. K. Wong and A. K. Chandra, Bounds for the string editing problem. Journal of the ACM, vol.23, No.1, January 1976, pp. 13\u201316","journal-title":"Journal of the ACM"},{"key":"30_CR16","volume-title":"Monotonous bisector trees and clustering problems, Report","author":"C. Zirkelbach","year":"1990","unstructured":"C. Zirkelbach, Monotonous bisector trees and clustering problems, Report, Department of Computer Science, University of W\u00fcrzburg, Germany, 1990"},{"key":"30_CR17","volume-title":"Dissertation","author":"C. Zirkelbach","year":"1992","unstructured":"C. Zirkelbach, Geometrisches Clustern \u2014 ein metrischer Ansatz, Dissertation, Department of Computer Science, University of W\u00fcrzburg, Germany, 1992"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:04:37Z","timestamp":1736082277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540605737","9783540477662"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0015431","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}