{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:47:35Z","timestamp":1725565655580},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540224181"},{"type":"electronic","value":"9783540277729"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27772-9_27","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T21:37:11Z","timestamp":1284586631000},"page":"259-267","source":"Crossref","is-referenced-by-count":4,"title":["Fast Approximate Search in Text Databases"],"prefix":"10.1007","author":[{"given":"Fei","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321921.321922","volume":"23","author":"A.V. Aho","year":"1976","unstructured":"Aho, A.V., Hirschberg, D.S., Ullman, J.D.: Bounds on the Complexity of the Longest Common Subsequence Problem. Journal of the ACM\u00a023(1), 1\u201312 (1976)","journal-title":"Journal of the ACM"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Data Structures and Efficient Algorithms","author":"H. Noltmeier","year":"1992","unstructured":"Noltmeier, H., Verbarg, K., Zirkelbach, C.: Monotonous bisector* trees - a tool for efficient partitioning of complex scenes of geometric objects. In: Monien, B., Ottmann, T. (eds.) Data Structures and Efficient Algorithms. LNCS, vol.\u00a0594, Springer, Heidelberg (1992)"},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1002\/spe.4380180407","volume":"18","author":"O. Owolabi","year":"1988","unstructured":"Owolabi, O., McGregor, D.R.: Fast approximate string matching. Software - Practice and Experience\u00a018(4), 387\u2013393 (1988)","journal-title":"Software - Practice and Experience"},{"key":"27_CR4","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":"Shannon, C.E.: A mathematical theory of communications. The Bell Systems Techn. Journal\u00a027, 379\u2013423 (1948)","journal-title":"The Bell Systems Techn. Journal"},{"volume-title":"TimeWarps, String Edits, And Macromolecules: The Theory And Practice Of Sequence Comparison","year":"1983","key":"27_CR5","unstructured":"Sankoff, D., Kruskal, J.B. (eds.): TimeWarps, String Edits, And Macromolecules: The Theory And Practice Of Sequence Comparison. Addison-Wesley Publishing Company, Inc, Reading (1983)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-60313-1_153","volume-title":"Algorithms - ESA \u201995","author":"E. Sutinen","year":"1995","unstructured":"Sutinen, E., Tarhio, J.: On Using q-gram Locations in Approximate String Matching. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 327\u2013340. Springer, Heidelberg (1995)"},{"key":"27_CR7","first-page":"347","volume":"13","author":"W.M. Shaw","year":"1991","unstructured":"Shaw, W.M., Wood, J.B., Wood, R.E., Tibbo, H.R.: The Cystic Fibrosis Database: Content and Research Opportunities. Library and Information Science Research\u00a013, 347\u2013366 (1991)","journal-title":"Library and Information Science Research"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Approximate string matching with q-grams and maximal matches. Theoretical computer Science\u00a092, 191\u2013211 (1992)","journal-title":"Theoretical computer Science"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/321921.321923","volume":"23","author":"C.K. Wong","year":"1976","unstructured":"Wong, C.K., Chandra, A.K.: Bounds for the string editing problem. Journal of the ACM\u00a023(1), 13\u201316 (1976)","journal-title":"Journal of the ACM"},{"key":"27_CR10","unstructured":"Zirkelbach, C.: Monotonous bisector trees and clustering problems, Report, Department of Computer Science, University ofW\u00fcrzburg, Germany (1990)"},{"key":"27_CR11","unstructured":"Zirkelbach, C.: Geometrisches Clustern - ein metrischer Ansatz, Dissertation, Department of Computer Science, University of W\u00fcrzburg, Germany (1992)"}],"container-title":["Lecture Notes in Computer Science","Advances in Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27772-9_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:23:55Z","timestamp":1620012235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27772-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540224181","9783540277729"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27772-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}