{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:04:40Z","timestamp":1709820280762},"reference-count":41,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0306-4379(02)00075-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"311-337","source":"Crossref","is-referenced-by-count":6,"title":["Design and implementation of a string database query language"],"prefix":"10.1016","volume":"28","author":[{"given":"G\u00f6sta","family":"Grahne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raul","family":"Hakli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matti","family":"Nyk\u00e4nen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hellis","family":"Tamm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0306-4379(02)00075-3_BIB1","series-title":"Foundations of Databases","author":"Abiteboul","year":"1995"},{"issue":"3","key":"10.1016\/S0306-4379(02)00075-3_BIB2","first-page":"321","article-title":"The search for a grammatical theory of gene regulation is formally justified by showing the inadequacy of context-free grammars","volume":"7","author":"Collado-Vides","year":"1991","journal-title":"Comput. Appl. Biosci."},{"issue":"4","key":"10.1016\/S0306-4379(02)00075-3_BIB3","first-page":"333","article-title":"Linguistic approaches to biological sequences","volume":"13","author":"Searls","year":"1997","journal-title":"Comput. Appl. Biosci."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB4","series-title":"Introduction to Computational Molecular Biology","author":"Setubal","year":"1997"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB5","doi-asserted-by":"crossref","unstructured":"D. Searls, Formal grammars for intermolecular structure, in: Intelligence in Neural and Biological Systems, Herndon, VA, 1995, pp. 30\u201337.","DOI":"10.1109\/INBS.1995.404291"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB6","unstructured":"J. Richardson, Supporting lists in a data model (a timely approach), in: Very Large Data Bases Conference, Vancouver, Canada, 1992, pp. 127\u2013138."},{"issue":"1","key":"10.1016\/S0306-4379(02)00075-3_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcss.1997.1514","article-title":"Regular sequence operations and their use in database queries","volume":"56","author":"Ginsburg","year":"1998","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB8","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1006\/jcss.1999.1633","article-title":"Reasoning about strings in databases","volume":"59","author":"Grahne","year":"1999","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/S0306-4379(02)00075-3_BIB9","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/jcss.1998.1562","article-title":"Sequences, Datalog and transducers","volume":"57","author":"Bonner","year":"1998","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB10","doi-asserted-by":"crossref","unstructured":"A. Rajasekar, String-oriented databases, in: String Processing and Information Retrieval Symposium (SPIRE\u201999) & International Workshop on Groupware (CRIWG \u201999), IEEE (The Institute of Electrical and Electronics Engineers, Inc.), New York, 1999, pp. 158\u2013167.","DOI":"10.1109\/SPIRE.1999.796591"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB11","series-title":"International Workshop on Database Programming Languages","first-page":"61","article-title":"How to make SQL stand for String Query Language","volume":"Vol. 1949","author":"Grahne","year":"1999"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB12","doi-asserted-by":"crossref","unstructured":"K. Lemstr\u00f6m, L. Hella, Approximate pattern matching is expressible in transitive closure logic, in: Logic in Computer Science, Santa Barbara, CA, 2000, pp. 157\u2013167.","DOI":"10.1109\/LICS.2000.855764"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB13","doi-asserted-by":"crossref","unstructured":"M. Benedikt, L. Libkin, T. Schwentick, L. Segoufin, String operations in query languages, in: ACM SIGACT\u2013SIGMOD\u2013SIGART Symposium on Principles of Database Systems, Santa Barbara, CA, 2001, pp. 183\u2013194.","DOI":"10.1145\/375551.375578"},{"issue":"3","key":"10.1016\/S0306-4379(02)00075-3_BIB14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0010-4825(95)00054-2","article-title":"PROXIMAL","volume":"26","author":"Ganguly","year":"1996","journal-title":"Comput. Biol. Med."},{"issue":"4","key":"10.1016\/S0306-4379(02)00075-3_BIB15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0306-4379(86)90012-8","article-title":"A database language for sets, lists and tables","volume":"11","author":"Pistor","year":"1986","journal-title":"Inform. Syst."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB16","doi-asserted-by":"crossref","unstructured":"P. Seshadri, M. Livny, R. Ramakrishnan, SEQ: a model for sequence databases, in: IEEE International Conference on Data Engineering, Taipei, Taiwan, 1995, pp. 232\u2013239.","DOI":"10.1109\/ICDE.1995.380388"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB17","doi-asserted-by":"crossref","unstructured":"B. Subramanian, T. Leung, S. Vandenberg, S. Zdonik, The AQUA approach to querying lists and trees in object-oriented databases, in: IEEE International Conference on Data Engineering, Taipei, Taiwan, 1995, pp. 80\u201389.","DOI":"10.1109\/ICDE.1995.380405"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB18","series-title":"First International Workshop on Practical Aspects of Declarative Languages (PADL\u201999)","first-page":"179","article-title":"Implementing a declarative string query language with string restructuring","volume":"Vol. 1551","author":"Hakli","year":"1999"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB19","unstructured":"C. Helgesen, P. Sibbald, PALM\u2014a pattern language for molecular biology, in: International Conference on Intelligent Systems in Molecular Biology, Bethesda, MD, 1993, pp. 172\u2013180."},{"issue":"1\/2","key":"10.1016\/S0306-4379(02)00075-3_BIB20","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0743-1066(95)00034-H","article-title":"String Variable Grammar: a logic grammar formalism for the biological language of DNA","volume":"24","author":"Searls","year":"1995","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB21","unstructured":"G. Grahne, R. Hakli, M. Nyk\u00e4nen, E. Ukkonen, AQL: an alignment based query language for querying string databases, in: C. Prabhu (Ed.), Databases for the Millennium 2000: Proceedings of the Ninth International Conference on Management of Data (COMAD\u201998), Tata McGraw-Hill Publishing Company Limited, New York, 1998, pp. 235\u2013251."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB22","unstructured":"R. Hakli, M. Nyk\u00e4nen, H. Tamm, A declarative programming system for manipulating strings, in: Sixth Fenno-Ugric Symposium on Software Technology, Sagadi, Estonia, 1999, pp. 29\u201340."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB23","doi-asserted-by":"crossref","unstructured":"R. Hakli, M. Nyk\u00e4nen, H. Tamm, Adding string processing capabilities to data management systems, in: Proceedings of the Seventh International Symposium on String Processing and Information Retrieval (SPIRE 2000), IEEE Computer Society Press, Silver Spring, MD, 2000, pp. 122\u2013131.","DOI":"10.1109\/SPIRE.2000.878187"},{"issue":"1","key":"10.1016\/S0306-4379(02)00075-3_BIB24","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1093\/nar\/29.1.17","article-title":"The EMBL nucleotide sequence database","volume":"29","author":"Stoesser","year":"2001","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB25","series-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"Gusfield","year":"1997"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB26","doi-asserted-by":"crossref","unstructured":"E. Emerson, Temporal and modal logic, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 994\u20131072 (Chapter 16).","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB27","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s002360050001","article-title":"Querying sequence databases with transducers","volume":"36","author":"Bonner","year":"2000","journal-title":"Acta Inform."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB28","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"issue":"1\/2","key":"10.1016\/S0306-4379(02)00075-3_BIB29","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0304-3975(00)00297-8","article-title":"Using acceptors as transducers","volume":"267","author":"Nyk\u00e4nen","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB30","series-title":"Foundation for Object\/Relational Databases\u2014The Third Manifesto","author":"Date","year":"1998"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB31","unstructured":"D. Searls, K. Murphy, Automata-theoretic models of mutation and alignment, in: International Conference on Intelligent Systems in Molecular Biology, Cambridge, 1995, pp. 341\u2013349."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB32","unstructured":"F. Lefebvre, A grammar-based unification of several alignment and folding algorithms, in: International Conference on Intelligent Systems in Molecular Biology, St Louis, MO, 1996, pp. 143\u2013155."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB33","series-title":"Object-Oriented Modeling and Design","author":"Rumbaugh","year":"1991"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB34","doi-asserted-by":"crossref","unstructured":"W. Brauer, K.-J. Lange, Non-deterministic two-tape automata are more powerful than deterministic ones, in: Symposium on Theoretical Aspects of Computer Science, Saarbr\u00fcchen, Germany, 1985, pp. 71\u201379.","DOI":"10.1007\/BFb0023996"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB35","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB36","series-title":"Symposium on Theoretical Aspects of Computer Science","first-page":"345","article-title":"Finding paths with the right cost","volume":"Vol. 1563","author":"Nyk\u00e4nen","year":"1999"},{"issue":"1","key":"10.1016\/S0306-4379(02)00075-3_BIB37","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1006\/jagm.2001.1201","article-title":"The exact path length problem","volume":"42","author":"Nyk\u00e4nen","year":"2002","journal-title":"J. Algorithms"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB38","doi-asserted-by":"crossref","unstructured":"K. Sohn, A. van Gelder, Termination detection in logic programs using argument sizes (extended abstract), in: ACM SIGACT\u2013SIGMOD\u2013SIGART Symposium on Principles of Database Systems, Denver, CO, 1991, pp. 216\u2013226.","DOI":"10.1145\/113413.113433"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB39","doi-asserted-by":"crossref","unstructured":"G. Grahne, M. Nyk\u00e4nen, Safety, translation and evaluation of Alignment Calculus, in: Advances in Databases and Information Systems, electronic Workshops in Computing, British Computer Society, St Petersburg, Russia, 1997, pp. 295\u2013304, also available via http:\/\/www.ewic.org.uk\/ewic\/workshop\/view.cfm\/ADBIS-97.","DOI":"10.14236\/ewic\/ADBIS1997.20"},{"key":"10.1016\/S0306-4379(02)00075-3_BIB40","unstructured":"P. Seshadri, M. Livny, R. Ramakrishnan, The case for enhanced abstract data types, in: Very Large Data Bases Conference, Athens, Greece, 1997, pp. 66\u201375."},{"key":"10.1016\/S0306-4379(02)00075-3_BIB41","series-title":"The Scheme Programming Language: ANSI Scheme","author":"Dybvig","year":"1996"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437902000753?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437902000753?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T01:14:03Z","timestamp":1583975643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437902000753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0306437902000753"],"URL":"https:\/\/doi.org\/10.1016\/s0306-4379(02)00075-3","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}