{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T18:53:14Z","timestamp":1762541594605},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,12,5]],"date-time":"2006-12-05T00:00:00Z","timestamp":1165276800000},"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":[[2007,4,3]]},"DOI":"10.1007\/s10115-006-0038-2","type":"journal-article","created":{"date-parts":[[2006,12,4]],"date-time":"2006-12-04T16:10:16Z","timestamp":1165248616000},"page":"259-286","source":"Crossref","is-referenced-by-count":87,"title":["Mining minimal distinguishing subsequence patterns with gap constraints"],"prefix":"10.1007","volume":"11","author":[{"given":"Xiaonan","family":"Ji","sequence":"first","affiliation":[]},{"given":"James","family":"Bailey","sequence":"additional","affiliation":[]},{"given":"Guozhu","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,5]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/ICDE.1995.380415","volume-title":"Proceedings of the 11th international conference on data engineering","author":"R Agrawel","year":"1995","unstructured":"Agrawel R, Srikant R (1995) Mining sequential patterns. In: Yu PS, Chen ALP (eds) Proceedings of the 11th international conference on data engineering, IEEE computer society, Taipei, Taiwan, pp 3\u201314."},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Antunes C, Oliveira AL (2003) Generalization of pattern-growth methods for sequential pattern mining with gap constraints. In: Perner P, Rosenfeld A (eds) Proceedings of the 3rd international conference on machine learning and data mining in pattern recognition, lecture notes in computer science, Leipzig, Germany, pp 239\u2013251.","DOI":"10.1007\/3-540-45065-3_21"},{"key":"38_CR3","first-page":"429","volume-title":"Proceedings of the 8th ACM SlGKDD international conference on knowledge discovery and data mining","author":"J Ayres","year":"2002","unstructured":"Ayres J, Flannick J, Gehrke J et al (2002) Sequential pattern mining using a bitmap representation. In: Proceedings of the 8th ACM SlGKDD international conference on knowledge discovery and data mining, ACM, Edmonton, Alberta, Canada, pp 429\u2013435."},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Bailey J, Manoukian T, Ramamohanarao K (2003) Classification using constrained emerging patterns. In: Dong G, Tang C, Wang W (eds) Proceedings of the 4th international conference on advances in web-age information management, lecture notes in computer science, Chengdu, China, pp 226\u2013237.","DOI":"10.1007\/978-3-540-45160-0_22"},{"key":"38_CR5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1011429418057","volume":"5","author":"SD Bay","year":"2001","unstructured":"Bay SD, Pazzani MJ (2001) Detecting group differences: Mining contrast sets. Data Mining Know Disc 5:213\u2013246.","journal-title":"Data Mining Know Disc"},{"key":"38_CR6","first-page":"83","volume-title":"Proceedings of the 7th European conference on principles and practice of knowledge discovery in databases, lecture notes in computer science","author":"GC Garriga","year":"2003","unstructured":"Garriga GC (2003) Discovering unbounded episodes in sequential data. In: Lavrac N, Gamberger D, Blockeel H, Todorovski L (eds) Proceedings of the 7th European conference on principles and practice of knowledge discovery in databases, lecture notes in computer science, Cavtat-Dubrovnik, Croatia, pp 83\u201394."},{"key":"38_CR7","first-page":"119","volume-title":"Proceedings of the 8th international conference on database systems for advanced applications","author":"S Chan","year":"2003","unstructured":"Chan S, Kao B, Yip CL et al (2003) Mining emerging substrings. In: Proceedings of the 8th international conference on database systems for advanced applications, IEEE Computer Society, Kyoto, Japan, pp 119\u2013126."},{"key":"38_CR8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/3-540-63220-4_46","volume-title":"Proceedings of the 8th annual symposium on combinatorial pattern matching, lecture notes in computer science","author":"G Das","year":"1997","unstructured":"Das G, Fleischer R, Gasieniec L et al (1997) Episode matching. In: Apostolico A, Hein J (eds) Proceedings of the 8th annual symposium on combinatorial pattern matching, lecture notes in computer science, Aarhus, Denmark, pp 12\u201327."},{"key":"38_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/312129.312191","volume-title":"Proceedings of the 5th ACM SIGKDD international conference on knowledge discovery and data mining","author":"G Dong","year":"1999","unstructured":"Dong G, Li J (1999) Efficient mining of emerging patterns: Discovering trends and differences. In: Proceedings of the 5th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, San Diego, CA, USA, pp 43\u201352."},{"key":"38_CR10","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10115-004-0178-1","volume":"8","author":"G Dong","year":"2005","unstructured":"Dong G, Li J (2005) Mining border descriptions of emerging patterns from dataset pairs. Know and Inf Syst 8:178\u2013202.","journal-title":"Know and Inf Syst"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Dong G, Zhang X, Wong L et al (1999) CAEP: Classification by aggregating emerging patterns. In: Arikawa S, Furukawa K (eds) Proceedings of the 2nd international conference on discovery science, lecture notes in computer science, Tokyo, Japan, pp 30\u201342.","DOI":"10.1007\/3-540-46846-3_4"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Fischer J, Raedt LD (2004) Towards optimizing conjunctive inductive queries. In: Dai H, Srikant R, Zhang C (eds) Proceedings of the 8th Pacific-Asia conference on advances in knowledge discovery and data mining, lecture notes in computer science, Sydney, Australia, pp 625\u2013637.","DOI":"10.1007\/978-3-540-24775-3_74"},{"key":"38_CR13","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences, computer science and computational biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield D (1997) Algorithms on strings, trees and sequences, computer science and computational biology. Cambridge University Press, Cambridge, pp 235\u2013244."},{"key":"38_CR14","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1145\/347090.347167","volume-title":"proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Mortazavi-Asl B et al (2000) Freespan: frequent pattern-projected sequential pattern mining. In: proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, Boston, MA, USA, pp 355\u2013359."},{"key":"38_CR15","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/S0304-3975(02)00182-2","volume":"292","author":"M Hirao","year":"2003","unstructured":"Hirao M, Hoshino H, Shinohara A et al (2003) A practical algorithm to find the best subsequence patterns. Theor Comp Sci 292:465\u2013479.","journal-title":"Theor Comp Sci"},{"key":"38_CR16","first-page":"194","volume-title":"Proceedings of the 5th IEEE international conference on data mining","author":"X Ji","year":"2005","unstructured":"Ji X, Bailey J, Dong D (2005) Mining minimal distinguishing subsequence patterns with gap constraints. In: Proceedings of the 5th IEEE international conference on data mining, IEEE Computer Society, Houston, Texas USA, pp 194\u2013201."},{"key":"38_CR17","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/5254.850827","volume":"15","author":"N Lesh","year":"2000","unstructured":"Lesh N, Zaki MJ, Ogihara M (2000) Scalable feature mining for sequential data. IEEE Int Syst 15:48\u201356.","journal-title":"IEEE Int Syst"},{"key":"38_CR18","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/PL00011662","volume":"3","author":"J Li","year":"2001","unstructured":"Li J, Dong G, Ramamohanarao K (2001) Making use of the most expressive jumping emerging patterns for classification. Know Info Sys 3:131\u2013145.","journal-title":"Know Info Sys"},{"issue":"2","key":"38_CR19","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D Maier","year":"1978","unstructured":"Maier D (1978) The complexity of some problems on subsequences and supersequences. J ACM 25(2):322\u2013336.","journal-title":"J ACM"},{"key":"38_CR20","first-page":"210","volume-title":"Proceedings of the 1st international conference on knowledge discovery and data mining","author":"H Mannila","year":"1995","unstructured":"Mannila H, Toivonen H, Verkamo AI (1995) Discovering frequent episodes in sequences. In: Fayyad UM, Uthurusamy R (eds) Proceedings of the 1st international conference on knowledge discovery and data mining, AAAI Press, Montreal, Canada, pp 210\u2013215."},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"M\u00e9ger N, Rigotti C (2004) Constraint-based mining of episode rules and optimal window sizes. In: Boulicaut JF, Esposito F, Giannotti F, Pcdrcschi D (eds) Proceedings of the 8th european conference on principles and practice of knowledge discovery in databases, lecture notes in computer science, Pisa, Italy, pp 313\u2013324.","DOI":"10.1007\/978-3-540-30116-5_30"},{"issue":"2","key":"38_CR22","first-page":"203","volume":"18","author":"T Mitchell","year":"1982","unstructured":"Mitchell T (1982) Generalization as search. AI Journal 18(2):203\u2013226.","journal-title":"AI Journal"},{"issue":"5","key":"38_CR23","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1089\/106652702761034145","volume":"9","author":"G Narasimhan","year":"2002","unstructured":"Narasimhan G, Bu C, Gao Y et al (2002) Mining protein sequences for motifs. J Comp Bio 9(5):707\u2013720.","journal-title":"J Comp Bio"},{"key":"38_CR24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/ICDE.2001.914830","volume-title":"Proceedings of the 17th international conference on data engineering","author":"J Pei","year":"2001","unstructured":"Pei J, Han J, Mortazavi-Asl B et al (2001) Prefixspan: mining sequential patterns by prefix-projected growth. In: Proceedings of the 17th international conference on data engineering, IEEE Computer Society, Heidelberg, Germany, pp 215\u2013224."},{"key":"38_CR25","first-page":"853","volume-title":"Proceedings of the 17th international joint conference on artificial intelligence","author":"LD Raedit","year":"2001","unstructured":"Raedit LD, Kramer S (2001) The levelwise version space algorithm and its application to molecular fragment finding. In: Nebel B (ed) Proceedings of the 17th international joint conference on artificial intelligence, Morgan Kaufmann, Seattle, Washington, USA, pp 853\u2013862."},{"key":"38_CR26","first-page":"436","volume-title":"Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining","author":"R She","year":"2003","unstructured":"She R, Chen F, Wang K et al (2003) Frequent-subsequence-based prediction of outer membrane proteins. In: Gctoor L, Senator TE, Domingos P, Faloutsos C (eds) Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, Washington, DC, USA, pp 436\u2013445."},{"key":"38_CR27","doi-asserted-by":"crossref","unstructured":"Tron\u00edcek Z (2001) Episode matching. In: Amir A, Landau GM (eds) Proceedings of the 12th annual symposium on combinatorial pattern matching, lecture notes in computer science, Jerusalem, Israel, pp 143\u2013146.","DOI":"10.1007\/3-540-48194-X_12"},{"key":"38_CR28","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1109\/ICDM.2003.1250939","volume-title":"Proceedings of the 3rd IEEE international conference on data mining","author":"P Tzvetkov","year":"2003","unstructured":"Tzvetkov P, Yan X, Han J (2003) TSP: mining top-K closed sequential patterns. In: Proceedings of the 3rd IEEE international conference on data mining, IEEE Computer Society, Melbourne, Florida, USA, pp 347\u2013354."},{"key":"38_CR29","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/ICDE.2004.1319986","volume-title":"Proceedings of the 20th international conference on data engineering","author":"J Wang","year":"2004","unstructured":"Wang J, Han J (2004) BIDE: efficient mining of frequent closed sequences. In: Proceedings of the 20th international conference on data engineering, IEEE Computer Society, Boston, MA, USA, pp 79\u201390."},{"key":"38_CR30","first-page":"256","volume-title":"Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining","author":"GI Webb","year":"2003","unstructured":"Webb GI, Butler S, Newlands D (2003) On detecting differences between groups. In: Getoor L, Senator TE, Domingos P, Faloutsos C (eds) Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, Washington, DC, USA, pp 256\u2013265."},{"key":"38_CR31","volume-title":"Proceedings of the 3rd SIAM international conference on data mining","author":"X Yan","year":"2003","unstructured":"Yan X, Han J, Afshar R (2003) Clospan: mining closed sequential patterns in large databases. In: Barbara D, Kamath C (eds) Proceedings of the 3rd SIAM international conference on data mining, SIAM, San Francisco, CA, USA."},{"key":"38_CR32","first-page":"422","volume-title":"Proceedings of the 2000 ACM CIKM international conference on information and knowledge management","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Sequence mining in categorical domains: incorporating constraints. In: Proceedings of the 2000 ACM CIKM international conference on information and knowledge management, ACM, McLean, VA, USA, pp 422\u2013429."},{"issue":"1\/2","key":"38_CR33","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki MJ (2001) Spade: an efficient algorithm for mining frequent sequences. Mach Learn 42(1\/2):31\u201360.","journal-title":"Mach Learn"},{"key":"38_CR34","first-page":"622","volume-title":"Proceedings of the 2005 ACM SIGMOD international conference on management of data","author":"M Zhang","year":"2005","unstructured":"Zhang M, Kao B, Cheung D, Yip K (2005) Mining periodic patterns with gap requirement from sequences. In: \u00d6zcan F (ed) Proceedings of the 2005 ACM SIGMOD international conference on management of data, ACM, Maryland, USA, pp 622\u2013633 ."}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-006-0038-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-006-0038-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-006-0038-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:15Z","timestamp":1559124615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-006-0038-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,5]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,4,3]]}},"alternative-id":["38"],"URL":"https:\/\/doi.org\/10.1007\/s10115-006-0038-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,5]]}}}