{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T04:26:49Z","timestamp":1768105609349,"version":"3.49.0"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1109\/tkde.2002.1000341","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T21:39:07Z","timestamp":1034977147000},"page":"530-552","source":"Crossref","is-referenced-by-count":88,"title":["Mining sequential patterns with regular expression constraints"],"prefix":"10.1109","volume":"14","author":[{"given":"M.","family":"Garofalakis","sequence":"first","affiliation":[]},{"given":"R.","family":"Rastogi","sequence":"additional","affiliation":[]},{"given":"K.","family":"Shim","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","article-title":"Querying Shapes of Histories","volume-title":"Proc. 21st Int\u2019l Conf. Very Large Data Bases","author":"Agrawal"},{"key":"ref2","article-title":"Fast Algorithms for Mining Association Rules","volume-title":"Proc. 20th Int\u2019l Conf. Very Large Data Bases","author":"Agrawal"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380415"},{"key":"ref4","article-title":"Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases","volume-title":"Proc. 23rd Int\u2019l Conf. Very Large Data Bases","author":"Chakrabarti"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/69.683753"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1996.492095"},{"key":"ref7","volume-title":"Elements of the Theory of Computation.","author":"Lewis","year":"1981"},{"key":"ref8","article-title":"Discovering Generalized Episodes Using Minimal Occurrences","volume-title":"Proc. Second Int\u2019l Conf. Knowledge Discovery and Data Mining","author":"Mannila"},{"key":"ref9","first-page":"210","article-title":"Discovering Frequent Episodes in Sequences","volume-title":"Proc. First Int\u2019l Conf. Knowledge Discovery and Data Mining","author":"Mannila"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276307"},{"key":"ref11","article-title":"Mining Association Rules with Item Constraints","volume-title":"Proc. Third Int\u2019l Conf. Knowledge Discovery and Data Mining","author":"Srikant"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014140"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276306"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191863"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/69\/21606\/01000341.pdf?arnumber=1000341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:06:54Z","timestamp":1742015214000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1000341\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"URL":"https:\/\/doi.org\/10.1109\/tkde.2002.1000341","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}