{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:59Z","timestamp":1750308119573,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,14]],"date-time":"2005-06-14T00:00:00Z","timestamp":1118707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,14]]},"DOI":"10.1145\/1066157.1066228","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"623-633","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Mining periodic patterns with gap requirement from sequences"],"prefix":"10.1145","author":[{"given":"Minghua","family":"Zhang","sequence":"first","affiliation":[{"name":"The University of Hong Kong, Hong Kong"}]},{"given":"Ben","family":"Kao","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong"}]},{"given":"David W.","family":"Cheung","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong"}]},{"given":"Kevin Y.","family":"Yip","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"key":"e_1_3_2_1_2_1","volume-title":"The swiss-prot protein sequence data bank. Nucleic Acids Research, 20(Suppl):2019--2022","author":"Bairoch A.","year":"1992","unstructured":"A. Bairoch and B. Boeckmann . The swiss-prot protein sequence data bank. Nucleic Acids Research, 20(Suppl):2019--2022 , 1992 . A. Bairoch and B. Boeckmann. The swiss-prot protein sequence data bank. Nucleic Acids Research, 20(Suppl):2019--2022, 1992."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.4001930"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/14.6.498"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/20.24.6441"},{"key":"e_1_3_2_1_6_1","first-page":"106","volume-title":"Proc. of 15th International Conference on Data Engineering, ICDE99","author":"Han Jiawei","year":"1999","unstructured":"Jiawei Han , Guozhu Dong , and YiWen Yin . Efficient mining of partial periodic patterns in time series database . In Proc. of 15th International Conference on Data Engineering, ICDE99 , pages 106 -- 115 , 1999 . Jiawei Han, Guozhu Dong, and YiWen Yin. Efficient mining of partial periodic patterns in time series database. In Proc. of 15th International Conference on Data Engineering, ICDE99, pages 106--115, 1999."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/15.3.187"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 8th International Conference on Intelligent Systems for Molecular (ISMB-00)","author":"Kurtz Stefan","year":"2000","unstructured":"Stefan Kurtz , Enno Ohlebusch , Chris Schleiermacher , Jens Stoye , and Robert Giegerich . Computation and visualization of degenerate repeats in complete genomes . In Proceedings of the 8th International Conference on Intelligent Systems for Molecular (ISMB-00) , 2000 . Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher, Jens Stoye, and Robert Giegerich. Computation and visualization of degenerate repeats in complete genomes. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular (ISMB-00), 2000."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009748302351"},{"key":"e_1_3_2_1_11_1","unstructured":"http:\/\/www.ncbi.nlm.nih.gov.  http:\/\/www.ncbi.nlm.nih.gov."},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. 17th IEEE International Conference on Data Engineering (ICDE)","author":"Pei Jian","year":"2001","unstructured":"Jian Pei , Jiawei Han , Behzad Mortazavi-Asl , Helen Pinto , Qiming Chen , Umeshwar Dayal , and Mei-Chun Hsu . Prefixspan : Mining sequential patterns by prefix-projected growth . In Proc. 17th IEEE International Conference on Data Engineering (ICDE) , Heidelberg, Germany , April 2001 . Jian Pei, Jiawei Han, Behzad Mortazavi-Asl, Helen Pinto, Qiming Chen, Umeshwar Dayal, and Mei-Chun Hsu. Prefixspan: Mining sequential patterns by prefix-projected growth. In Proc. 17th IEEE International Conference on Data Engineering (ICDE), Heidelberg, Germany, April 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0955-0674(97)80009-9"},{"key":"e_1_3_2_1_15_1","volume-title":"Combinatorial pattern discovery in biological sequences: the teiresias algorithm. Bioinformatics, 14(1)","author":"Rigoutsos Isidore","year":"1998","unstructured":"Isidore Rigoutsos and Aris Floratos . Combinatorial pattern discovery in biological sequences: the teiresias algorithm. Bioinformatics, 14(1) , 1998 . Isidore Rigoutsos and Aris Floratos. Combinatorial pattern discovery in biological sequences: the teiresias algorithm. Bioinformatics, 14(1), 1998."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645337.650382"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00006541"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(97)00510-4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1128\/IAI.65.12.5017-5027.1997"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1996.0341"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347150"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/288627.288643"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of IC-AI'2001","author":"Zhang Minghua","year":"2001","unstructured":"Minghua Zhang , Ben Kao , C. L. Yip , and David Cheung . A GSP-based efficient algorithm for mining frequent sequences . In Proc. of IC-AI'2001 , Las Vegas, Nevada, USA , June 2001 . Minghua Zhang, Ben Kao, C. L. Yip, and David Cheung. A GSP-based efficient algorithm for mining frequent sequences. In Proc. of IC-AI'2001, Las Vegas, Nevada, USA, June 2001."}],"event":{"name":"SIGMOD\/PODS05: International Conference on Management of Data and Symposium on Principles Database and Systems","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Baltimore Maryland","acronym":"SIGMOD\/PODS05"},"container-title":["Proceedings of the 2005 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066228","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066157.1066228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:19Z","timestamp":1750262899000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,14]]},"references-count":22,"alternative-id":["10.1145\/1066157.1066228","10.1145\/1066157"],"URL":"https:\/\/doi.org\/10.1145\/1066157.1066228","relation":{},"subject":[],"published":{"date-parts":[[2005,6,14]]},"assertion":[{"value":"2005-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}