{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:29Z","timestamp":1725544769936},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_15","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"118-129","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets"],"prefix":"10.1007","author":[{"given":"Abdullah N.","family":"Arslan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1142\/S0129054104002303","volume":"15","author":"A.N. Arslan","year":"2004","unstructured":"Arslan, A.N., E\u011fecio\u011flu, \u00d6.: Dictionary look-up within small edit distance. Inter. J. of Found. of Comp. Sci.\u00a015(1), 57\u201371 (2004)","journal-title":"Inter. J. of Found. of Comp. Sci."},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-61258-0_6","volume-title":"Combinatorial Pattern Matching","author":"G.S. Brodal","year":"1996","unstructured":"Brodal, G.S., Gasieniec, L.: Approximate dictionary queries. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 65\u201374. Springer, Heidelberg (1996)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0020-0190(00)00079-X","volume":"75","author":"G.S. Brodal","year":"2000","unstructured":"Brodal, G.S., Velkatesh, S.: Improved bounds for dictionary look-up with one error. IPL\u00a075, 57\u201359 (2000)","journal-title":"IPL"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.-A., Lewenstein, N.: Dictionary matching and indexing with errors and don\u2019t cares. In: Proc. The 36th ACM STOC, pp. 91\u2013100 (2004)","DOI":"10.1145\/1007352.1007374"},{"key":"15_CR5","unstructured":"Dolev, D., Harari, Y., Linial, N., Nisan, N., Parnas, M.: Neighborhood preserving hashing and approximate queries. In: Proc. The Fifth ACM SODA (1994)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Dolev, D., Harari, Y., Parnas, M.: Finding the neighborhood of a query in a dictionary. In: Proc. The Second Israel Symp. on Theory of Comp. and Sys. (1993)","DOI":"10.1109\/ISTCS.1993.253486"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P. Elias","year":"1974","unstructured":"Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM\u00a021, 246\u2013260 (1974)","journal-title":"J. ACM"},{"key":"15_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-540-27801-6_36","volume-title":"Combinatorial Pattern Matching","author":"M.G. Maa\u00df","year":"2004","unstructured":"Maa\u00df, M.G.: Average-case analysis of approximate trie search. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 472\u2013483. Springer, Heidelberg (2004)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11496656_3","volume-title":"Combinatorial Pattern Matching","author":"M.G. Maa\u00df","year":"2005","unstructured":"Maa\u00df, M.G., Nowak, J.: Text indexing with errors. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 21\u201332. Springer, Heidelberg (2005)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0190(94)00032-8","volume":"50","author":"U. Manber","year":"1994","unstructured":"Manber, U., Wu, S.: An algorithm for approximate membership checking with applications to password security. IPL\u00a050, 191\u2013197 (1994)","journal-title":"IPL"},{"key":"15_CR12","volume-title":"Perceptrons","author":"M. Minsky","year":"1969","unstructured":"Minsky, M., Papert, S.: Perceptrons. MIT Press, Cambridge (1969)"},{"issue":"4","key":"15_CR13","first-page":"19","volume":"24","author":"G. Navarro","year":"2001","unstructured":"Navarro, G., Baeza-Yates, R., Sutinen, E., Tarhio, J.: Indexing Methods for Approximate String Matching. IEEE Data Engineering Bulletin\u00a024(4), 19\u201327 (2001)","journal-title":"IEEE Data Engineering Bulletin"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1109\/69.536247","volume":"8","author":"H. Shang","year":"1996","unstructured":"Shang, H., Merrett, T.H.: Tries for approximate string matching. IEEE Trans. Knowl. Data Eng.\u00a08(4), 540\u2013547 (1996)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E. Ukkonen","year":"1985","unstructured":"Ukkonen, E.: Algorithms for Approximate String Matching. Information and Control\u00a064, 100\u2013118 (1985)","journal-title":"Information and Control"},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1006\/jagm.1997.0875","volume":"25","author":"A.C. Yao","year":"1997","unstructured":"Yao, A.C., Yao, F.F.: Dictionary look-up with one error. J. of Algorithms\u00a025(1), 194\u2013202 (1997)","journal-title":"J. of Algorithms"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T20:18:44Z","timestamp":1555445924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11682462_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}