{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,2]],"date-time":"2026-08-02T12:44:53Z","timestamp":1785674693574,"version":"3.56.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1007\/s10115-004-0174-5","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T15:39:30Z","timestamp":1096904370000},"page":"415-437","source":"Crossref","is-referenced-by-count":47,"title":["Reliable detection of episodes in event sequences"],"prefix":"10.1007","volume":"7","author":[{"given":"Robert","family":"Gwadera","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikhail J.","family":"Atallah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,1]]},"reference":[{"key":"174_CRaho","first-page":"An","volume":"matching","author":"Aho","year":"1975","unstructured":"Aho A, Corasick M (1975) Efficient string matching: An aid to biblographic search. Programming techniques","journal-title":"Efficient string"},{"key":"174_CRaa","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/inco.2002.3143","volume":"174","author":"Apostolico","year":"2002","unstructured":"Apostolico A, Atallah M (2002) Compact recognizers of episode sequences. Inform Comput 174:180\u2013192","journal-title":"Inform Comput"},{"key":"174_CRbill-book","unstructured":"Billingsley P (1986) Probability and measure. Wiley, New York"},{"key":"174_CRbcgm99","doi-asserted-by":"crossref","unstructured":"Boasson L, Cegielski P, Guessarian I, Matiyasevich Y (1999) Window-accumulated subsequence matching problem is linear. Proc PODS pp 327\u2013336","DOI":"10.1145\/303976.304008"},{"key":"174_CRcr94","unstructured":"Crochemore M, Rytter W (1994) Text algorithms. Oxford University Press, New York"},{"key":"174_CRDaFlGaGuKa97","doi-asserted-by":"crossref","unstructured":"Das G, Fleischer R, Gasieniec L, Gunopulos D, K\u00e4rkk\u00e4inen J (1997) Episode matching. In: Combinatorial pattern matching, 8th annual symposium. Lecture Notes in Computer Science 1264, pp 12\u201327","DOI":"10.1007\/3-540-63220-4_46"},{"key":"174_CRfgsv01","doi-asserted-by":"crossref","unstructured":"Flajolet P, Guivarc\u2019h Y, Szpankowski W, Vall\u00e9e B (2001) Hidden pattern statistics. ICALP 2001, Crete, Greece, LNCS 2076, pp 152\u2013165","DOI":"10.1007\/3-540-48224-5_13"},{"key":"174_CRkucherov97","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(97)88195-9","volume":"178","author":"Kucherov","year":"1997","unstructured":"Kucherov G, Rusinowitch M (1997) Matching a set of strings with variable length don\u2019t cares. Theor Comput Sci 178:129\u2013154","journal-title":"Theor Comput Sci"},{"key":"174_CRks94","unstructured":"Kumar S, Spafford EH (1994) A pattern-matching model for intrusion detection. Proceedings of the National Computer Security Conference, pp 11\u201321"},{"key":"174_CRfin","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"Mannila","year":"1997","unstructured":"Mannila H, Toivonen H, Verkamo A (1997) Discovery of frequent episodes in event sequences. Data Min Knowl Discov 1:241\u2013258","journal-title":"Data Min Knowl Discov"},{"key":"174_CRnsf99","doi-asserted-by":"crossref","unstructured":"Nicod\u00e8me P, Salvy B, Flajolet P (1999) Motif statistics. European symposium on algorithms. Lecture Notes in Computer Science 1643, pp 194\u2013211","DOI":"10.1007\/3-540-48481-7_18"},{"key":"174_CRpevzner","first-page":"an","volume":"biology","author":"Pevzner","year":"2000","unstructured":"Pevzner P (2000) Computational molecular biology: an algorithmic approach. MIT Press","journal-title":"Computational molecular"},{"key":"174_CRrs98","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/PL00009244","volume":"22","author":"R","year":"1998","unstructured":"R\u00e9gnier M, Szpankowski W (1998) On pattern frequency occurrences in a Markovian sequence. Algorithmica 22:631\u2013649","journal-title":"Algorithmica"},{"key":"174_CRrigoutsos00","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/mben.2000.0151","volume":"2","author":"Rigoutsos","year":"2000","unstructured":"Rigoutsos I, Floratos A, Parida L, Gao Y, Platt D (2000) The emergence of pattern discovery techniques in computational biology. Metabol Eng 2:159\u2013177","journal-title":"Metabol Eng"},{"key":"174_CRSeFl96","unstructured":"Sedgewick R, Flajolet P (1995) An introduction to the analysis of algorithms. Addison-Wesley, Reading, MA"},{"key":"174_CRspa-book","doi-asserted-by":"crossref","unstructured":"Szpankowski W (2001) Average case analysis of algorithms on sequence. Wiley, New York","DOI":"10.1002\/9781118032770"},{"key":"174_CRwaterman","doi-asserted-by":"crossref","unstructured":"Waterman M (1995) Introduction to computational biology. Chapman and Hall, London","DOI":"10.1007\/978-1-4899-6846-3"},{"key":"174_CRwespi00","doi-asserted-by":"publisher","first-page":"159","DOI":"10.3233\/JCS-2000-82-305","volume":"8","author":"Wespi","year":"2000","unstructured":"Wespi A, Debar H, Dacier M, Nassehi M (2000) Fixed vs variable-length patterns for detecting suspicious process behavior. J Comput Secur 8:159\u2013181","journal-title":"J Comput Secur"},{"key":"174_CRWuMa95","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"Wu","year":"1995","unstructured":"Wu S, Manber U (1995) Fast text searching allowing errors. Comm ACM 35:83\u201391","journal-title":"Comm ACM"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0174-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-004-0174-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0174-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:59:00Z","timestamp":1585900740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-004-0174-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["174"],"URL":"https:\/\/doi.org\/10.1007\/s10115-004-0174-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}