{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:41Z","timestamp":1750306901370,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"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":[[2013,3,18]]},"DOI":"10.1145\/2457317.2457390","type":"proceedings-article","created":{"date-parts":[[2013,3,26]],"date-time":"2013-03-26T12:25:54Z","timestamp":1364300754000},"page":"397-403","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["<i>FPI<\/i>"],"prefix":"10.1145","author":[{"given":"Mitsuki","family":"Kimura","sequence":"first","affiliation":[{"name":"The University of Tokyo, Hitotsubashi, Chiyoda-ku, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuhiro","family":"Takasu","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Hitotsubashi, Chiyoda-ku, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Adachi","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Hitotsubashi, Chiyoda-ku, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Lecture Notes in Computer Science","first-page":"57","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"Abe Kenji","year":"2002","unstructured":"Kenji Abe , Shinji Kawasoe , Tatsuya Asai , Hiroki Arimura , and Setsuo Arikawa . Optimized substructure discovery for semi-structured data . In Tapio Elomaa, Heikki Mannila, and Hannu Toivonen, editors, Principles of Data Mining and Knowledge Discovery , volume 2431 of Lecture Notes in Computer Science , pages 57 -- 100 . Springer Berlin\/Heidelberg , 2002 . 10.1007\/3-540-45681-3. Kenji Abe, Shinji Kawasoe, Tatsuya Asai, Hiroki Arimura, and Setsuo Arikawa. Optimized substructure discovery for semi-structured data. In Tapio Elomaa, Heikki Mannila, and Hannu Toivonen, editors, Principles of Data Mining and Knowledge Discovery, volume 2431 of Lecture Notes in Computer Science, pages 57--100. Springer Berlin\/Heidelberg, 2002. 10.1007\/3-540-45681-3."},{"key":"e_1_3_2_1_2_1","first-page":"3","volume-title":"Mining sequential patterns","author":"Agrawal Rakesh","year":"1995","unstructured":"Rakesh Agrawal and Ramakrishnan Srikant . Mining sequential patterns . pages 3 -- 14 , 1995 . Rakesh Agrawal and Ramakrishnan Srikant. Mining sequential patterns. pages 3--14, 1995."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.32"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687623"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217858"},{"key":"e_1_3_2_1_6_1","first-page":"325","volume-title":"In VLDB","author":"Kim Min-Soo","year":"2005","unstructured":"Min-Soo Kim , Kyu young Whang , Jae-Gil Lee , and Min jae Lee . n-gram\/2l : A space and time efficient two-level n-gram inverted index structure . In In VLDB , pages 325 -- 336 , 2005 . Min-Soo Kim, Kyu young Whang, Jae-Gil Lee, and Min jae Lee. n-gram\/2l: A space and time efficient two-level n-gram inverted index structure. In In VLDB, pages 325--336, 2005."},{"key":"e_1_3_2_1_7_1","volume-title":"Space efficient linear time construction of suffix arrays. Journal of Discrete Algorithms, 3(2\u00e2\u0102\u015e4):143--156","author":"Ko Pang","year":"2005","unstructured":"Pang Ko and Srinivas Aluru . Space efficient linear time construction of suffix arrays. Journal of Discrete Algorithms, 3(2\u00e2\u0102\u015e4):143--156 , 2005 . Combinatorial Pattern Matching (CPM) Special IssueThe 14th annual Symposium on combinatorial Pattern Matching . Pang Ko and Srinivas Aluru. Space efficient linear time construction of suffix arrays. Journal of Discrete Algorithms, 3(2\u00e2\u0102\u015e4):143--156, 2005. Combinatorial Pattern Matching (CPM) Special IssueThe 14th annual Symposium on combinatorial Pattern Matching."},{"key":"e_1_3_2_1_8_1","series-title":"Lecture Notes in Computer Science","first-page":"181","volume-title":"Combinatorial Pattern Matching","author":"Landau Gad","year":"2006","unstructured":"Gad Landau , Toru Kasai , Gunho Lee , Hiroki Arimura , Setsuo Arikawa , and Kunsoo Park . Linear-time longest-common-prefix computation in suffix arrays and its applications . In Combinatorial Pattern Matching , volume 2089 of Lecture Notes in Computer Science , pages 181 -- 192 . Springer Berlin\/Heidelberg , 2006 . 10.1007\/3-540-48194. Gad Landau, Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, and Kunsoo Park. Linear-time longest-common-prefix computation in suffix arrays and its applications. In Combinatorial Pattern Matching, volume 2089 of Lecture Notes in Computer Science, pages 181--192. Springer Berlin\/Heidelberg, 2006. 10.1007\/3-540-48194."},{"issue":"1","key":"e_1_3_2_1_9_1","first-page":"8","article-title":"Binary codes capable of correcting spurious insertions and deletions of ones","volume":"1","author":"Levenshtein Vladimir I","year":"1965","unstructured":"Vladimir I Levenshtein . Binary codes capable of correcting spurious insertions and deletions of ones . Problems of Information Transmission , 1 ( 1 ): 8 -- 17 , 1965 . Vladimir I Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1(1):8--17, 1965.","journal-title":"Problems of Information Transmission"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"e_1_3_2_1_11_1","first-page":"303","volume-title":"VLDB '07: Proceedings of the 33rd international conference on Very large data bases","author":"Li Chen","year":"2007","unstructured":"Chen Li , Bin Wang , and Xiaochun Yang . Vgram : improving performance of approximate queries on string collections using variable-length grams . In VLDB '07: Proceedings of the 33rd international conference on Very large data bases , pages 303 -- 314 . VLDB Endowment , 2007 . Chen Li, Bin Wang, and Xiaochun Yang. Vgram: improving performance of approximate queries on string collections using variable-length grams. In VLDB '07: Proceedings of the 33rd international conference on Very large data bases, pages 303--314. VLDB Endowment, 2007."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.3115\/991886.991994"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.188"},{"key":"e_1_3_2_1_15_1","first-page":"215","volume-title":"Data Engineering, 2001. Proceedings. 17th International Conference on","author":"Pei Jian","year":"2001","unstructured":"Jian Pei , Jiawei Han , B. Mortazavi-Asl , H. Pinto , Qiming Chen , U. Dayal , and Mei-Chun Hsu . Prefixspan ,: mining sequential patterns efficiently by prefix-projected pattern growth . In Data Engineering, 2001. Proceedings. 17th International Conference on , pages 215 -- 224 , 2001 . Jian Pei, Jiawei Han, B. Mortazavi-Asl, H. Pinto, Qiming Chen, U. Dayal, and Mei-Chun Hsu. Prefixspan,: mining sequential patterns efficiently by prefix-projected pattern growth. In Data Engineering, 2001. Proceedings. 17th International Conference on, pages 215--224, 2001."},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes for Stanford CS345A Web Mining, 67(3):328","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139058452","volume-title":"Mining of massive datasets","author":"Rajaraman Anand","year":"2011","unstructured":"Anand Rajaraman and Jeffrey D Ullman . Mining of massive datasets . Lecture Notes for Stanford CS345A Web Mining, 67(3):328 , 2011 . Anand Rajaraman and Jeffrey D Ullman. Mining of massive datasets. Lecture Notes for Stanford CS345A Web Mining, 67(3):328, 2011."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"},{"key":"e_1_3_2_1_18_1","volume-title":"Approximate string matching with q-grams and maximal matches. Technical report","author":"Ukkonen Esko","year":"1991","unstructured":"Esko Ukkonen . Approximate string matching with q-grams and maximal matches. Technical report , 1991 . Esko Ukkonen. Approximate string matching with q-grams and maximal matches. Technical report, 1991."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_3_2_1_20_1","first-page":"721","volume-title":"Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on","author":"Yan Xifeng","year":"2002","unstructured":"Xifeng Yan and Jiawei Han . gspan : graph-based substructure pattern mining . In Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on , pages 721 -- 724 , 2002 . Xifeng Yan and Jiawei Han. gspan: graph-based substructure pattern mining. In Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on, pages 721--724, 2002."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376655"},{"key":"e_1_3_2_1_22_1","volume-title":"Mining frequent substrings(natural language understanding and models of communication). IEICE technical report. Natural language understanding and models of communication, 103(408):79--86","author":"Yuta Ol","year":"2003","unstructured":"TSUB Ol Yuta . Mining frequent substrings(natural language understanding and models of communication). IEICE technical report. Natural language understanding and models of communication, 103(408):79--86 , 2003 -10-31. TSUBOl Yuta. Mining frequent substrings(natural language understanding and models of communication). IEICE technical report. Natural language understanding and models of communication, 103(408):79--86, 2003-10-31."}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","acronym":"EDBT\/ICDT '13","location":"Genoa Italy"},"container-title":["Proceedings of the Joint EDBT\/ICDT 2013 Workshops"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457317.2457390","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2457317.2457390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:19:12Z","timestamp":1750234752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457317.2457390"}},"subtitle":["a novel indexing method using frequent patterns for approximate string searches"],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":22,"alternative-id":["10.1145\/2457317.2457390","10.1145\/2457317"],"URL":"https:\/\/doi.org\/10.1145\/2457317.2457390","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}