Fast parameterized pattern matching algorithms based on data compression
Project/Area Number |
23700022
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Multi-year Fund |
Research Field |
Fundamental theory of informatics
|
Research Institution | Kyushu University |
Principal Investigator |
INENAGA Shunsuke 九州大学, システム情報科学研究科(研究院, 准教授 (60448404)
|
Project Period (FY) |
2011 – 2013
|
Project Status |
Completed (Fiscal Year 2013)
|
Budget Amount *help |
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2011: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
Keywords | アルゴリズム / 文字列処理 / データ圧縮 / 文字列情報処理 / データ構造 |
Research Abstract |
A sequence of characters or symbols is called a string. Many digital data can be regarded as a string. In order to process and utilize large-scale data, we proposed efficient string processing algorithms that are both fast and memory efficient. In particular, we developed efficient algorithms that work on strings given as straight-line programs (SLPs). We achieved fast and memory efficient solutions by an approach called compressed string processing, where given compressed data is not explicitly decompressed. The results of our work have been published in internal journals/proceedings, and presented in international/domestic conferences.
|
Report
(4 results)
Research Products
(71 results)
-
-
[Journal Article] Shortest Unique Substrings Queries in Optimal Time2014
Author(s)
Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
-
Journal Title
Proc. the 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2014), Lecture Notes in Computer Science
Volume: 8327
Pages: 503-513
DOI
ISBN
9783319042978, 9783319042985
Related Report
Peer Reviewed
-
-
-
-
[Journal Article] Detecting Regularities on Grammar-compressed Strings2013
Author(s)
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
-
Journal Title
In Proc. the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), Lecture Notes in Computer Science
Volume: 8087
Pages: 571-582
DOI
ISBN
9783642403125, 9783642403132
Related Report
Peer Reviewed
-
[Journal Article] Compressed Automata for Dictionary Matching2013
Author(s)
Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
-
Journal Title
In Proc. the 18th International Conference on Implementation and Application of Automata (CIAA 2013), Lecture Notes in Computer Science
Volume: 7982
Pages: 319-330
DOI
ISBN
9783642392733, 9783642392740
Related Report
Peer Reviewed
-
[Journal Article] Converting SLP to LZ78 in almost linear time2013
Author(s)
Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, and Masayuki Takeda
-
Journal Title
In Proc. 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), Lecture Notes in Computer Science
Volume: 7922
Pages: 38-49
DOI
ISBN
9783642389047, 9783642389054
Related Report
Peer Reviewed
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] The position heap of a trie2012
Author(s)
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
-
Journal Title
In Proceedings of the 19th Symposium on String Processing and Information Retrieval
Volume: LNCS 7608
Pages: 360-371
DOI
ISBN
9783642341083, 9783642341090
Related Report
Peer Reviewed
-
-
-
-
-
-
[Journal Article] Fast q-gram Mining on SLP Compressed Strings2011
Author(s)
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
-
Journal Title
Proceedings of the 18th International Symposium on String Processing and Information Retrieval (SPIRE 2011)
Volume: LNCS7024
Pages: 278-289
DOI
NAID
ISBN
9783642245824, 9783642245831
Related Report
Peer Reviewed
-
-
-
-
[Journal Article] Palindrome Pattern Matching2011
Author(s)
Tomohiro I, Shunsuke Inenaga and Masayuki Takeda
-
Journal Title
In Proc. the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), Lecture Notes in Computer Science, (Springer-Verlag)
Volume: 6661
Pages: 232-245
DOI
ISBN
9783642214578, 9783642214585
Related Report
Peer Reviewed
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Detecting Regularities on Grammar-compressed Strings2013
Author(s)
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
Organizer
38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013)
Place of Presentation
Klosterneuburg, Austria
Related Report
-
-
-
-
-
-
[Presentation] Permuted Pattern Matching on Multi-Track Strings2013
Author(s)
Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, and Shunsuke Inenaga
Organizer
39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2013)
Place of Presentation
Spindleruv Mlyn, Czech Republic
Related Report
-
-
-
-
-
[Presentation] The Position Heap of a Trie2012
Author(s)
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
Organizer
19th Symposium on String Processing and Information Retrieval (SPIRE 2012)
Place of Presentation
Cartagena, Colombia
Related Report
-
-
-
-
[Presentation] The Position Heap of a Trie2012
Author(s)
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
Organizer
19th Symposium on String Processing and Information Retrieval (SPIRE 2012)
Place of Presentation
Cartagena de Indias, Colombia
Related Report
-
-
-
-
-
-
[Presentation] Palindrome Pattern Matching2011
Author(s)
Tomohiro I, Shunsuke Inenaga and Masayuki Takeda
Organizer
22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011)
Place of Presentation
Palermo, Italy
Related Report
-
-
-
-
-
-
-
-