{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T09:19:35Z","timestamp":1773825575836,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540580942","type":"print"},{"value":"9783540484509","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58094-8_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:12:13Z","timestamp":1330251133000},"page":"198-212","source":"Crossref","is-referenced-by-count":73,"title":["Proximity matching using fixed-queries trees"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Baeza-Yates","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Cunto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Manber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"15","author":"S.F. Altschul","year":"1990","unstructured":"Altschul S.F., W. Gish, W. Miller, E. W. Myers, and D. J. Lipman, \u201cBasic local alignment search tool,\u201d J. Molecular Biology 15 (1990), 403\u2013410.","journal-title":"J. Molecular Biology"},{"issue":"5","key":"18_CR2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF01193577","volume":"29","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A. and Cunto, W., \u201cUnbalanced Multiway Trees Improved by Partial Expansions\u201d, Acta Information, 29 (5), 1992, 443\u2013460.","journal-title":"Acta Information"},{"key":"18_CR3","unstructured":"Baeza-Yates, R.A. and Gonnet, G.H., \u201cAll-against-all Sequence Matching\u201d, Dept. of Computer Science, Universidad de Chile, 1990."},{"key":"18_CR4","unstructured":"Bahl L. R., P. S. Gopalakrishnan, D. S. Kanevsky, and D.S. Nahamoo, \u201cA fast admissible method for identifying a short list of candidate words,\u201d IBM tech report RC 15874 (June 1990)."},{"key":"18_CR5","unstructured":"Bugnion, E. and Roos, T. and Shi, F. and Widmayer, P. and Widmer, F. \u201cA Spatial Index for Approximate Multiple String Matching\u201d, 1st South American Workshop on String Processing, Belo Horizonte, Sept 1993, 43\u201354."},{"issue":"4","key":"18_CR6","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"W.A. Burkhard","year":"1973","unstructured":"Burkhard, W.A. and Keller, R.M. \u201cSome Approaches to Best-Match File Searching\u201d, Communications of the ACM 16 (4), April 1973, 230\u2013236.","journal-title":"Communications of the ACM"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Chang W.L., and E.L. Lawler, \u201cApproximate matching in sublinear expected time,\u201d Proc. of the 31st IEEE Symp. on Foundations of Computer Science (1990) 116\u2013124.","DOI":"10.1109\/FSCS.1990.89530"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Friedman, J.H. and Bentley, J.L. and Finkel, R.A. \u201cAn Algorithm to find best matches in logarithmic expected time\u201d, ACM Trans. on Math. Software 3(3), 1977.","DOI":"10.1145\/355744.355745"},{"key":"18_CR9","unstructured":"Gonnet, G.H. and Baeza-Yates, R. Handbook of Algorithms and Data Structures, Addison-Wesley, second edition, 1991."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Gonnet, G.H., M.A. Cohen, and S.A. Benner, \u201cExhaustive matching of the entire protein sequence database,\u201d Science 256, 1443.","DOI":"10.1126\/science.1604319"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1126\/science.2983426","volume":"227","author":"D. J. Lipman","year":"1985","unstructured":"Lipman D. J., and W.R. Pearson, \u201cRapid and sensitive protein similarity searches,\u201d Science 227 (1985), 1435\u20131441.","journal-title":"Science"},{"key":"18_CR12","volume-title":"Evolution of Random Search Trees","author":"H. Mahmoud","year":"1992","unstructured":"Mahmoud, H. Evolution of Random Search Trees, John Wiley, New York, 1992."},{"issue":"4","key":"18_CR13","first-page":"354","volume":"26","author":"F. Murtagh","year":"1983","unstructured":"Murtagh, F. \u201cA Survey of Recent Advances in Hierarchical Clustering Algorithms\u201d, IEEE Computer 26 (4), 1983, 354\u2013359.","journal-title":"IEEE Computer"},{"key":"18_CR14","unstructured":"Myers, E. \u201cAlgorithmic Advances for Searching Biosequence Databases,\u201d Proceedings of the International Symposium on Computational Methods in Genome Research (Heidelberg, 1992), to appear."},{"key":"18_CR15","unstructured":"Myers, E. \u201cA Sublinear Algorithm for Approximate Keyword Matching,\u201d Algorithmica, in press."},{"key":"18_CR16","first-page":"277","volume":"5","author":"O. Nevalainen","year":"1982","unstructured":"Nevalainen, O. and Katajainen, J. \u201cExperiments with a Closest Point Algorithm in Hamming Space\u201d, Angewandte Informatik 5, 1982, 277\u2013281.","journal-title":"Angewandte Informatik"},{"key":"18_CR17","unstructured":"Santana, O. and Diaz, M. and Duque, J.D. and Rodriguez, J.C. \u201cIncreasing radius search schemes for the most similar strings on the Burkhard-Keller tree\u201d, International Workshop on Computer Aided Systems Theory, EUROCAST'89, 1989."},{"issue":"5","key":"18_CR18","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/359581.359599","volume":"20","author":"M. Shapiro","year":"1977","unstructured":"Shapiro, M. \u201cThe Choice of Reference Points in Best-Match File Searching\u201d, Communications of the ACM 20 (5), May 1977, 339\u2013343.","journal-title":"Communications of the ACM"},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/96105.96111","volume":"8","author":"D. Shasha","year":"1990","unstructured":"Shasha, D. and Wang, T-L. \u201cNew Techniques for Best-Match Retrieval\u201d, ACM Transactions on Information Systems 8, 1990, 140\u2013158.","journal-title":"ACM Transactions on Information Systems"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Ukkonen, E., \u201cApproximate string matching with q-grams and maximal matches,\u201d Theoretical Computer Science (1992), 191\u2013212.","DOI":"10.1016\/0304-3975(92)90143-4"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Ukkonen, E., \u201cApproximate string-matching over suffix trees,\u201d 4th Annual Combinatorial Pattern Matching Symp., Padova, Italy (June 1993), 228\u2013242.","DOI":"10.1007\/BFb0029808"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58094-8_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:16:55Z","timestamp":1605629815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58094-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580942","9783540484509"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-58094-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}