{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:08:38Z","timestamp":1648829318480},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3760,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0304-3975(02)00484-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"387-412","source":"Crossref","is-referenced-by-count":2,"title":["Approximate pattern matching and transitive closure logics"],"prefix":"10.1016","volume":"299","author":[{"given":"Kjell","family":"Lemstr\u00f6m","sequence":"first","affiliation":[]},{"given":"Lauri","family":"Hella","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00484-X_BIB1","unstructured":"A. Brazma, I. Jonassen, E. Ukkonen, J. Vilo, Discovering patterns and subfamilies in biosequences, in: Proc. 4th Internat. Conf. on Intelligent Systems for Molecular Biology, ISMB \u201996, AAAI Press, 1996, pp. 34\u201343."},{"key":"10.1016\/S0304-3975(02)00484-X_BIB2","series-title":"Text Algorithms","author":"Crochemore","year":"1994"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB3","series-title":"The Third Manifesto","author":"Date","year":"1998"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB4","series-title":"Finite Model Theory","author":"Ebbinghaus","year":"1997"},{"issue":"1","key":"10.1016\/S0304-3975(02)00484-X_BIB5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/309844.310075","article-title":"SQL:1999, formerly known as SQL3","volume":"28","author":"Eisenberg","year":"1999","journal-title":"SIGMOD Record"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB6","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jcss.1997.1485","article-title":"Counting quantifiers, successor relations, and logarithmic space","volume":"54","author":"Etessami","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00484-X_BIB7","doi-asserted-by":"crossref","unstructured":"G. Grahne, M. Nyk\u00e4nen, E. Ukkonen, Reasoning about strings in databases, in: Proc. 13th ACM SIGACT-SIGMOD-SIGART symp. on Principles of database systems (PODS\u201994), 1994, pp. 303\u2013312.","DOI":"10.1145\/182591.182656"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB8","series-title":"Algorithms on Strings, Trees, and Sequences","author":"Gusfield","year":"1997"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB9","series-title":"Descriptive Complexity","author":"Immerman","year":"1999"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","article-title":"Fast string matching with k differences","volume":"37","author":"Landau","year":"1988","journal-title":"J. Comput. Systems"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB11","unstructured":"K. Lemstr\u00f6m, String matching techniques for music retrieval, Ph.D. Thesis, University of Helsinki, Department of Computer Science, 2000, Report A-2000-4."},{"key":"10.1016\/S0304-3975(02)00484-X_BIB12","doi-asserted-by":"crossref","unstructured":"K. Lemstr\u00f6m, L. Hella, Approximate pattern matching is expressible in transitive closure logic, in: Proc. 15th Ann. Symp. on Logic in Computer Science (LICS\u20192000), Santa Barbara, CA, June 2000, pp. 157\u2013167.","DOI":"10.1109\/LICS.2000.855764"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB13","unstructured":"K. Lemstr\u00f6m, E. Ukkonen, Including interval encoding into edit distance based music comparison and retrieval, in: Proc. AISB\u20192000 Symp. on Creative & Cultural Aspects and Applications of AI & Cognitive Science, Birmingham, April 2000, pp. 53\u201360."},{"key":"10.1016\/S0304-3975(02)00484-X_BIB14","unstructured":"MIDI Manufacturers Association, Los Angeles, CA, The Complete Detailed MIDI 1.0 Specification, 1996."},{"key":"10.1016\/S0304-3975(02)00484-X_BIB15","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/316542.316550","article-title":"A fast bit-vector algorithm for approximate string matching based on dynamic programming","volume":"46","author":"Myers","year":"1999","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB16","unstructured":"M. Nyk\u00e4nen, Querying string databases with modal logic, Ph.D. Thesis, University of Helsinki, Department of Computer Science, 1997, Report A-1997-3."},{"key":"10.1016\/S0304-3975(02)00484-X_BIB17","unstructured":"E.G.M. Petrakis, Image representation, indexing and retrieval based on spatial relationships and properties of objects, Ph.D. Thesis, University of Crete, Department of Computer Science, March 1993."},{"key":"10.1016\/S0304-3975(02)00484-X_BIB18","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationship between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/S0304-3975(02)00484-X_BIB19","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","article-title":"The theory and computation of evolutionary distances","volume":"1","author":"Sellers","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB20","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","article-title":"Algorithms for approximate string matching","volume":"64","author":"Ukkonen","year":"1985","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB21","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","article-title":"Finding approximate patterns in strings","volume":"6","author":"Ukkonen","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB22","series-title":"Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity","first-page":"3","article-title":"Machine models and simulations","author":"van Emde Boas","year":"1990"},{"key":"10.1016\/S0304-3975(02)00484-X_BIB23","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern matching algorithms, in: Proc. IEEE 14th Annu. Symp. on Switching and Automata Theory, 1973, pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750200484X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750200484X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T11:56:44Z","timestamp":1553428604000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750200484X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S030439750200484X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00484-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}