2026
JournalBijective BWT Based Compression Schemes
Golnaz Badkobeh, Hideo Bannai, Tomohiro I, Dominik Köppl — Theory Comput. Syst., 2026
Cite (BibTeX)
@article{DBLP:journals/mst/BadkobehBIK26, author = {Golnaz Badkobeh and Hideo Bannai and Tomohiro I and Dominik K{\"{o}}ppl}, title = {Bijective {BWT} Based Compression Schemes}, journal = {Theory Comput. Syst.}, volume = {70}, number = {3}, pages = {42}, year = {2026}, url = {https://doi.org/10.1007/s00224-025-10235-w}, doi = {10.1007/S00224-025-10235-W}, timestamp = {Tue, 28 Jul 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BadkobehBIK26.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalComputing NP-hard Repetitiveness Measures via MAX-SAT
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto, Bernardo Subercaseaux — ACM Trans. Algorithms, 2026
Cite (BibTeX)
@article{DBLP:journals/talg/BannaiGIKKNS26, author = {Hideo Bannai and Keisuke Goto and Masakazu Ishihata and Shunsuke Kanda and Dominik K{\"{o}}ppl and Takaaki Nishimoto and Bernardo Subercaseaux}, title = {Computing NP-hard Repetitiveness Measures via {MAX-SAT}}, journal = {{ACM} Trans. Algorithms}, volume = {22}, number = {2}, pages = {15:1--15:25}, year = {2026}, url = {https://doi.org/10.1145/3777895}, doi = {10.1145/3777895}, timestamp = {Mon, 22 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/BannaiGIKKNS26.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintFast and Optimal Differentially Private Frequent-Substring Mining
Peaker Guo, Rayne Holland, Hao Wu
Cite (BibTeX)
@article{DBLP:journals/corr/abs-2603-09166, author = {Peaker Guo and Rayne Holland and Hao Wu}, title = {Fast and Optimal Differentially Private Frequent-Substring Mining}, journal = {CoRR}, volume = {abs/2603.09166}, year = {2026}, url = {https://doi.org/10.48550/arXiv.2603.09166}, doi = {10.48550/ARXIV.2603.09166}, eprinttype = {arXiv}, eprint = {2603.09166}, timestamp = {Thu, 09 Apr 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2603-09166.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalGrammar index by induced suffix sorting
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2026
Cite (BibTeX)
@article{DBLP:journals/tcs/AkagiKNIBT26, author = {Tooru Akagi and Dominik K{\"{o}}ppl and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Grammar index by induced suffix sorting}, journal = {Theor. Comput. Sci.}, volume = {1082}, pages = {116080}, year = {2026}, url = {https://doi.org/10.1016/j.tcs.2026.116080}, doi = {10.1016/J.TCS.2026.116080}, timestamp = {Thu, 02 Jul 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AkagiKNIBT26.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalNP-Completeness on the Length of Double-Arrays and the Sparse Matrix Problem with at Least Logarithmic Alphabets/Widths
Hideo Bannai, Keisuke Goto, Shunsuke Kanda, Dominik Köppl — Theory Comput. Syst., 2026
Cite (BibTeX)
@article{DBLP:journals/mst/BannaiGKK26, author = {Hideo Bannai and Keisuke Goto and Shunsuke Kanda and Dominik K{\"{o}}ppl}, title = {NP-Completeness on the Length of Double-Arrays and the Sparse Matrix Problem with at Least Logarithmic Alphabets/Widths}, journal = {Theory Comput. Syst.}, volume = {70}, number = {2}, pages = {23}, year = {2026}, url = {https://doi.org/10.1007/s00224-026-10262-1}, doi = {10.1007/S00224-026-10262-1}, timestamp = {Mon, 04 May 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BannaiGKK26.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOn Occurrence-Preserving Morphisms
Kaisei Kishi, Peaker Guo, Cristian Urbina, Hideo Bannai — 37th Annual Symposium on Combinatorial Pattern Matching, CPM 2026, Copenhagen, Denmark, June 15-17, 2026
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/KishiGUB26, author = {Kaisei Kishi and Peaker Guo and Cristian Urbina and Hideo Bannai}, editor = {Philip Bille and Nicola Prezza}, title = {On Occurrence-Preserving Morphisms}, booktitle = {37th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2026, Copenhagen, Denmark, June 15-17, 2026}, series = {LIPIcs}, volume = {369}, pages = {24:1--24:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2026}, url = {https://doi.org/10.4230/LIPIcs.CPM.2026.24}, doi = {10.4230/LIPICS.CPM.2026.24}, timestamp = {Mon, 08 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/KishiGUB26.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintOnline Computation of Palindromes and Suffix Trees on Tries
Hiroki Shibata, Mitsuru Funakoshi, Takuya Mieno, Masakazu Ishihata, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/abs-2601-16485, author = {Hiroki Shibata and Mitsuru Funakoshi and Takuya Mieno and Masakazu Ishihata and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Online Computation of Palindromes and Suffix Trees on Tries}, journal = {CoRR}, volume = {abs/2601.16485}, year = {2026}, url = {https://doi.org/10.48550/arXiv.2601.16485}, doi = {10.48550/ARXIV.2601.16485}, eprinttype = {arXiv}, eprint = {2601.16485}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2601-16485.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOptimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis
Mutsunori Banbara, Hideo Bannai, Takashi Horiyama, Dominik Köppl, Takuya Mieno, Hidetomo Nabeshima — Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning, KR 2026, Lisbon, Portugal, July 20-23, 2026
Cite (BibTeX)
@inproceedings{DBLP:conf/kr/BanbaraBHKMN26, author = {Mutsunori Banbara and Hideo Bannai and Takashi Horiyama and Dominik K{\"{o}}ppl and Takuya Mieno and Hidetomo Nabeshima}, editor = {Renata Wassermann and Marie{-}Laure Mugnier and Franz Baader}, title = {Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis}, booktitle = {Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning, {KR} 2026, Lisbon, Portugal, July 20-23, 2026}, year = {2026}, url = {https://doi.org/10.24963/kr.2026/66}, doi = {10.24963/KR.2026/66}, timestamp = {Tue, 04 Aug 2026 13:18:07 +0200}, biburl = {https://dblp.org/rec/conf/kr/BanbaraBHKMN26.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsSensitivity of Repetitiveness Measures to String Reversal
Hideo Bannai, Yuto Fujie, Peaker Guo, Shunsuke Inenaga, Yuto Nakashima, Simon J. Puglisi, Cristian Urbina — 37th Annual Symposium on Combinatorial Pattern Matching, CPM 2026, Copenhagen, Denmark, June 15-17, 2026
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/BannaiFGINPU26, author = {Hideo Bannai and Yuto Fujie and Peaker Guo and Shunsuke Inenaga and Yuto Nakashima and Simon J. Puglisi and Cristian Urbina}, editor = {Philip Bille and Nicola Prezza}, title = {Sensitivity of Repetitiveness Measures to String Reversal}, booktitle = {37th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2026, Copenhagen, Denmark, June 15-17, 2026}, series = {LIPIcs}, volume = {369}, pages = {17:1--17:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2026}, url = {https://doi.org/10.4230/LIPIcs.CPM.2026.17}, doi = {10.4230/LIPICS.CPM.2026.17}, timestamp = {Thu, 02 Jul 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BannaiFGINPU26.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintString Representation in Suffixient Set Size Space
Hiroki Shibata, Hideo Bannai
Cite (BibTeX)
@article{DBLP:journals/corr/abs-2604-04377, author = {Hiroki Shibata and Hideo Bannai}, title = {String Representation in Suffixient Set Size Space}, journal = {CoRR}, volume = {abs/2604.04377}, year = {2026}, url = {https://doi.org/10.48550/arXiv.2604.04377}, doi = {10.48550/ARXIV.2604.04377}, eprinttype = {arXiv}, eprint = {2604.04377}, timestamp = {Thu, 07 May 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2604-04377.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsThe Smallest String Attractors of Fibonacci and Period-Doubling Words
Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Köppl, Takuya Mieno, Yoshio Okamoto — 37th Annual Symposium on Combinatorial Pattern Matching, CPM 2026, Copenhagen, Denmark, June 15-17, 2026
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/BanbaraBGKMO26, author = {Mutsunori Banbara and Hideo Bannai and Peaker Guo and Dominik K{\"{o}}ppl and Takuya Mieno and Yoshio Okamoto}, editor = {Philip Bille and Nicola Prezza}, title = {The Smallest String Attractors of Fibonacci and Period-Doubling Words}, booktitle = {37th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2026, Copenhagen, Denmark, June 15-17, 2026}, series = {LIPIcs}, volume = {369}, pages = {33:1--33:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2026}, url = {https://doi.org/10.4230/LIPIcs.CPM.2026.33}, doi = {10.4230/LIPICS.CPM.2026.33}, timestamp = {Mon, 08 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BanbaraBGKMO26.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2025
ProceedingsA Survey of the Bijective Burrows-Wheeler Transform
Hideo Bannai, Dominik Köppl, Zsuzsanna Lipták — The Expanding World of Compressed Data: A Festschrift for Giovanni Manzini's 60th Birthday, Manzini's Festschrift, Venice, Italy, July 25, 2025
Cite (BibTeX)
@inproceedings{DBLP:conf/birthday/BannaiKL25, author = {Hideo Bannai and Dominik K{\"{o}}ppl and Zsuzsanna Lipt{\'{a}}k}, editor = {Paolo Ferragina and Travis Gagie and Gonzalo Navarro}, title = {A Survey of the Bijective Burrows-Wheeler Transform}, booktitle = {The Expanding World of Compressed Data: {A} Festschrift for Giovanni Manzini's 60th Birthday, Manzini's Festschrift, Venice, Italy, July 25, 2025}, series = {OASIcs}, volume = {131}, pages = {2:1--2:26}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2025}, url = {https://doi.org/10.4230/OASIcs.Manzini.2}, doi = {10.4230/OASICS.MANZINI.2}, timestamp = {Fri, 28 Nov 2025 09:56:46 +0100}, biburl = {https://dblp.org/rec/conf/birthday/BannaiKL25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalComputing maximal palindromes in non-standard matching models
Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Inf. Comput., 2025
Cite (BibTeX)
@article{DBLP:journals/iandc/MienoFNIBT25, author = {Takuya Mieno and Mitsuru Funakoshi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Computing maximal palindromes in non-standard matching models}, journal = {Inf. Comput.}, volume = {304}, pages = {105283}, year = {2025}, url = {https://doi.org/10.1016/j.ic.2025.105283}, doi = {10.1016/J.IC.2025.105283}, timestamp = {Fri, 07 Mar 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/MienoFNIBT25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsCounting Distinct (Non-)crossing Substrings
Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai — String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/UmezakiSKNIB25, author = {Haruki Umezaki and Hiroki Shibata and Dominik K{\"{o}}ppl and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai}, editor = {Golnaz Badkobeh and Jakub Radoszewski and Nicola Tonellotto and Ricardo Baeza{-}Yates}, title = {Counting Distinct (Non-)crossing Substrings}, booktitle = {String Processing and Information Retrieval - 32nd International Symposium, {SPIRE} 2025, London, UK, September 8-11, 2025, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {16073}, pages = {281--290}, publisher = {Springer}, year = {2025}, url = {https://doi.org/10.1007/978-3-032-05228-5\_22}, doi = {10.1007/978-3-032-05228-5\_22}, timestamp = {Wed, 15 Oct 2025 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/UmezakiSKNIB25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsNet Occurrences in Fibonacci and Thue-Morse Words
Peaker Guo, Kaisei Kishi — 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025, Milan, Italy, June 17-19, 2025
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/GuoK25, author = {Peaker Guo and Kaisei Kishi}, editor = {Paola Bonizzoni and Veli M{\"{a}}kinen}, title = {Net Occurrences in Fibonacci and Thue-Morse Words}, booktitle = {36th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2025, Milan, Italy, June 17-19, 2025}, series = {LIPIcs}, volume = {331}, pages = {16:1--16:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2025}, url = {https://doi.org/10.4230/LIPIcs.CPM.2025.16}, doi = {10.4230/LIPICS.CPM.2025.16}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/cpm/GuoK25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsNyldon Factorization of Thue-Morse Words and Fibonacci Words
Kaisei Kishi, Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai — String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/KishiKNIB25, author = {Kaisei Kishi and Kazuki Kai and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai}, editor = {Golnaz Badkobeh and Jakub Radoszewski and Nicola Tonellotto and Ricardo Baeza{-}Yates}, title = {Nyldon Factorization of Thue-Morse Words and Fibonacci Words}, booktitle = {String Processing and Information Retrieval - 32nd International Symposium, {SPIRE} 2025, London, UK, September 8-11, 2025, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {16073}, pages = {188--201}, publisher = {Springer}, year = {2025}, url = {https://doi.org/10.1007/978-3-032-05228-5\_16}, doi = {10.1007/978-3-032-05228-5\_16}, timestamp = {Wed, 15 Oct 2025 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/KishiKNIB25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOn the Compressiveness of the Burrows-Wheeler Transform
Hideo Bannai, Tomohiro I, Yuto Nakashima — 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025, Milan, Italy, June 17-19, 2025
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/BannaiI025, author = {Hideo Bannai and Tomohiro I and Yuto Nakashima}, editor = {Paola Bonizzoni and Veli M{\"{a}}kinen}, title = {On the Compressiveness of the Burrows-Wheeler Transform}, booktitle = {36th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2025, Milan, Italy, June 17-19, 2025}, series = {LIPIcs}, volume = {331}, pages = {17:1--17:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2025}, url = {https://doi.org/10.4230/LIPIcs.CPM.2025.17}, doi = {10.4230/LIPICS.CPM.2025.17}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BannaiI025.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsText Indexing for Simple Regular Expressions
Hideo Bannai, Philip Bille, Inge Li Gørtz, Gad M. Landau, Gonzalo Navarro, Nicola Prezza, Teresa Anna Steiner, Simon Rumle Tarnow — 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025, Milan, Italy, June 17-19, 2025
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/BannaiBGL0PST25, author = {Hideo Bannai and Philip Bille and Inge Li G{\o}rtz and Gad M. Landau and Gonzalo Navarro and Nicola Prezza and Teresa Anna Steiner and Simon Rumle Tarnow}, editor = {Paola Bonizzoni and Veli M{\"{a}}kinen}, title = {Text Indexing for Simple Regular Expressions}, booktitle = {36th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2025, Milan, Italy, June 17-19, 2025}, series = {LIPIcs}, volume = {331}, pages = {20:1--20:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2025}, url = {https://doi.org/10.4230/LIPIcs.CPM.2025.20}, doi = {10.4230/LIPICS.CPM.2025.20}, timestamp = {Tue, 10 Jun 2025 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BannaiBGL0PST25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2024
ProceedingsBijective BWT Based Compression Schemes
Golnaz Badkobeh, Hideo Bannai, Dominik Köppl — String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings
Journal version: Theory Comput. Syst., 2026
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/BadkobehBK24, author = {Golnaz Badkobeh and Hideo Bannai and Dominik K{\"{o}}ppl}, editor = {Zsuzsanna Lipt{\'{a}}k and Edleno Silva de Moura and Karina Figueroa and Ricardo Baeza{-}Yates}, title = {Bijective {BWT} Based Compression Schemes}, booktitle = {String Processing and Information Retrieval - 31st International Symposium, {SPIRE} 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14899}, pages = {16--25}, publisher = {Springer}, year = {2024}, url = {https://doi.org/10.1007/978-3-031-72200-4\_2}, doi = {10.1007/978-3-031-72200-4\_2}, timestamp = {Thu, 03 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/BadkobehBK24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalComputing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi — Algorithmica, 2024
Cite (BibTeX)
@article{DBLP:journals/algorithmica/BannaiIKKP24, author = {Hideo Bannai and Tomohiro I and Tomasz Kociumaka and Dominik K{\"{o}}ppl and Simon J. Puglisi}, title = {Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences}, journal = {Algorithmica}, volume = {86}, number = {3}, pages = {735--756}, year = {2024}, url = {https://doi.org/10.1007/s00453-023-01125-z}, doi = {10.1007/S00453-023-01125-Z}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BannaiIKKP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing Maximal Palindromes in Non-standard Matching Models
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings
Journal version: Inf. Comput., 2025
Cite (BibTeX)
@inproceedings{DBLP:conf/iwoca/FunakoshiMNIBT24, author = {Mitsuru Funakoshi and Takuya Mieno and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Adele Anna Rescigno and Ugo Vaccaro}, title = {Computing Maximal Palindromes in Non-standard Matching Models}, booktitle = {Combinatorial Algorithms - 35th International Workshop, {IWOCA} 2024, Ischia, Italy, July 1-3, 2024, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14764}, pages = {165--179}, publisher = {Springer}, year = {2024}, url = {https://doi.org/10.1007/978-3-031-63021-7\_13}, doi = {10.1007/978-3-031-63021-7\_13}, timestamp = {Fri, 19 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/FunakoshiMNIBT24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalConstructing and indexing the bijective and extended Burrows-Wheeler transform
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski — Inf. Comput., 2024
Cite (BibTeX)
@article{DBLP:journals/iandc/BannaiKKP24, author = {Hideo Bannai and Juha K{\"{a}}rkk{\"{a}}inen and Dominik K{\"{o}}ppl and Marcin Piatkowski}, title = {Constructing and indexing the bijective and extended Burrows-Wheeler transform}, journal = {Inf. Comput.}, volume = {297}, pages = {105153}, year = {2024}, url = {https://doi.org/10.1016/j.ic.2024.105153}, doi = {10.1016/J.IC.2024.105153}, timestamp = {Tue, 18 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/BannaiKKP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsEdit and Alphabet-Ordering Sensitivity of Lex-Parse
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai — 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, August 26-30, 2024
Cite (BibTeX)
@inproceedings{DBLP:conf/mfcs/0001KFIB24, author = {Yuto Nakashima and Dominik K{\"{o}}ppl and Mitsuru Funakoshi and Shunsuke Inenaga and Hideo Bannai}, editor = {Rastislav Kr{\'{a}}lovic and Anton{\'{\i}}n Kucera}, title = {Edit and Alphabet-Ordering Sensitivity of Lex-Parse}, booktitle = {49th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2024, Bratislava, Slovakia, August 26-30, 2024}, series = {LIPIcs}, volume = {306}, pages = {75:1--75:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2024}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2024.75}, doi = {10.4230/LIPICS.MFCS.2024.75}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/0001KFIB24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsExploiting New Properties of String Net Frequency for Efficient Computation
Peaker Guo, Patrick Eades, Anthony Wirth, Justin Zobel — 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, Fukuoka, Japan, June 25-27, 2024
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/GuoEWZ24, author = {Peaker Guo and Patrick Eades and Anthony Wirth and Justin Zobel}, editor = {Shunsuke Inenaga and Simon J. Puglisi}, title = {Exploiting New Properties of String Net Frequency for Efficient Computation}, booktitle = {35th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2024, Fukuoka, Japan, June 25-27, 2024}, series = {LIPIcs}, volume = {296}, pages = {16:1--16:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2024}, url = {https://doi.org/10.4230/LIPIcs.CPM.2024.16}, doi = {10.4230/LIPICS.CPM.2024.16}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/cpm/GuoEWZ24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalFaster space-efficient STR-IC-LCS computation
Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai — Theor. Comput. Sci., 2024
Cite (BibTeX)
@article{DBLP:journals/tcs/YonemotoNIB24, author = {Yuki Yonemoto and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai}, title = {Faster space-efficient {STR-IC-LCS} computation}, journal = {Theor. Comput. Sci.}, volume = {1003}, pages = {114607}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114607}, doi = {10.1016/J.TCS.2024.114607}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/YonemotoNIB24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsHeight-Bounded Lempel-Ziv Encodings
Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi — 32nd Annual European Symposium on Algorithms, ESA 2024, Royal Holloway, London, United Kingdom, September 2-4, 2024
ESA 2024 Best Paper Award (Track B)
Cite (BibTeX)
@inproceedings{DBLP:conf/esa/BannaiFHMP24, author = {Hideo Bannai and Mitsuru Funakoshi and Diptarama Hendrian and Myuji Matsuda and Simon J. Puglisi}, editor = {Timothy M. Chan and Johannes Fischer and John Iacono and Grzegorz Herman}, title = {Height-Bounded Lempel-Ziv Encodings}, booktitle = {32nd Annual European Symposium on Algorithms, {ESA} 2024, Royal Holloway, London, United Kingdom, September 2-4, 2024}, series = {LIPIcs}, volume = {308}, pages = {18:1--18:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2024}, url = {https://doi.org/10.4230/LIPIcs.ESA.2024.18}, doi = {10.4230/LIPICS.ESA.2024.18}, timestamp = {Tue, 21 Apr 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/BannaiFHMP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsMaintaining the Size of LZ77 on Semi-Dynamic Strings
Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski — 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, Fukuoka, Japan, June 25-27, 2024
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/BannaiCR24, author = {Hideo Bannai and Panagiotis Charalampopoulos and Jakub Radoszewski}, editor = {Shunsuke Inenaga and Simon J. Puglisi}, title = {Maintaining the Size of {LZ77} on Semi-Dynamic Strings}, booktitle = {35th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2024, Fukuoka, Japan, June 25-27, 2024}, series = {LIPIcs}, volume = {296}, pages = {3:1--3:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2024}, url = {https://doi.org/10.4230/LIPIcs.CPM.2024.3}, doi = {10.4230/LIPICS.CPM.2024.3}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/cpm/BannaiCR24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintNP-Completeness for the Space-Optimality of Double-Array Tries
Hideo Bannai, Keisuke Goto, Shunsuke Kanda, Dominik Köppl
Cite (BibTeX)
@article{DBLP:journals/corr/abs-2403-04951, author = {Hideo Bannai and Keisuke Goto and Shunsuke Kanda and Dominik K{\"{o}}ppl}, title = {NP-Completeness for the Space-Optimality of Double-Array Tries}, journal = {CoRR}, volume = {abs/2403.04951}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2403.04951}, doi = {10.48550/ARXIV.2403.04951}, eprinttype = {arXiv}, eprint = {2403.04951}, timestamp = {Wed, 03 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2403-04951.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOn the Hardness of Smallest RLSLPs and Collage Systems
Akiyoshi Kawamoto, Tomohiro I, Dominik Köppl, Hideo Bannai — Data Compression Conference, DCC 2024, Snowbird, UT, USA, March 19-22, 2024
Cite (BibTeX)
@inproceedings{DBLP:conf/dcc/KawamotoIKB24, author = {Akiyoshi Kawamoto and Tomohiro I and Dominik K{\"{o}}ppl and Hideo Bannai}, editor = {Ali Bilgin and James E. Fowler and Joan Serra{-}Sagrist{\`{a}} and Yan Ye and James A. Storer}, title = {On the Hardness of Smallest RLSLPs and Collage Systems}, booktitle = {Data Compression Conference, {DCC} 2024, Snowbird, UT, USA, March 19-22, 2024}, pages = {243--252}, publisher = {{IEEE}}, year = {2024}, url = {https://doi.org/10.1109/DCC58796.2024.00032}, doi = {10.1109/DCC58796.2024.00032}, timestamp = {Fri, 24 May 2024 14:12:56 +0200}, biburl = {https://dblp.org/rec/conf/dcc/KawamotoIKB24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOn the Number of Non-equivalent Parameterized Squares in a String
Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai — String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/HamaiTNIB24, author = {Rikuya Hamai and Kazushi Taketsugu and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai}, editor = {Zsuzsanna Lipt{\'{a}}k and Edleno Silva de Moura and Karina Figueroa and Ricardo Baeza{-}Yates}, title = {On the Number of Non-equivalent Parameterized Squares in a String}, booktitle = {String Processing and Information Retrieval - 31st International Symposium, {SPIRE} 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14899}, pages = {174--183}, publisher = {Springer}, year = {2024}, url = {https://doi.org/10.1007/978-3-031-72200-4\_13}, doi = {10.1007/978-3-031-72200-4\_13}, timestamp = {Thu, 03 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/HamaiTNIB24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOnline Computation of String Net Frequency
Peaker Guo, Seeun William Umboh, Anthony Wirth, Justin Zobel — String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/GuoUWZ24, author = {Peaker Guo and Seeun William Umboh and Anthony Wirth and Justin Zobel}, editor = {Zsuzsanna Lipt{\'{a}}k and Edleno Silva de Moura and Karina Figueroa and Ricardo Baeza{-}Yates}, title = {Online Computation of String Net Frequency}, booktitle = {String Processing and Information Retrieval - 31st International Symposium, {SPIRE} 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14899}, pages = {159--173}, publisher = {Springer}, year = {2024}, url = {https://doi.org/10.1007/978-3-031-72200-4\_12}, doi = {10.1007/978-3-031-72200-4\_12}, timestamp = {Thu, 03 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/GuoUWZ24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalPfp-fm: an accelerated FM-index
Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie — Algorithms Mol. Biol., 2024
Cite (BibTeX)
@article{DBLP:journals/almob/HongOKBBG24, author = {Aaron Hong and Marco Oliva and Dominik K{\"{o}}ppl and Hideo Bannai and Christina Boucher and Travis Gagie}, title = {Pfp-fm: an accelerated FM-index}, journal = {Algorithms Mol. Biol.}, volume = {19}, number = {1}, pages = {15}, year = {2024}, url = {https://doi.org/10.1186/s13015-024-00260-8}, doi = {10.1186/S13015-024-00260-8}, timestamp = {Thu, 07 May 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/almob/HongOKBBG24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2023
ProceedingsAcceleration of FM-Index Queries Through Prefix-Free Parsing
Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie — 23rd International Workshop on Algorithms in Bioinformatics, WABI 2023, Houston, TX, USA, September 4-6, 2023
Cite (BibTeX)
@inproceedings{DBLP:conf/wabi/HongOKBBG23, author = {Aaron Hong and Marco Oliva and Dominik K{\"{o}}ppl and Hideo Bannai and Christina Boucher and Travis Gagie}, editor = {Djamal Belazzougui and A{\"{\i}}da Ouangraoua}, title = {Acceleration of FM-Index Queries Through Prefix-Free Parsing}, booktitle = {23rd International Workshop on Algorithms in Bioinformatics, {WABI} 2023, Houston, TX, USA, September 4-6, 2023}, series = {LIPIcs}, volume = {273}, pages = {13:1--13:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.WABI.2023.13}, doi = {10.4230/LIPICS.WABI.2023.13}, timestamp = {Thu, 07 May 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wabi/HongOKBBG23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalLinear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2023
Cite (BibTeX)
@article{DBLP:journals/tcs/FujishigeTIBT23, author = {Yuta Fujishige and Yuki Tsujimaru and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets}, journal = {Theor. Comput. Sci.}, volume = {973}, pages = {114093}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.114093}, doi = {10.1016/J.TCS.2023.114093}, timestamp = {Thu, 14 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/FujishigeTIBT23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsLinear-Time Computation of Generalized Minimal Absent Words for Multiple Strings
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai — String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/OkabeMNIB23, author = {Kouta Okabe and Takuya Mieno and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai}, editor = {Franco Maria Nardini and Nadia Pisanti and Rossano Venturini}, title = {Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings}, booktitle = {String Processing and Information Retrieval - 30th International Symposium, {SPIRE} 2023, Pisa, Italy, September 26-28, 2023, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14240}, pages = {331--344}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43980-3\_27}, doi = {10.1007/978-3-031-43980-3\_27}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/OkabeMNIB23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalLongest bordered and periodic subsequences
Hideo Bannai, Tomohiro I, Dominik Köppl — Inf. Process. Lett., 2023
Cite (BibTeX)
@article{DBLP:journals/ipl/BannaiIK23, author = {Hideo Bannai and Tomohiro I and Dominik K{\"{o}}ppl}, title = {Longest bordered and periodic subsequences}, journal = {Inf. Process. Lett.}, volume = {182}, pages = {106398}, year = {2023}, url = {https://doi.org/10.1016/j.ipl.2023.106398}, doi = {10.1016/J.IPL.2023.106398}, timestamp = {Tue, 12 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BannaiIK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsLyndon Arrays in Sublinear Time
Hideo Bannai, Jonas Ellert — 31st Annual European Symposium on Algorithms, ESA 2023, Amsterdam, The Netherlands, September 4-6, 2023
Cite (BibTeX)
@inproceedings{DBLP:conf/esa/BannaiE23, author = {Hideo Bannai and Jonas Ellert}, editor = {Inge Li G{\o}rtz and Martin Farach{-}Colton and Simon J. Puglisi and Grzegorz Herman}, title = {Lyndon Arrays in Sublinear Time}, booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, Amsterdam, The Netherlands, September 4-6, 2023}, series = {LIPIcs}, volume = {274}, pages = {14:1--14:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ESA.2023.14}, doi = {10.4230/LIPICS.ESA.2023.14}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/esa/BannaiE23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOptimal LZ-End Parsing Is Hard
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno — 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, Marne-la-Vallée, France, June 26-28, 2023
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/BannaiFKNSU23, author = {Hideo Bannai and Mitsuru Funakoshi and Kazuhiro Kurita and Yuto Nakashima and Kazuhisa Seto and Takeaki Uno}, editor = {Laurent Bulteau and Zsuzsanna Lipt{\'{a}}k}, title = {Optimal LZ-End Parsing Is Hard}, booktitle = {34th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2023, Marne-la-Vall{\'{e}}e, France, June 26-28, 2023}, series = {LIPIcs}, volume = {259}, pages = {3:1--3:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.CPM.2023.3}, doi = {10.4230/LIPICS.CPM.2023.3}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BannaiFKNSU23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintSliding suffix trees simplified
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
Cite (BibTeX)
@article{DBLP:journals/corr/abs-2307-01412, author = {Laurentius Leonard and Shunsuke Inenaga and Hideo Bannai and Takuya Mieno}, title = {Sliding suffix trees simplified}, journal = {CoRR}, volume = {abs/2307.01412}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2307.01412}, doi = {10.48550/ARXIV.2307.01412}, eprinttype = {arXiv}, eprint = {2307.01412}, timestamp = {Mon, 10 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2307-01412.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsSpace-Efficient STR-IC-LCS Computation
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai — SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/sofsem/YonemotoNIB23, author = {Yuuki Yonemoto and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai}, editor = {Leszek Gasieniec}, title = {Space-Efficient {STR-IC-LCS} Computation}, booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, {SOFSEM} 2023, Nov{\'{y}} Smokovec, Slovakia, January 15-18, 2023, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13878}, pages = {372--384}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-23101-8\_25}, doi = {10.1007/978-3-031-23101-8\_25}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/YonemotoNIB23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2022
Proceedings33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, Prague, Czech Republic, June 27-29, 2022
— Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022
Cite (BibTeX)
@proceedings{DBLP:conf/cpm/2022, editor = {Hideo Bannai and Jan Holub}, title = {33rd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2022, Prague, Czech Republic, June 27-29, 2022}, series = {LIPIcs}, volume = {223}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://www.dagstuhl.de/dagpub/978-3-95977-234-1}, isbn = {978-3-95977-234-1}, timestamp = {Fri, 21 Nov 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/2022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }Journalc-trie++: A dynamic trie tailored for fast prefix searches
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Inf. Comput., 2022
Cite (BibTeX)
@article{DBLP:journals/iandc/TsurutaKKNIBT22, author = {Kazuya Tsuruta and Dominik K{\"{o}}ppl and Shunsuke Kanda and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {c-trie++: {A} dynamic trie tailored for fast prefix searches}, journal = {Inf. Comput.}, volume = {285}, number = {Part}, pages = {104794}, year = {2022}, url = {https://doi.org/10.1016/j.ic.2021.104794}, doi = {10.1016/J.IC.2021.104794}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/TsurutaKKNIBT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalCombinatorics of minimal absent words for a sliding window
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2022
Cite (BibTeX)
@article{DBLP:journals/tcs/AkagiKMNIBT22, author = {Tooru Akagi and Yuki Kuhara and Takuya Mieno and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Combinatorics of minimal absent words for a sliding window}, journal = {Theor. Comput. Sci.}, volume = {927}, pages = {109--119}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.06.002}, doi = {10.1016/J.TCS.2022.06.002}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AkagiKMNIBT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing Longest (Common) Lyndon Subsequences
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi — Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings
IWOCA 2022 Best Paper Award
Cite (BibTeX)
@inproceedings{DBLP:conf/iwoca/BannaiIKKP22, author = {Hideo Bannai and Tomohiro I and Tomasz Kociumaka and Dominik K{\"{o}}ppl and Simon J. Puglisi}, editor = {Cristina Bazgan and Henning Fernau}, title = {Computing Longest (Common) Lyndon Subsequences}, booktitle = {Combinatorial Algorithms - 33rd International Workshop, {IWOCA} 2022, Trier, Germany, June 7-9, 2022, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13270}, pages = {128--142}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-06678-8\_10}, doi = {10.1007/978-3-031-06678-8\_10}, timestamp = {Mon, 13 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/BannaiIKKP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintComputing maximal generalized palindromes
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/abs-2210-02067, author = {Mitsuru Funakoshi and Takuya Mieno and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Computing maximal generalized palindromes}, journal = {CoRR}, volume = {abs/2210.02067}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2210.02067}, doi = {10.48550/ARXIV.2210.02067}, eprinttype = {arXiv}, eprint = {2210.02067}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2210-02067.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalComputing Minimal Unique Substrings for a Sliding Window
Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Algorithmica, 2022
Cite (BibTeX)
@article{DBLP:journals/algorithmica/MienoFNIBT22, author = {Takuya Mieno and Yuta Fujishige and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Computing Minimal Unique Substrings for a Sliding Window}, journal = {Algorithmica}, volume = {84}, number = {3}, pages = {670--693}, year = {2022}, url = {https://doi.org/10.1007/s00453-021-00864-1}, doi = {10.1007/S00453-021-00864-1}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/MienoFNIBT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing NP-Hard Repetitiveness Measures via MAX-SAT
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto — 30th Annual European Symposium on Algorithms, ESA 2022, Berlin/Potsdam, Germany, September 5-9, 2022
Journal version: ACM Trans. Algorithms, 2026
Cite (BibTeX)
@inproceedings{DBLP:conf/esa/Bannai0IKKN22, author = {Hideo Bannai and Keisuke Goto and Masakazu Ishihata and Shunsuke Kanda and Dominik K{\"{o}}ppl and Takaaki Nishimoto}, editor = {Shiri Chechik and Gonzalo Navarro and Eva Rotenberg and Grzegorz Herman}, title = {Computing NP-Hard Repetitiveness Measures via {MAX-SAT}}, booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, Berlin/Potsdam, Germany, September 5-9, 2022}, series = {LIPIcs}, volume = {244}, pages = {12:1--12:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ESA.2022.12}, doi = {10.4230/LIPICS.ESA.2022.12}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/esa/Bannai0IKKN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalFactorizing Strings into Repetitions
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theory Comput. Syst., 2022
Cite (BibTeX)
@article{DBLP:journals/mst/InoueMNIBT22, author = {Hiroe Inoue and Yoshiaki Matsuoka and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Factorizing Strings into Repetitions}, journal = {Theory Comput. Syst.}, volume = {66}, number = {2}, pages = {484--501}, year = {2022}, url = {https://doi.org/10.1007/s00224-022-10070-3}, doi = {10.1007/S00224-022-10070-3}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/InoueMNIBT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintLongest (Sub-)Periodic Subsequence
Hideo Bannai, Tomohiro I, Dominik Köppl
Cite (BibTeX)
@article{DBLP:journals/corr/abs-2202-07189, author = {Hideo Bannai and Tomohiro I and Dominik K{\"{o}}ppl}, title = {Longest (Sub-)Periodic Subsequence}, journal = {CoRR}, volume = {abs/2202.07189}, year = {2022}, url = {https://arxiv.org/abs/2202.07189}, eprinttype = {arXiv}, eprint = {2202.07189}, timestamp = {Fri, 18 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-07189.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOnline Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno — String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8-10, 2022, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/LeonardIBM22, author = {Laurentius Leonard and Shunsuke Inenaga and Hideo Bannai and Takuya Mieno}, editor = {Diego Arroyuelo and Barbara Poblete}, title = {Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions}, booktitle = {String Processing and Information Retrieval - 29th International Symposium, {SPIRE} 2022, Concepci{\'{o}}n, Chile, November 8-10, 2022, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13617}, pages = {24--37}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-20643-6\_3}, doi = {10.1007/978-3-031-20643-6\_3}, timestamp = {Sun, 13 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/spire/LeonardIBM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalOrder-preserving pattern matching indeterminate strings
Luı́s M. S. Russo, Diogo M. Costa, Rui Henriques, Hideo Bannai, Alexandre P. Francisco — Inf. Comput., 2022
Cite (BibTeX)
@article{DBLP:journals/iandc/RussoCHBF22, author = {Lu{\'{\i}}s M. S. Russo and Diogo M. Costa and Rui Henriques and Hideo Bannai and Alexandre P. Francisco}, title = {Order-preserving pattern matching indeterminate strings}, journal = {Inf. Comput.}, volume = {289}, number = {Part}, pages = {104924}, year = {2022}, url = {https://doi.org/10.1016/j.ic.2022.104924}, doi = {10.1016/J.IC.2022.104924}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/RussoCHBF22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalPalindromic trees for a sliding window and its applications
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Inf. Process. Lett., 2022
Cite (BibTeX)
@article{DBLP:journals/ipl/MienoWNIBT22, author = {Takuya Mieno and Kiichi Watanabe and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Palindromic trees for a sliding window and its applications}, journal = {Inf. Process. Lett.}, volume = {173}, pages = {106174}, year = {2022}, url = {https://doi.org/10.1016/j.ipl.2021.106174}, doi = {10.1016/J.IPL.2021.106174}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MienoWNIBT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalParameterized DAWGs: Efficient constructions and bidirectional pattern searches
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda — Theor. Comput. Sci., 2022
Cite (BibTeX)
@article{DBLP:journals/tcs/NakashimaFHNYIB22, author = {Katsuhito Nakashima and Noriki Fujisato and Diptarama Hendrian and Yuto Nakashima and Ryo Yoshinaka and Shunsuke Inenaga and Hideo Bannai and Ayumi Shinohara and Masayuki Takeda}, title = {Parameterized DAWGs: Efficient constructions and bidirectional pattern searches}, journal = {Theor. Comput. Sci.}, volume = {933}, pages = {21--42}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.09.008}, doi = {10.1016/J.TCS.2022.09.008}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/NakashimaFHNYIB22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2021
ProceedingsA Separation of γ and b via Thue-Morse Words
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto — String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/BannaiFIKMN21, author = {Hideo Bannai and Mitsuru Funakoshi and Tomohiro I and Dominik K{\"{o}}ppl and Takuya Mieno and Takaaki Nishimoto}, editor = {Thierry Lecroq and H{\'{e}}l{\`{e}}ne Touzet}, title = {A Separation of {\(\gamma\)} and b via Thue-Morse Words}, booktitle = {String Processing and Information Retrieval - 28th International Symposium, {SPIRE} 2021, Lille, France, October 4-6, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12944}, pages = {167--178}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86692-1\_14}, doi = {10.1007/978-3-030-86692-1\_14}, timestamp = {Tue, 05 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/BannaiFIKMN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalCompressed Communication Complexity of Hamming Distance
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Algorithms, 2021
Cite (BibTeX)
@article{DBLP:journals/algorithms/MitsuyaNIBT21, author = {Shiori Mitsuya and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Compressed Communication Complexity of Hamming Distance}, journal = {Algorithms}, volume = {14}, number = {4}, pages = {116}, year = {2021}, url = {https://doi.org/10.3390/a14040116}, doi = {10.3390/A14040116}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithms/MitsuyaNIBT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalComputing longest palindromic substring after single-character or block-wise edits
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2021
Cite (BibTeX)
@article{DBLP:journals/tcs/FunakoshiNIBT21, author = {Mitsuru Funakoshi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Computing longest palindromic substring after single-character or block-wise edits}, journal = {Theor. Comput. Sci.}, volume = {859}, pages = {116--133}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.01.014}, doi = {10.1016/J.TCS.2021.01.014}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/FunakoshiNIBT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsConstructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski — 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, Wrocław, Poland, July 5-7, 2021
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/BannaiKKP21, author = {Hideo Bannai and Juha K{\"{a}}rkk{\"{a}}inen and Dominik K{\"{o}}ppl and Marcin Piatkowski}, editor = {Pawel Gawrychowski and Tatiana Starikovskaya}, title = {Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time}, booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021, Wroc{\l}aw, Poland, July 5-7, 2021}, series = {LIPIcs}, volume = {191}, pages = {7:1--7:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.CPM.2021.7}, doi = {10.4230/LIPICS.CPM.2021.7}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BannaiKKP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalEfficiently computing runs on a trie
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2021
Cite (BibTeX)
@article{DBLP:journals/tcs/SugaharaNIBT21, author = {Ryo Sugahara and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Efficiently computing runs on a trie}, journal = {Theor. Comput. Sci.}, volume = {887}, pages = {143--151}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.07.011}, doi = {10.1016/J.TCS.2021.07.011}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/SugaharaNIBT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsGrammar Index by Induced Suffix Sorting
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings
Journal version: Theor. Comput. Sci., 2026
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/AkagiKNIBT21, author = {Tooru Akagi and Dominik K{\"{o}}ppl and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Thierry Lecroq and H{\'{e}}l{\`{e}}ne Touzet}, title = {Grammar Index by Induced Suffix Sorting}, booktitle = {String Processing and Information Retrieval - 28th International Symposium, {SPIRE} 2021, Lille, France, October 4-6, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12944}, pages = {85--99}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86692-1\_8}, doi = {10.1007/978-3-030-86692-1\_8}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/AkagiKNIBT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsLongest Common Rollercoasters
Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/FujitaNIBT21, author = {Kosuke Fujita and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Thierry Lecroq and H{\'{e}}l{\`{e}}ne Touzet}, title = {Longest Common Rollercoasters}, booktitle = {String Processing and Information Retrieval - 28th International Symposium, {SPIRE} 2021, Lille, France, October 4-6, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12944}, pages = {21--32}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86692-1\_3}, doi = {10.1007/978-3-030-86692-1\_3}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/FujitaNIBT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalLongest previous overlapping factor array
Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar — Inf. Process. Lett., 2021
Cite (BibTeX)
@article{DBLP:journals/ipl/BannaiIM21, author = {Hideo Bannai and Shunsuke Inenaga and Neerja Mhaskar}, title = {Longest previous overlapping factor array}, journal = {Inf. Process. Lett.}, volume = {168}, pages = {106097}, year = {2021}, url = {https://doi.org/10.1016/j.ipl.2021.106097}, doi = {10.1016/J.IPL.2021.106097}, timestamp = {Thu, 29 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BannaiIM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsRepetitions in Strings: A "Constant" Problem (Invited Talk)
Hideo Bannai — 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, Wrocław, Poland, July 5-7, 2021
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/Bannai21, author = {Hideo Bannai}, editor = {Pawel Gawrychowski and Tatiana Starikovskaya}, title = {Repetitions in Strings: {A} "Constant" Problem (Invited Talk)}, booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021, Wroc{\l}aw, Poland, July 5-7, 2021}, series = {LIPIcs}, volume = {191}, pages = {1:1--1:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.CPM.2021.1}, doi = {10.4230/LIPICS.CPM.2021.1}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/cpm/Bannai21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsThe Parameterized Suffix Tray
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/ciac/FujisatoNIBT21, author = {Noriki Fujisato and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Tiziana Calamoneri and Federico Cor{\`{o}}}, title = {The Parameterized Suffix Tray}, booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC} 2021, Virtual Event, May 10-12, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12701}, pages = {258--270}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-75242-2\_18}, doi = {10.1007/978-3-030-75242-2\_18}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ciac/FujisatoNIBT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalThe Smallest Grammar Problem Revisited
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh — IEEE Trans. Inf. Theory, 2021
Cite (BibTeX)
@article{DBLP:journals/tit/BannaiHHIJLR21, author = {Hideo Bannai and Momoko Hirayama and Danny Hucke and Shunsuke Inenaga and Artur Jez and Markus Lohrey and Carl Philipp Reh}, title = {The Smallest Grammar Problem Revisited}, journal = {{IEEE} Trans. Inf. Theory}, volume = {67}, number = {1}, pages = {317--328}, year = {2021}, url = {https://doi.org/10.1109/TIT.2020.3038147}, doi = {10.1109/TIT.2020.3038147}, timestamp = {Tue, 23 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/BannaiHHIJLR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2020
Proceedingsc-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Data Compression Conference, DCC 2020, Snowbird, UT, USA, March 24-27, 2020
Journal version: Inf. Comput., 2022
Cite (BibTeX)
@inproceedings{DBLP:conf/dcc/TsurutaKKNIBT20, author = {Kazuya Tsuruta and Dominik K{\"{o}}ppl and Shunsuke Kanda and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Ali Bilgin and Michael W. Marcellin and Joan Serra{-}Sagrist{\`{a}} and James A. Storer}, title = {c-Trie++: {A} Dynamic Trie Tailored for Fast Prefix Searches}, booktitle = {Data Compression Conference, {DCC} 2020, Snowbird, UT, USA, March 24-27, 2020}, pages = {243--252}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/DCC47342.2020.00032}, doi = {10.1109/DCC47342.2020.00032}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dcc/TsurutaKKNIBT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintComputing Palindromic Trees for a Sliding Window and Its Applications
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/abs-2006-02134, author = {Takuya Mieno and Kiichi Watanabe and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Computing Palindromic Trees for a Sliding Window and Its Applications}, journal = {CoRR}, volume = {abs/2006.02134}, year = {2020}, url = {https://arxiv.org/abs/2006.02134}, eprinttype = {arXiv}, eprint = {2006.02134}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-02134.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsDAWGs for Parameterized Matching: Online Construction and Related Indexing Structures
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda — 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, Copenhagen, Denmark, June 17-19, 2020
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/NakashimaFHNYIB20, author = {Katsuhito Nakashima and Noriki Fujisato and Diptarama Hendrian and Yuto Nakashima and Ryo Yoshinaka and Shunsuke Inenaga and Hideo Bannai and Ayumi Shinohara and Masayuki Takeda}, editor = {Inge Li G{\o}rtz and Oren Weimann}, title = {DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures}, booktitle = {31st Annual Symposium on Combinatorial Pattern Matching, {CPM} 2020, Copenhagen, Denmark, June 17-19, 2020}, series = {LIPIcs}, volume = {161}, pages = {26:1--26:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.CPM.2020.26}, doi = {10.4230/LIPICS.CPM.2020.26}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/NakashimaFHNYIB20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsDetecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara — 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, Copenhagen, Denmark, June 17-19, 2020
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/FunakoshiNIBTS20, author = {Mitsuru Funakoshi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda and Ayumi Shinohara}, editor = {Inge Li G{\o}rtz and Oren Weimann}, title = {Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences}, booktitle = {31st Annual Symposium on Combinatorial Pattern Matching, {CPM} 2020, Copenhagen, Denmark, June 17-19, 2020}, series = {LIPIcs}, volume = {161}, pages = {12:1--12:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.CPM.2020.12}, doi = {10.4230/LIPICS.CPM.2020.12}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/cpm/FunakoshiNIBTS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalDynamic index and LZ factorization in compressed space
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Discret. Appl. Math., 2020
Cite (BibTeX)
@article{DBLP:journals/dam/NishimotoIIBT20, author = {Takaaki Nishimoto and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Dynamic index and {LZ} factorization in compressed space}, journal = {Discret. Appl. Math.}, volume = {274}, pages = {116--129}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.01.014}, doi = {10.1016/J.DAM.2019.01.014}, timestamp = {Sun, 19 Jan 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/NishimotoIIBT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalFast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theory Comput. Syst., 2020
Cite (BibTeX)
@article{DBLP:journals/mst/WatanabeNIBT20, author = {Kiichi Watanabe and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings}, journal = {Theory Comput. Syst.}, volume = {64}, number = {7}, pages = {1273--1291}, year = {2020}, url = {https://doi.org/10.1007/s00224-020-09980-x}, doi = {10.1007/S00224-020-09980-X}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/WatanabeNIBT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFaster STR-EC-LCS Computation
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/sofsem/YamadaNIBT20, author = {Kohei Yamada and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Alexander Chatzigeorgiou and Riccardo Dondi and Herodotos Herodotou and Christos A. Kapoutsis and Yannis Manolopoulos and George A. Papadopoulos and Florian Sikora}, title = {Faster {STR-EC-LCS} Computation}, booktitle = {{SOFSEM} 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, {SOFSEM} 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12011}, pages = {125--135}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-38919-2\_11}, doi = {10.1007/978-3-030-38919-2\_11}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/YamadaNIBT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalFinding all maximal perfect haplotype blocks in linear time
Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye — Algorithms Mol. Biol., 2020
Cite (BibTeX)
@article{DBLP:journals/almob/AlankoBCPS20, author = {Jarno Alanko and Hideo Bannai and Bastien Cazaux and Pierre Peterlongo and Jens Stoye}, title = {Finding all maximal perfect haplotype blocks in linear time}, journal = {Algorithms Mol. Biol.}, volume = {15}, number = {1}, pages = {2}, year = {2020}, url = {https://doi.org/10.1186/s13015-020-0163-6}, doi = {10.1186/S13015-020-0163-6}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/almob/AlankoBCPS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintGrammar-compressed Self-index with Lyndon Words
Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/abs-2004-05309, author = {Kazuya Tsuruta and Dominik K{\"{o}}ppl and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Grammar-compressed Self-index with Lyndon Words}, journal = {CoRR}, volume = {abs/2004.05309}, year = {2020}, url = {https://arxiv.org/abs/2004.05309}, eprinttype = {arXiv}, eprint = {2004.05309}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2004-05309.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsLongest Square Subsequence Problem Revisited
Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai — String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/InoueIB20, author = {Takafumi Inoue and Shunsuke Inenaga and Hideo Bannai}, editor = {Christina Boucher and Sharma V. Thankachan}, title = {Longest Square Subsequence Problem Revisited}, booktitle = {String Processing and Information Retrieval - 27th International Symposium, {SPIRE} 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12303}, pages = {147--154}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-59212-7\_11}, doi = {10.1007/978-3-030-59212-7\_11}, timestamp = {Sat, 19 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/InoueIB20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsLyndon Words, the Three Squares Lemma, and Primitive Squares
Hideo Bannai, Takuya Mieno, Yuto Nakashima — String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/BannaiMN20, author = {Hideo Bannai and Takuya Mieno and Yuto Nakashima}, editor = {Christina Boucher and Sharma V. Thankachan}, title = {Lyndon Words, the Three Squares Lemma, and Primitive Squares}, booktitle = {String Processing and Information Retrieval - 27th International Symposium, {SPIRE} 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12303}, pages = {265--273}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-59212-7\_19}, doi = {10.1007/978-3-030-59212-7\_19}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/BannaiMN20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsMinimal Unique Substrings and Minimal Absent Words in a Sliding Window
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/sofsem/MienoKAFNIBT20, author = {Takuya Mieno and Yuki Kuhara and Tooru Akagi and Yuta Fujishige and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Alexander Chatzigeorgiou and Riccardo Dondi and Herodotos Herodotou and Christos A. Kapoutsis and Yannis Manolopoulos and George A. Papadopoulos and Florian Sikora}, title = {Minimal Unique Substrings and Minimal Absent Words in a Sliding Window}, booktitle = {{SOFSEM} 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, {SOFSEM} 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12011}, pages = {148--160}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-38919-2\_13}, doi = {10.1007/978-3-030-38919-2\_13}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/MienoKAFNIBT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalMore Time-Space Tradeoffs for Finding a Shortest Unique Substring
Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luı́s M. S. Russo — Algorithms, 2020
Cite (BibTeX)
@article{DBLP:journals/algorithms/BannaiGHPR20, author = {Hideo Bannai and Travis Gagie and Gary Hoppenworth and Simon J. Puglisi and Lu{\'{\i}}s M. S. Russo}, title = {More Time-Space Tradeoffs for Finding a Shortest Unique Substring}, journal = {Algorithms}, volume = {13}, number = {9}, pages = {234}, year = {2020}, url = {https://doi.org/10.3390/a13090234}, doi = {10.3390/A13090234}, timestamp = {Mon, 16 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithms/BannaiGHPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOn Repetitiveness Measures of Thue-Morse Words
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings
SPIRE 2020 Best Paper Award
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/KutsukakeMNIBT20, author = {Kanaru Kutsukake and Takuya Matsumoto and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Christina Boucher and Sharma V. Thankachan}, title = {On Repetitiveness Measures of Thue-Morse Words}, booktitle = {String Processing and Information Retrieval - 27th International Symposium, {SPIRE} 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12303}, pages = {213--220}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-59212-7\_15}, doi = {10.1007/978-3-030-59212-7\_15}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/KutsukakeMNIBT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalPractical Grammar Compression Based on Maximal Repeats
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida — Algorithms, 2020
Cite (BibTeX)
@article{DBLP:journals/algorithms/FuruyaTNIBK20, author = {Isamu Furuya and Takuya Takagi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Takuya Kida}, title = {Practical Grammar Compression Based on Maximal Repeats}, journal = {Algorithms}, volume = {13}, number = {4}, pages = {103}, year = {2020}, url = {https://doi.org/10.3390/a13040103}, doi = {10.3390/A13040103}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithms/FuruyaTNIBK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalRefining the <i>r</i>-index
Hideo Bannai, Travis Gagie, Tomohiro I — Theor. Comput. Sci., 2020
Cite (BibTeX)
@article{DBLP:journals/tcs/BannaiGI20, author = {Hideo Bannai and Travis Gagie and Tomohiro I}, title = {Refining the \emph{r}-index}, journal = {Theor. Comput. Sci.}, volume = {812}, pages = {96--108}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2019.08.005}, doi = {10.1016/J.TCS.2019.08.005}, timestamp = {Tue, 03 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BannaiGI20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalSpace-efficient algorithms for computing minimal/shortest unique substrings
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2020
Cite (BibTeX)
@article{DBLP:journals/tcs/MienoKNIBT20, author = {Takuya Mieno and Dominik K{\"{o}}ppl and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Space-efficient algorithms for computing minimal/shortest unique substrings}, journal = {Theor. Comput. Sci.}, volume = {845}, pages = {230--242}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2020.09.017}, doi = {10.1016/J.TCS.2020.09.017}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/MienoKNIBT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsTowards Efficient Interactive Computation of Dynamic Time Warping Distance
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/NishiNIBT20, author = {Akihiro Nishi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Christina Boucher and Sharma V. Thankachan}, title = {Towards Efficient Interactive Computation of Dynamic Time Warping Distance}, booktitle = {String Processing and Information Retrieval - 27th International Symposium, {SPIRE} 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12303}, pages = {27--41}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-59212-7\_3}, doi = {10.1007/978-3-030-59212-7\_3}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/NishiNIBT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2019
Proceedings<i>k</i>-Abelian Pattern Matching: Revisited, Corrected, and Extended
Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto — Prague Stringology Conference 2019, Prague, Czech Republic, August 26-28, 2019
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/BadkobehBCIIS19, author = {Golnaz Badkobeh and Hideo Bannai and Maxime Crochemore and Tomohiro I and Shunsuke Inenaga and Shiho Sugimoto}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {\emph{k}-Abelian Pattern Matching: Revisited, Corrected, and Extended}, booktitle = {Prague Stringology Conference 2019, Prague, Czech Republic, August 26-28, 2019}, pages = {29--40}, publisher = {Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science}, year = {2019}, url = {http://www.stringology.org/event/2019/p04.html}, timestamp = {Wed, 19 Nov 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stringology/BadkobehBCIIS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsAn Improved Data Structure for Left-Right Maximal Generic Words Problem
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 30th International Symposium on Algorithms and Computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8-11, 2019
Cite (BibTeX)
@inproceedings{DBLP:conf/isaac/FujishigeNIBT19, author = {Yuta Fujishige and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Pinyan Lu and Guochuan Zhang}, title = {An Improved Data Structure for Left-Right Maximal Generic Words Problem}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8-11, 2019}, series = {LIPIcs}, volume = {149}, pages = {40:1--40:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.40}, doi = {10.4230/LIPICS.ISAAC.2019.40}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FujishigeNIBT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsCompact Data Structures for Shortest Unique Substring Queries
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/MienoKNIBT19, author = {Takuya Mieno and Dominik K{\"{o}}ppl and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Nieves R. Brisaboa and Simon J. Puglisi}, title = {Compact Data Structures for Shortest Unique Substring Queries}, booktitle = {String Processing and Information Retrieval - 26th International Symposium, {SPIRE} 2019, Segovia, Spain, October 7-9, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11811}, pages = {107--123}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-32686-9\_8}, doi = {10.1007/978-3-030-32686-9\_8}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/MienoKNIBT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing Maximal Palindromes and Distinct Palindromes in a Trie
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Prague Stringology Conference 2019, Prague, Czech Republic, August 26-28, 2019
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/FunakoshiNIBT19, author = {Mitsuru Funakoshi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Computing Maximal Palindromes and Distinct Palindromes in a Trie}, booktitle = {Prague Stringology Conference 2019, Prague, Czech Republic, August 26-28, 2019}, pages = {3--15}, publisher = {Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science}, year = {2019}, url = {http://www.stringology.org/event/2019/p02.html}, timestamp = {Wed, 19 Nov 2025 11:16:18 +0100}, biburl = {https://dblp.org/rec/conf/stringology/FunakoshiNIBT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing Runs on a Trie
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Pisa, Italy, June 18-20, 2019
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/SugaharaNIBT19, author = {Ryo Sugahara and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Nadia Pisanti and Solon P. Pissis}, title = {Computing Runs on a Trie}, booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019, Pisa, Italy, June 18-20, 2019}, series = {LIPIcs}, volume = {128}, pages = {23:1--23:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.CPM.2019.23}, doi = {10.4230/LIPICS.CPM.2019.23}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/SugaharaNIBT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintConstructing the Bijective BWT
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
Cite (BibTeX)
@article{DBLP:journals/corr/abs-1911-06985, author = {Hideo Bannai and Juha K{\"{a}}rkk{\"{a}}inen and Dominik K{\"{o}}ppl and Marcin Piatkowski}, title = {Constructing the Bijective {BWT}}, journal = {CoRR}, volume = {abs/1911.06985}, year = {2019}, url = {http://arxiv.org/abs/1911.06985}, eprinttype = {arXiv}, eprint = {1911.06985}, timestamp = {Mon, 02 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1911-06985.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsDirect Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/FujisatoNIBT19, author = {Noriki Fujisato and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Nieves R. Brisaboa and Simon J. Puglisi}, title = {Direct Linear Time Construction of Parameterized Suffix and {LCP} Arrays for Constant Alphabets}, booktitle = {String Processing and Information Retrieval - 26th International Symposium, {SPIRE} 2019, Segovia, Spain, October 7-9, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11811}, pages = {382--391}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-32686-9\_27}, doi = {10.1007/978-3-030-32686-9\_27}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/FujisatoNIBT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintDynamic Packed Compact Tries Revisited
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/abs-1904-07467, author = {Kazuya Tsuruta and Dominik K{\"{o}}ppl and Shunsuke Kanda and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Dynamic Packed Compact Tries Revisited}, journal = {CoRR}, volume = {abs/1904.07467}, year = {2019}, url = {http://arxiv.org/abs/1904.07467}, eprinttype = {arXiv}, eprint = {1904.07467}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1904-07467.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFaster Queries for Longest Substring Palindrome After Block Edit
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Pisa, Italy, June 18-20, 2019
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/FunakoshiNIBT19, author = {Mitsuru Funakoshi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Nadia Pisanti and Solon P. Pissis}, title = {Faster Queries for Longest Substring Palindrome After Block Edit}, booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019, Pisa, Italy, June 18-20, 2019}, series = {LIPIcs}, volume = {128}, pages = {27:1--27:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.CPM.2019.27}, doi = {10.4230/LIPICS.CPM.2019.27}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/FunakoshiNIBT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFinding All Maximal Perfect Haplotype Blocks in Linear Time
Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye — 19th International Workshop on Algorithms in Bioinformatics, WABI 2019, Niagara Falls, NY, USA, September 8-10, 2019
Journal version: Algorithms Mol. Biol., 2020
Cite (BibTeX)
@inproceedings{DBLP:conf/wabi/AlankoBCPS19, author = {Jarno Alanko and Hideo Bannai and Bastien Cazaux and Pierre Peterlongo and Jens Stoye}, editor = {Katharina T. Huber and Dan Gusfield}, title = {Finding All Maximal Perfect Haplotype Blocks in Linear Time}, booktitle = {19th International Workshop on Algorithms in Bioinformatics, {WABI} 2019, Niagara Falls, NY, USA, September 8-10, 2019}, series = {LIPIcs}, volume = {143}, pages = {8:1--8:9}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.WABI.2019.8}, doi = {10.4230/LIPICS.WABI.2019.8}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/wabi/AlankoBCPS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsIndexing the Bijective BWT
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski — 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Pisa, Italy, June 18-20, 2019
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/BannaiKKP19, author = {Hideo Bannai and Juha K{\"{a}}rkk{\"{a}}inen and Dominik K{\"{o}}ppl and Marcin Piatkowski}, editor = {Nadia Pisanti and Solon P. Pissis}, title = {Indexing the Bijective {BWT}}, booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019, Pisa, Italy, June 18-20, 2019}, series = {LIPIcs}, volume = {128}, pages = {17:1--17:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.CPM.2019.17}, doi = {10.4230/LIPICS.CPM.2019.17}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/cpm/BannaiKKP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsMR-RePair: Grammar Compression Based on Maximal Repeats
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida — Data Compression Conference, DCC 2019, Snowbird, UT, USA, March 26-29, 2019
Cite (BibTeX)
@inproceedings{DBLP:conf/dcc/FuruyaTNIBK19, author = {Isamu Furuya and Takuya Takagi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Takuya Kida}, editor = {Ali Bilgin and Michael W. Marcellin and Joan Serra{-}Sagrist{\`{a}} and James A. Storer}, title = {MR-RePair: Grammar Compression Based on Maximal Repeats}, booktitle = {Data Compression Conference, {DCC} 2019, Snowbird, UT, USA, March 26-29, 2019}, pages = {508--517}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/DCC.2019.00059}, doi = {10.1109/DCC.2019.00059}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dcc/FuruyaTNIBK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOn Longest Common Property Preserved Substring Queries
Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka — String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/KaiNIBTK19, author = {Kazuki Kai and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda and Tomasz Kociumaka}, editor = {Nieves R. Brisaboa and Simon J. Puglisi}, title = {On Longest Common Property Preserved Substring Queries}, booktitle = {String Processing and Information Retrieval - 26th International Symposium, {SPIRE} 2019, Segovia, Spain, October 7-9, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11811}, pages = {162--174}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-32686-9\_12}, doi = {10.1007/978-3-030-32686-9\_12}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/KaiNIBTK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOn the Size of Overlapping Lempel-Ziv and Lyndon Factorizations
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Pisa, Italy, June 18-20, 2019
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/UrabeNIBT19, author = {Yuki Urabe and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Nadia Pisanti and Solon P. Pissis}, title = {On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations}, booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019, Pisa, Italy, June 18-20, 2019}, series = {LIPIcs}, volume = {128}, pages = {29:1--29:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.CPM.2019.29}, doi = {10.4230/LIPICS.CPM.2019.29}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/UrabeNIBT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalOn the size of the smallest alphabet for Lyndon trees
Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2019
Cite (BibTeX)
@article{DBLP:journals/tcs/NakashimaTIBT19, author = {Yuto Nakashima and Takuya Takagi and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {On the size of the smallest alphabet for Lyndon trees}, journal = {Theor. Comput. Sci.}, volume = {792}, pages = {131--143}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.06.044}, doi = {10.1016/J.TCS.2018.06.044}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/NakashimaTIBT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsShortest Unique Palindromic Substring Queries on Run-Length Encoded Strings
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/iwoca/WatanabeNIBT19, author = {Kiichi Watanabe and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Charles J. Colbourn and Roberto Grossi and Nadia Pisanti}, title = {Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings}, booktitle = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019, Pisa, Italy, July 23-25, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11638}, pages = {430--441}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-25005-8\_35}, doi = {10.1007/978-3-030-25005-8\_35}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/WatanabeNIBT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsThe Parameterized Position Heap of a Trie
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/ciac/FujisatoNIBT19, author = {Noriki Fujisato and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Pinar Heggernes}, title = {The Parameterized Position Heap of a Trie}, booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC} 2019, Rome, Italy, May 27-29, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11485}, pages = {237--248}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-17402-6\_20}, doi = {10.1007/978-3-030-17402-6\_20}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ciac/FujisatoNIBT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2018
JournalAlgorithms and combinatorial properties on shortest unique palindromic substrings
Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — J. Discrete Algorithms, 2018
Cite (BibTeX)
@article{DBLP:journals/jda/InoueNMIBT18, author = {Hiroe Inoue and Yuto Nakashima and Takuya Mieno and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Algorithms and combinatorial properties on shortest unique palindromic substrings}, journal = {J. Discrete Algorithms}, volume = {52-53}, pages = {122--132}, year = {2018}, url = {https://doi.org/10.1016/j.jda.2018.11.009}, doi = {10.1016/J.JDA.2018.11.009}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jda/InoueNMIBT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsBlock Palindromes: A New Generalization of Palindromes
Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga — String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/GotoIBI18, author = {Keisuke Goto and Tomohiro I and Hideo Bannai and Shunsuke Inenaga}, editor = {Travis Gagie and Alistair Moffat and Gonzalo Navarro and Ernesto Cuadros{-}Vargas}, title = {Block Palindromes: {A} New Generalization of Palindromes}, booktitle = {String Processing and Information Retrieval - 25th International Symposium, {SPIRE} 2018, Lima, Peru, October 9-11, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11147}, pages = {183--190}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00479-8\_15}, doi = {10.1007/978-3-030-00479-8\_15}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/spire/GotoIBI18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing longest common square subsequences
Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda — Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, July 2-4, 2018
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/InoueIHBT18, author = {Takafumi Inoue and Shunsuke Inenaga and Heikki Hyyr{\"{o}} and Hideo Bannai and Masayuki Takeda}, editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, title = {Computing longest common square subsequences}, booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, Qingdao, China, July 2-4, 2018}, series = {LIPIcs}, volume = {105}, pages = {15:1--15:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.CPM.2018.15}, doi = {10.4230/LIPICS.CPM.2018.15}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/InoueIHBT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalDiverse Palindromic Factorization is NP-Complete
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto — Int. J. Found. Comput. Sci., 2018
Cite (BibTeX)
@article{DBLP:journals/ijfcs/BannaiGIKKPS18, author = {Hideo Bannai and Travis Gagie and Shunsuke Inenaga and Juha K{\"{a}}rkk{\"{a}}inen and Dominik Kempa and Marcin Piatkowski and Shiho Sugimoto}, title = {Diverse Palindromic Factorization is NP-Complete}, journal = {Int. J. Found. Comput. Sci.}, volume = {29}, number = {2}, pages = {143--164}, year = {2018}, url = {https://doi.org/10.1142/S0129054118400014}, doi = {10.1142/S0129054118400014}, timestamp = {Sun, 19 Jan 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ijfcs/BannaiGIKKPS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFaster Online Elastic Degenerate String Matching
Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, July 2-4, 2018
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/AoyamaNIIBT18, author = {Kotaro Aoyama and Yuto Nakashima and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, title = {Faster Online Elastic Degenerate String Matching}, booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, Qingdao, China, July 2-4, 2018}, series = {LIPIcs}, volume = {105}, pages = {9:1--9:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.CPM.2018.9}, doi = {10.4230/LIPICS.CPM.2018.9}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/AoyamaNIIBT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsLongest Lyndon Substring After Edit
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, July 2-4, 2018
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/UrabeNIBT18, author = {Yuki Urabe and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, title = {Longest Lyndon Substring After Edit}, booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, Qingdao, China, July 2-4, 2018}, series = {LIPIcs}, volume = {105}, pages = {19:1--19:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.CPM.2018.19}, doi = {10.4230/LIPICS.CPM.2018.19}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/UrabeNIBT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsLongest substring palindrome after edit
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, July 2-4, 2018
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/FunakoshiNIBT18, author = {Mitsuru Funakoshi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, title = {Longest substring palindrome after edit}, booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, Qingdao, China, July 2-4, 2018}, series = {LIPIcs}, volume = {105}, pages = {12:1--12:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.CPM.2018.12}, doi = {10.4230/LIPICS.CPM.2018.12}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/FunakoshiNIBT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsLyndon Factorization of Grammar Compressed Texts Revisited
Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, July 2-4, 2018
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/FuruyaNIIBT18, author = {Isamu Furuya and Yuto Nakashima and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, title = {Lyndon Factorization of Grammar Compressed Texts Revisited}, booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, Qingdao, China, July 2-4, 2018}, series = {LIPIcs}, volume = {105}, pages = {24:1--24:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.CPM.2018.24}, doi = {10.4230/LIPICS.CPM.2018.24}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/FuruyaNIIBT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsO(n log n)-time Text Compression by LZ-style Longest First Substitution
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Prague Stringology Conference 2018, Prague, Czech Republic, August 27-28, 2018
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/NishiNIBT18, author = {Akihiro Nishi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {O(n log n)-time Text Compression by LZ-style Longest First Substitution}, booktitle = {Prague Stringology Conference 2018, Prague, Czech Republic, August 27-28, 2018}, pages = {12--26}, publisher = {Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science}, year = {2018}, url = {http://www.stringology.org/event/2018/p03.html}, timestamp = {Wed, 19 Nov 2025 11:16:18 +0100}, biburl = {https://dblp.org/rec/conf/stringology/NishiNIBT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOnline LZ77 Parsing and Matching Statistics with RLBWTs
Hideo Bannai, Travis Gagie, Tomohiro I — Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, July 2-4, 2018
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/BannaiGI18, author = {Hideo Bannai and Travis Gagie and Tomohiro I}, editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, title = {Online {LZ77} Parsing and Matching Statistics with RLBWTs}, booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, Qingdao, China, July 2-4, 2018}, series = {LIPIcs}, volume = {105}, pages = {7:1--7:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.CPM.2018.7}, doi = {10.4230/LIPICS.CPM.2018.7}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BannaiGI18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOrder-Preserving Pattern Matching Indeterminate Strings
Rui Henriques, Alexandre P. Francisco, Luı́s M. S. Russo, Hideo Bannai — Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, July 2-4, 2018
Journal version: Inf. Comput., 2022
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/HenriquesFRB18, author = {Rui Henriques and Alexandre P. Francisco and Lu{\'{\i}}s M. S. Russo and Hideo Bannai}, editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, title = {Order-Preserving Pattern Matching Indeterminate Strings}, booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, Qingdao, China, July 2-4, 2018}, series = {LIPIcs}, volume = {105}, pages = {2:1--2:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.CPM.2018.2}, doi = {10.4230/LIPICS.CPM.2018.2}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/cpm/HenriquesFRB18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsRecovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays
Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/KuharaNIBT18, author = {Yuki Kuhara and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Travis Gagie and Alistair Moffat and Gonzalo Navarro and Ernesto Cuadros{-}Vargas}, title = {Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays}, booktitle = {String Processing and Information Retrieval - 25th International Symposium, {SPIRE} 2018, Lima, Peru, October 9-11, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11147}, pages = {254--267}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-00479-8\_21}, doi = {10.1007/978-3-030-00479-8\_21}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/KuharaNIBT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsRight-to-left Online Construction of Parameterized Position Heaps
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Prague Stringology Conference 2018, Prague, Czech Republic, August 27-28, 2018
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/FujisatoNIBT18, author = {Noriki Fujisato and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Right-to-left Online Construction of Parameterized Position Heaps}, booktitle = {Prague Stringology Conference 2018, Prague, Czech Republic, August 27-28, 2018}, pages = {91--102}, publisher = {Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science}, year = {2018}, url = {http://www.stringology.org/event/2018/p09.html}, timestamp = {Wed, 19 Nov 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stringology/FujisatoNIBT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2017
ProceedingsAlmost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 28th International Symposium on Algorithms and Computation, ISAAC 2017, Phuket, Thailand, December 9-12, 2017
Cite (BibTeX)
@inproceedings{DBLP:conf/isaac/FujishigeNIBT17, author = {Yuta Fujishige and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, Phuket, Thailand, December 9-12, 2017}, series = {LIPIcs}, volume = {92}, pages = {33:1--33:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.33}, doi = {10.4230/LIPICS.ISAAC.2017.33}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FujishigeNIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintComputing Abelian regularities on RLE strings
Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/SugimotoNIBT17, author = {Shiho Sugimoto and Naoki Noda and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Computing Abelian regularities on {RLE} strings}, journal = {CoRR}, volume = {abs/1701.02836}, year = {2017}, url = {http://arxiv.org/abs/1701.02836}, eprinttype = {arXiv}, eprint = {1701.02836}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/SugimotoNIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing Abelian String Regularities Based on RLE
Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers
Cite (BibTeX)
@inproceedings{DBLP:conf/iwoca/SugimotoNIBT17, author = {Shiho Sugimoto and Naoki Noda and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Ljiljana Brankovic and Joe Ryan and William F. Smyth}, title = {Computing Abelian String Regularities Based on {RLE}}, booktitle = {Combinatorial Algorithms - 28th International Workshop, {IWOCA} 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10765}, pages = {420--431}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-78825-8\_34}, doi = {10.1007/978-3-319-78825-8\_34}, timestamp = {Thu, 19 Apr 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/SugimotoNIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing All Distinct Squares in Linear Time for Integer Alphabets
Hideo Bannai, Shunsuke Inenaga, Dominik Köppl — 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, July 4-6, 2017
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/BannaiIK17, author = {Hideo Bannai and Shunsuke Inenaga and Dominik K{\"{o}}ppl}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Computing All Distinct Squares in Linear Time for Integer Alphabets}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, Warsaw, Poland, July 4-6, 2017}, series = {LIPIcs}, volume = {78}, pages = {22:1--22:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.22}, doi = {10.4230/LIPICS.CPM.2017.22}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BannaiIK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalEfficient Computation of Substring Equivalence Classes with Suffix Arrays
Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Algorithmica, 2017
Cite (BibTeX)
@article{DBLP:journals/algorithmica/NarisawaHIBT17, author = {Kazuyuki Narisawa and Hideharu Hiratsuka and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Efficient Computation of Substring Equivalence Classes with Suffix Arrays}, journal = {Algorithmica}, volume = {79}, number = {2}, pages = {291--318}, year = {2017}, url = {https://doi.org/10.1007/s00453-016-0178-z}, doi = {10.1007/S00453-016-0178-Z}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/NarisawaHIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFaster STR-IC-LCS Computation via RLE
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, July 4-6, 2017
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/KuboiFIBT17, author = {Keita Kuboi and Yuta Fujishige and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Faster {STR-IC-LCS} Computation via {RLE}}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, Warsaw, Poland, July 4-6, 2017}, series = {LIPIcs}, volume = {78}, pages = {20:1--20:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.20}, doi = {10.4230/LIPICS.CPM.2017.20}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/cpm/KuboiFIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalInferring strings from Lyndon factorization
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2017
Cite (BibTeX)
@article{DBLP:journals/tcs/NakashimaOIIBT17, author = {Yuto Nakashima and Takashi Okabe and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Inferring strings from Lyndon factorization}, journal = {Theor. Comput. Sci.}, volume = {689}, pages = {147--156}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2017.05.038}, doi = {10.1016/J.TCS.2017.05.038}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/NakashimaOIIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsLongest Common Subsequence in at Least k Length Order-Isomorphic Substrings
Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara — SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/sofsem/UekiDKMNYBIS17, author = {Yohei Ueki and Diptarama and Masatoshi Kurihara and Yoshiaki Matsuoka and Kazuyuki Narisawa and Ryo Yoshinaka and Hideo Bannai and Shunsuke Inenaga and Ayumi Shinohara}, editor = {Bernhard Steffen and Christel Baier and Mark van den Brand and Johann Eder and Mike Hinchey and Tiziana Margaria}, title = {Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings}, booktitle = {{SOFSEM} 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10139}, pages = {363--374}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-51963-0\_28}, doi = {10.1007/978-3-319-51963-0\_28}, timestamp = {Sun, 06 Oct 2024 21:14:56 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/UekiDKMNYBIS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOn Reverse Engineering the Lyndon Tree
Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Proceedings of the Prague Stringology Conference 2017, Prague, Czech Republic, August 28-30, 2017
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/NakashimaTIBT17, author = {Yuto Nakashima and Takuya Takagi and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {On Reverse Engineering the Lyndon Tree}, booktitle = {Proceedings of the Prague Stringology Conference 2017, Prague, Czech Republic, August 28-30, 2017}, pages = {108--117}, publisher = {Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2017}, url = {http://www.stringology.org/event/2017/p11.html}, timestamp = {Wed, 19 Nov 2025 11:16:18 +0100}, biburl = {https://dblp.org/rec/conf/stringology/NakashimaTIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOrder Preserving Pattern Matching on Trees and DAGs
Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/NakamuraIBT17, author = {Temma Nakamura and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Gabriele Fici and Marinella Sciortino and Rossano Venturini}, title = {Order Preserving Pattern Matching on Trees and DAGs}, booktitle = {String Processing and Information Retrieval - 24th International Symposium, {SPIRE} 2017, Palermo, Italy, September 26-29, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10508}, pages = {271--277}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-67428-5\_23}, doi = {10.1007/978-3-319-67428-5\_23}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/spire/NakamuraIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsShortest Unique Palindromic Substring Queries in Optimal Time
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers
Cite (BibTeX)
@inproceedings{DBLP:conf/iwoca/NakashimaIMIBT17, author = {Yuto Nakashima and Hiroe Inoue and Takuya Mieno and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Ljiljana Brankovic and Joe Ryan and William F. Smyth}, title = {Shortest Unique Palindromic Substring Queries in Optimal Time}, booktitle = {Combinatorial Algorithms - 28th International Workshop, {IWOCA} 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10765}, pages = {397--408}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-78825-8\_32}, doi = {10.1007/978-3-319-78825-8\_32}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/NakashimaIMIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintSmall-space encoding LCE data structure with constant-time queries
Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/TanimuraNBIT17, author = {Yuka Tanimura and Takaaki Nishimoto and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, title = {Small-space encoding {LCE} data structure with constant-time queries}, journal = {CoRR}, volume = {abs/1702.07458}, year = {2017}, url = {http://arxiv.org/abs/1702.07458}, eprinttype = {arXiv}, eprint = {1702.07458}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/TanimuraNBIT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsSmall-Space LCE Data Structure with Constant-Time Queries
Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Aalborg, Denmark, August 21-25, 2017
Cite (BibTeX)
@inproceedings{DBLP:conf/mfcs/TanimuraNBIT17, author = {Yuka Tanimura and Takaaki Nishimoto and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {Kim G. Larsen and Hans L. Bodlaender and Jean{-}Fran{\c{c}}ois Raskin}, title = {Small-Space {LCE} Data Structure with Constant-Time Queries}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2017, Aalborg, Denmark, August 21-25, 2017}, series = {LIPIcs}, volume = {83}, pages = {10:1--10:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.10}, doi = {10.4230/LIPICS.MFCS.2017.10}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/TanimuraNBIT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalThe "Runs" Theorem
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta — SIAM J. Comput., 2017
Cite (BibTeX)
@article{DBLP:journals/siamcomp/BannaiIINTT17, author = {Hideo Bannai and Tomohiro I and Shunsuke Inenaga and Yuto Nakashima and Masayuki Takeda and Kazuya Tsuruta}, title = {The "Runs" Theorem}, journal = {{SIAM} J. Comput.}, volume = {46}, number = {5}, pages = {1501--1514}, year = {2017}, url = {https://doi.org/10.1137/15M1011032}, doi = {10.1137/15M1011032}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BannaiIINTT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsTight Bounds on the Maximum Number of Shortest Unique Substrings
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, July 4-6, 2017
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/MienoIBT17, author = {Takuya Mieno and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech Rytter}, title = {Tight Bounds on the Maximum Number of Shortest Unique Substrings}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017, Warsaw, Poland, July 4-6, 2017}, series = {LIPIcs}, volume = {78}, pages = {24:1--24:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.CPM.2017.24}, doi = {10.4230/LIPICS.CPM.2017.24}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/MienoIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2016
JournalClosed factorization
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto — Discret. Appl. Math., 2016
Cite (BibTeX)
@article{DBLP:journals/dam/BadkobehBGIIIPS16, author = {Golnaz Badkobeh and Hideo Bannai and Keisuke Goto and Tomohiro I and Costas S. Iliopoulos and Shunsuke Inenaga and Simon J. Puglisi and Shiho Sugimoto}, title = {Closed factorization}, journal = {Discret. Appl. Math.}, volume = {212}, pages = {23--29}, year = {2016}, url = {https://doi.org/10.1016/j.dam.2016.04.009}, doi = {10.1016/J.DAM.2016.04.009}, timestamp = {Mon, 22 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BadkobehBGIIIPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, Kraków, Poland, August 22-26, 2016
Cite (BibTeX)
@inproceedings{DBLP:conf/mfcs/FujishigeTIBT16, author = {Yuta Fujishige and Yuki Tsujimaru and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, title = {Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2016, Krak{\'{o}}w, Poland, August 22-26, 2016}, series = {LIPIcs}, volume = {58}, pages = {38:1--38:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.38}, doi = {10.4230/LIPICS.MFCS.2016.38}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/FujishigeTIBT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing Smallest and Largest Repetition Factorizations in <i>O</i>(<i>n</i> log <i>n</i>) Time
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Proceedings of the Prague Stringology Conference 2016, Prague, Czech Republic, August 29-31, 2016
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/InoueMNIBT16, author = {Hiroe Inoue and Yoshiaki Matsuoka and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Computing Smallest and Largest Repetition Factorizations in \emph{O}(\emph{n} log \emph{n}) Time}, booktitle = {Proceedings of the Prague Stringology Conference 2016, Prague, Czech Republic, August 29-31, 2016}, pages = {135--145}, publisher = {Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2016}, url = {http://www.stringology.org/event/2016/p12.html}, timestamp = {Wed, 19 Nov 2025 11:16:18 +0100}, biburl = {https://dblp.org/rec/conf/stringology/InoueMNIBT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsDeterministic Sub-Linear Space LCE Data Structures With Efficient Construction
Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda — 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Tel Aviv, Israel, June 27-29, 2016
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/TanimuraIBIPT16, author = {Yuka Tanimura and Tomohiro I and Hideo Bannai and Shunsuke Inenaga and Simon J. Puglisi and Masayuki Takeda}, editor = {Roberto Grossi and Moshe Lewenstein}, title = {Deterministic Sub-Linear Space {LCE} Data Structures With Efficient Construction}, booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016, Tel Aviv, Israel, June 27-29, 2016}, series = {LIPIcs}, volume = {54}, pages = {1:1--1:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.CPM.2016.1}, doi = {10.4230/LIPICS.CPM.2016.1}, timestamp = {Fri, 21 Nov 2025 23:44:11 +0100}, biburl = {https://dblp.org/rec/conf/cpm/TanimuraIBIPT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsDynamic Index and LZ Factorization in Compressed Space
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Proceedings of the Prague Stringology Conference 2016, Prague, Czech Republic, August 29-31, 2016
Journal version: Discret. Appl. Math., 2020
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/NishimotoIIBT16, author = {Takaaki Nishimoto and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Dynamic Index and {LZ} Factorization in Compressed Space}, booktitle = {Proceedings of the Prague Stringology Conference 2016, Prague, Czech Republic, August 29-31, 2016}, pages = {158--170}, publisher = {Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2016}, url = {http://www.stringology.org/event/2016/p14.html}, timestamp = {Wed, 19 Nov 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stringology/NishimotoIIBT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFactorizing a String into Squares in Linear Time
Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea — 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Tel Aviv, Israel, June 27-29, 2016
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/MatsuokaIBTM16, author = {Yoshiaki Matsuoka and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda and Florin Manea}, editor = {Roberto Grossi and Moshe Lewenstein}, title = {Factorizing a String into Squares in Linear Time}, booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016, Tel Aviv, Israel, June 27-29, 2016}, series = {LIPIcs}, volume = {54}, pages = {27:1--27:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.CPM.2016.27}, doi = {10.4230/LIPICS.CPM.2016.27}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/MatsuokaIBTM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalFaster Lyndon factorization algorithms for SLP and LZ78 compressed text
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2016
Cite (BibTeX)
@article{DBLP:journals/tcs/INIBT16, author = {Tomohiro I and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Faster Lyndon factorization algorithms for {SLP} and {LZ78} compressed text}, journal = {Theor. Comput. Sci.}, volume = {656}, pages = {215--224}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.03.005}, doi = {10.1016/J.TCS.2016.03.005}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/INIBT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFinding Gapped Palindromes Online
Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/iwoca/FujishigeNIBT16, author = {Yuta Fujishige and Michitaro Nakamura and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Veli M{\"{a}}kinen and Simon J. Puglisi and Leena Salmela}, title = {Finding Gapped Palindromes Online}, booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016, Helsinki, Finland, August 17-19, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9843}, pages = {191--202}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-44543-4\_15}, doi = {10.1007/978-3-319-44543-4\_15}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/FujishigeNIBT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFully Dynamic Data Structure for LCE Queries in Compressed Space
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, Kraków, Poland, August 22-26, 2016
Cite (BibTeX)
@inproceedings{DBLP:conf/mfcs/NishimotoIIBT16, author = {Takaaki Nishimoto and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, title = {Fully Dynamic Data Structure for {LCE} Queries in Compressed Space}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2016, Krak{\'{o}}w, Poland, August 22-26, 2016}, series = {LIPIcs}, volume = {58}, pages = {72:1--72:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.72}, doi = {10.4230/LIPICS.MFCS.2016.72}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/NishimotoIIBT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalGeneralized pattern matching and periodicity under substring consistent equivalence relations
Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2016
Cite (BibTeX)
@article{DBLP:journals/tcs/MatsuokaAIBT16, author = {Yoshiaki Matsuoka and Takahiro Aoki and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Generalized pattern matching and periodicity under substring consistent equivalence relations}, journal = {Theor. Comput. Sci.}, volume = {656}, pages = {225--233}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.02.017}, doi = {10.1016/J.TCS.2016.02.017}, timestamp = {Thu, 28 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MatsuokaAIBT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }BookGrammar Compression
Hideo Bannai — Encyclopedia of Algorithms, 2016
Cite (BibTeX)
@incollection{DBLP:reference/algo/Bannai16, author = {Hideo Bannai}, title = {Grammar Compression}, booktitle = {Encyclopedia of Algorithms}, pages = {861--866}, year = {2016}, url = {https://doi.org/10.1007/978-1-4939-2864-4\_635}, doi = {10.1007/978-1-4939-2864-4\_635}, timestamp = {Wed, 12 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/Bannai16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsShortest Unique Substring Queries on Run-Length Encoded Strings
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, Kraków, Poland, August 22-26, 2016
Cite (BibTeX)
@inproceedings{DBLP:conf/mfcs/MienoIBT16, author = {Takuya Mieno and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, title = {Shortest Unique Substring Queries on Run-Length Encoded Strings}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2016, Krak{\'{o}}w, Poland, August 22-26, 2016}, series = {LIPIcs}, volume = {58}, pages = {69:1--69:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.69}, doi = {10.4230/LIPICS.MFCS.2016.69}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/MienoIBT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintTight bound on the maximum number of shortest unique substrings
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/MienoIBT16, author = {Takuya Mieno and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Tight bound on the maximum number of shortest unique substrings}, journal = {CoRR}, volume = {abs/1609.07220}, year = {2016}, url = {http://arxiv.org/abs/1609.07220}, eprinttype = {arXiv}, eprint = {1609.07220}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MienoIBT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2015
ProceedingsA Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String
Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/TanimuraFIIBT15, author = {Yuka Tanimura and Yuta Fujishige and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Costas S. Iliopoulos and Simon J. Puglisi and Emine Yilmaz}, title = {A Faster Algorithm for Computing Maximal {\textbackslash}alpha -gapped Repeats in a String}, booktitle = {String Processing and Information Retrieval - 22nd International Symposium, {SPIRE} 2015, London, UK, September 1-4, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9309}, pages = {124--136}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-23826-5\_13}, doi = {10.1007/978-3-319-23826-5\_13}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/TanimuraFIIBT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsA new characterization of maximal repetitions by Lyndon trees
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta — Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015
Cite (BibTeX)
@inproceedings{DBLP:conf/soda/BannaiIINTT15, author = {Hideo Bannai and Tomohiro I and Shunsuke Inenaga and Yuto Nakashima and Masayuki Takeda and Kazuya Tsuruta}, editor = {Piotr Indyk}, title = {A new characterization of maximal repetitions by Lyndon trees}, booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015}, pages = {562--571}, publisher = {{SIAM}}, year = {2015}, url = {https://doi.org/10.1137/1.9781611973730.38}, doi = {10.1137/1.9781611973730.38}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/BannaiIINTT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsAn Opportunistic Text Indexing Structure Based on Run Length Encoding
Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/ciac/TamakoshiGIBT15, author = {Yuya Tamakoshi and Keisuke Goto and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Vangelis Th. Paschos and Peter Widmayer}, title = {An Opportunistic Text Indexing Structure Based on Run Length Encoding}, booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015, Paris, France, May 20-22, 2015. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9079}, pages = {390--402}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-18173-8\_29}, doi = {10.1007/978-3-319-18173-8\_29}, timestamp = {Mon, 22 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ciac/TamakoshiGIBT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalCompressed automata for dictionary matching
Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2015
Cite (BibTeX)
@article{DBLP:journals/tcs/INIBT15, author = {Tomohiro I and Takaaki Nishimoto and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Compressed automata for dictionary matching}, journal = {Theor. Comput. Sci.}, volume = {578}, pages = {30--41}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.01.019}, doi = {10.1016/J.TCS.2015.01.019}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/INIBT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing Left-Right Maximal Generic Words
Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Proceedings of the Prague Stringology Conference 2015, Prague, Czech Republic, August 24-26, 2015
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/NishimotoNIBT15, author = {Takaaki Nishimoto and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Computing Left-Right Maximal Generic Words}, booktitle = {Proceedings of the Prague Stringology Conference 2015, Prague, Czech Republic, August 24-26, 2015}, pages = {5--16}, publisher = {Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2015}, url = {http://www.stringology.org/event/2015/p02.html}, timestamp = {Wed, 19 Nov 2025 11:16:19 +0100}, biburl = {https://dblp.org/rec/conf/stringology/NishimotoNIBT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalConstructing LZ78 tries and position heaps in linear time for large alphabets
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Inf. Process. Lett., 2015
Cite (BibTeX)
@article{DBLP:journals/ipl/NakashimaIIBT15, author = {Yuto Nakashima and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Constructing {LZ78} tries and position heaps in linear time for large alphabets}, journal = {Inf. Process. Lett.}, volume = {115}, number = {9}, pages = {655--659}, year = {2015}, url = {https://doi.org/10.1016/j.ipl.2015.04.002}, doi = {10.1016/J.IPL.2015.04.002}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/NakashimaIIBT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalDetecting regularities on grammar-compressed strings
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara — Inf. Comput., 2015
Cite (BibTeX)
@article{DBLP:journals/iandc/IMSIBTNS15, author = {Tomohiro I and Wataru Matsubara and Kouji Shimohira and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda and Kazuyuki Narisawa and Ayumi Shinohara}, title = {Detecting regularities on grammar-compressed strings}, journal = {Inf. Comput.}, volume = {240}, pages = {74--89}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.09.009}, doi = {10.1016/J.IC.2014.09.009}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/IMSIBTNS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsDiverse Palindromic Factorization Is NP-complete
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto — Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings
Journal version: Int. J. Found. Comput. Sci., 2018
Cite (BibTeX)
@inproceedings{DBLP:conf/dlt/BannaiGIKKPPS15, author = {Hideo Bannai and Travis Gagie and Shunsuke Inenaga and Juha K{\"{a}}rkk{\"{a}}inen and Dominik Kempa and Marcin Piatkowski and Simon J. Puglisi and Shiho Sugimoto}, editor = {Igor Potapov}, title = {Diverse Palindromic Factorization Is NP-complete}, booktitle = {Developments in Language Theory - 19th International Conference, {DLT} 2015, Liverpool, UK, July 27-30, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9168}, pages = {85--96}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-21500-6\_6}, doi = {10.1007/978-3-319-21500-6\_6}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dlt/BannaiGIKKPPS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintDynamic index, LZ factorization, and LCE queries in compressed space
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/NishimotoIIBT15, author = {Takaaki Nishimoto and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Dynamic index, {LZ} factorization, and {LCE} queries in compressed space}, journal = {CoRR}, volume = {abs/1504.06954}, year = {2015}, url = {http://arxiv.org/abs/1504.06954}, eprinttype = {arXiv}, eprint = {1504.06954}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/NishimotoIIBT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalEditorial
Hideo Bannai, Solon P. Pissis — J. Discrete Algorithms, 2015
Cite (BibTeX)
@article{DBLP:journals/jda/BannaiP15, author = {Hideo Bannai and Solon P. Pissis}, title = {Editorial}, journal = {J. Discrete Algorithms}, volume = {34}, pages = {1}, year = {2015}, url = {https://doi.org/10.1016/j.jda.2015.05.008}, doi = {10.1016/J.JDA.2015.05.008}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BannaiP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsEfficient Algorithms for Longest Closed Factor Array
Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen — String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/BannaiIKLRRSW15, author = {Hideo Bannai and Shunsuke Inenaga and Tomasz Kociumaka and Arnaud Lefebvre and Jakub Radoszewski and Wojciech Rytter and Shiho Sugimoto and Tomasz Walen}, editor = {Costas S. Iliopoulos and Simon J. Puglisi and Emine Yilmaz}, title = {Efficient Algorithms for Longest Closed Factor Array}, booktitle = {String Processing and Information Retrieval - 22nd International Symposium, {SPIRE} 2015, London, UK, September 1-4, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9309}, pages = {95--102}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-23826-5\_10}, doi = {10.1007/978-3-319-23826-5\_10}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/BannaiIKLRRSW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsInferring Strings from Full Abelian Periods
Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/isaac/NishidaIIBT15, author = {Makoto Nishida and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Inferring Strings from Full Abelian Periods}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {768--779}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_64}, doi = {10.1007/978-3-662-48971-0\_64}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/NishidaIIBT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsLZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/GotoBIT15, author = {Keisuke Goto and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {Ferdinando Cicalese and Ely Porat and Ugo Vaccaro}, title = {{LZD} Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding}, booktitle = {Combinatorial Pattern Matching - 26th Annual Symposium, {CPM} 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9133}, pages = {219--230}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-19929-0\_19}, doi = {10.1007/978-3-319-19929-0\_19}, timestamp = {Mon, 22 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpm/GotoBIT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsSemi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree
Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/MatsuokaIIBT15, author = {Yoshiaki Matsuoka and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Ferdinando Cicalese and Ely Porat and Ugo Vaccaro}, title = {Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree}, booktitle = {Combinatorial Pattern Matching - 26th Annual Symposium, {CPM} 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9133}, pages = {355--366}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-19929-0\_30}, doi = {10.1007/978-3-319-19929-0\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/MatsuokaIIBT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2014
ProceedingsClosed Factorization
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto — Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014
Journal version: Discret. Appl. Math., 2016
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/BadkobehBGIIIPS14, author = {Golnaz Badkobeh and Hideo Bannai and Keisuke Goto and Tomohiro I and Costas S. Iliopoulos and Shunsuke Inenaga and Simon J. Puglisi and Shiho Sugimoto}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Closed Factorization}, booktitle = {Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014}, pages = {162--168}, publisher = {Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2014}, url = {http://www.stringology.org/event/2014/p15.html}, timestamp = {Wed, 19 Nov 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stringology/BadkobehBGIIIPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing Abelian Covers and Abelian Runs
Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/MatsudaIBT14, author = {Shohei Matsuda and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Computing Abelian Covers and Abelian Runs}, booktitle = {Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014}, pages = {43--51}, publisher = {Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2014}, url = {http://www.stringology.org/event/2014/p05.html}, timestamp = {Wed, 19 Nov 2025 11:16:19 +0100}, biburl = {https://dblp.org/rec/conf/stringology/MatsudaIBT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing Palindromic Factorizations and Palindromic Covers On-line
Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/ISIBT14, author = {Tomohiro I and Shiho Sugimoto and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Alexander S. Kulikov and Sergei O. Kuznetsov and Pavel A. Pevzner}, title = {Computing Palindromic Factorizations and Palindromic Covers On-line}, booktitle = {Combinatorial Pattern Matching - 25th Annual Symposium, {CPM} 2014, Moscow, Russia, June 16-18, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8486}, pages = {150--161}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-07566-2\_16}, doi = {10.1007/978-3-319-07566-2\_16}, timestamp = {Wed, 25 Sep 2019 18:18:47 +0200}, biburl = {https://dblp.org/rec/conf/cpm/ISIBT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFaster Compact On-Line Lempel-Ziv Factorization
Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014, Lyon, France, March 5-8, 2014
Cite (BibTeX)
@inproceedings{DBLP:conf/stacs/YamamotoIBIT14, author = {Jun{-}ichi Yamamoto and Tomohiro I and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Faster Compact On-Line Lempel-Ziv Factorization}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science, {STACS} 2014, Lyon, France, March 5-8, 2014}, series = {LIPIcs}, volume = {25}, pages = {675--686}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.675}, doi = {10.4230/LIPICS.STACS.2014.675}, timestamp = {Fri, 21 Nov 2025 14:06:54 +0100}, biburl = {https://dblp.org/rec/conf/stacs/YamamotoIBIT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsInferring Strings from Lyndon Factorization
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II
Journal version: Theor. Comput. Sci., 2017
Cite (BibTeX)
@inproceedings{DBLP:conf/mfcs/NakashimaOIIBT14, author = {Yuto Nakashima and Takashi Okabe and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and Martin Dietzfelbinger and Zolt{\'{a}}n {\'{E}}sik}, title = {Inferring Strings from Lyndon Factorization}, booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {8635}, pages = {565--576}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44465-8\_48}, doi = {10.1007/978-3-662-44465-8\_48}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/NakashimaOIIBT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalInferring strings from suffix trees and links on a binary alphabet
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Discret. Appl. Math., 2014
Cite (BibTeX)
@article{DBLP:journals/dam/IIBT14, author = {Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Inferring strings from suffix trees and links on a binary alphabet}, journal = {Discret. Appl. Math.}, volume = {163}, pages = {316--325}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.02.033}, doi = {10.1016/J.DAM.2013.02.033}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/IIBT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalOn the existence of tight relative 2-designs on binary Hamming association schemes
Eiichi Bannai, Etsuko Bannai, Hideo Bannai — Discret. Math., 2014
Cite (BibTeX)
@article{DBLP:journals/dm/BannaiBB14, author = {Eiichi Bannai and Etsuko Bannai and Hideo Bannai}, title = {On the existence of tight relative 2-designs on binary Hamming association schemes}, journal = {Discret. Math.}, volume = {314}, pages = {17--37}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2013.09.013}, doi = {10.1016/J.DISC.2013.09.013}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/BannaiBB14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsShortest Unique Substrings Queries in Optimal Time
Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/sofsem/TsurutaIBT14, author = {Kazuya Tsuruta and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Viliam Geffert and Bart Preneel and Branislav Rovan and Julius Stuller and A Min Tjoa}, title = {Shortest Unique Substrings Queries in Optimal Time}, booktitle = {{SOFSEM} 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}} Smokovec, Slovakia, January 26-29, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8327}, pages = {503--513}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-04298-5\_44}, doi = {10.1007/978-3-319-04298-5\_44}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/TsurutaIBT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsSpace Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets
Keisuke Goto, Hideo Bannai — Data Compression Conference, DCC 2014, Snowbird, UT, USA, 26-28 March, 2014
Cite (BibTeX)
@inproceedings{DBLP:conf/dcc/GotoB14, author = {Keisuke Goto and Hideo Bannai}, editor = {Ali Bilgin and Michael W. Marcellin and Joan Serra{-}Sagrist{\`{a}} and James A. Storer}, title = {Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets}, booktitle = {Data Compression Conference, {DCC} 2014, Snowbird, UT, USA, 26-28 March, 2014}, pages = {163--172}, publisher = {{IEEE}}, year = {2014}, url = {https://doi.org/10.1109/DCC.2014.62}, doi = {10.1109/DCC.2014.62}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dcc/GotoB14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2013
ProceedingsCompressed Automata for Dictionary Matching
Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Implementation and Application of Automata - 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings
Journal version: Theor. Comput. Sci., 2015
Cite (BibTeX)
@inproceedings{DBLP:conf/wia/INIBT13, author = {Tomohiro I and Takaaki Nishimoto and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Stavros Konstantinidis}, title = {Compressed Automata for Dictionary Matching}, booktitle = {Implementation and Application of Automata - 18th International Conference, {CIAA} 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7982}, pages = {319--330}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-39274-0\_28}, doi = {10.1007/978-3-642-39274-0\_28}, timestamp = {Tue, 14 May 2019 10:00:41 +0200}, biburl = {https://dblp.org/rec/conf/wia/INIBT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing Convolution on Grammar-Compressed Text
Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 2013 Data Compression Conference, DCC 2013, Snowbird, UT, USA, March 20-22, 2013
Cite (BibTeX)
@inproceedings{DBLP:conf/dcc/TanakaIIBT13, author = {Toshiya Tanaka and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Ali Bilgin and Michael W. Marcellin and Joan Serra{-}Sagrist{\`{a}} and James A. Storer}, title = {Computing Convolution on Grammar-Compressed Text}, booktitle = {2013 Data Compression Conference, {DCC} 2013, Snowbird, UT, USA, March 20-22, 2013}, pages = {451--460}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/DCC.2013.53}, doi = {10.1109/DCC.2013.53}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dcc/TanakaIIBT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing Reversed Lempel-Ziv Factorization Online
Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, September 2-4, 2013
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/SugimotoIIBT13, author = {Shiho Sugimoto and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Computing Reversed Lempel-Ziv Factorization Online}, booktitle = {Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, September 2-4, 2013}, pages = {107--118}, publisher = {Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2013}, url = {http://www.stringology.org/event/2013/p10.html}, timestamp = {Wed, 19 Nov 2025 11:16:19 +0100}, biburl = {https://dblp.org/rec/conf/stringology/SugimotoIIBT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsConverting SLP to LZ78 in almost Linear Time
Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda — Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/BannaiGIT13, author = {Hideo Bannai and Pawel Gawrychowski and Shunsuke Inenaga and Masayuki Takeda}, editor = {Johannes Fischer and Peter Sanders}, title = {Converting {SLP} to {LZ78} in almost Linear Time}, booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7922}, pages = {38--49}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38905-4\_6}, doi = {10.1007/978-3-642-38905-4\_6}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/cpm/BannaiGIT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsDetecting Regularities on Grammar-Compressed Strings
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara — Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
Journal version: Inf. Comput., 2015
Cite (BibTeX)
@inproceedings{DBLP:conf/mfcs/IMSIBTNS13, author = {Tomohiro I and Wataru Matsubara and Kouji Shimohira and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda and Kazuyuki Narisawa and Ayumi Shinohara}, editor = {Krishnendu Chatterjee and Jir{\'{\i}} Sgall}, title = {Detecting Regularities on Grammar-Compressed Strings}, booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8087}, pages = {571--582}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40313-2\_51}, doi = {10.1007/978-3-642-40313-2\_51}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/IMSIBTNS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsEfficient Lyndon Factorization of Grammar Compressed Text
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/INIBT13, author = {Tomohiro I and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Johannes Fischer and Peter Sanders}, title = {Efficient Lyndon Factorization of Grammar Compressed Text}, booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7922}, pages = {153--164}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38905-4\_16}, doi = {10.1007/978-3-642-38905-4\_16}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/INIBT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalFast q-gram mining on SLP compressed strings
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — J. Discrete Algorithms, 2013
Cite (BibTeX)
@article{DBLP:journals/jda/GotoBIT13, author = {Keisuke Goto and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, title = {Fast q-gram mining on {SLP} compressed strings}, journal = {J. Discrete Algorithms}, volume = {18}, pages = {89--99}, year = {2013}, url = {https://doi.org/10.1016/j.jda.2012.07.006}, doi = {10.1016/J.JDA.2012.07.006}, timestamp = {Mon, 22 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/GotoBIT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFaster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings
Journal version: Theor. Comput. Sci., 2016
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/INIBT13, author = {Tomohiro I and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Oren Kurland and Moshe Lewenstein and Ely Porat}, title = {Faster Lyndon Factorization Algorithms for {SLP} and {LZ78} Compressed Text}, booktitle = {String Processing and Information Retrieval - 20th International Symposium, {SPIRE} 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8214}, pages = {174--185}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-319-02432-5\_21}, doi = {10.1007/978-3-319-02432-5\_21}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/INIBT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFrom Run Length Encoding to LZ78 and Back Again
Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — 2013 Data Compression Conference, DCC 2013, Snowbird, UT, USA, March 20-22, 2013
Cite (BibTeX)
@inproceedings{DBLP:conf/dcc/TamakoshiIIBT13, author = {Yuya Tamakoshi and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Ali Bilgin and Michael W. Marcellin and Joan Serra{-}Sagrist{\`{a}} and James A. Storer}, title = {From Run Length Encoding to {LZ78} and Back Again}, booktitle = {2013 Data Compression Conference, {DCC} 2013, Snowbird, UT, USA, March 20-22, 2013}, pages = {143--152}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/DCC.2013.22}, doi = {10.1109/DCC.2013.22}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dcc/TamakoshiIIBT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsPermuted Pattern Matching on Multi-track Strings
Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga — SOFSEM 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 26-31, 2013. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/sofsem/KatsuraNSBI13, author = {Takashi Katsura and Kazuyuki Narisawa and Ayumi Shinohara and Hideo Bannai and Shunsuke Inenaga}, editor = {Peter van Emde Boas and Frans C. A. Groen and Giuseppe F. Italiano and Jerzy R. Nawrocki and Harald Sack}, title = {Permuted Pattern Matching on Multi-track Strings}, booktitle = {{SOFSEM} 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, {\v{S}}pindler{\r{u}}v Ml{\'{y}}n, Czech Republic, January 26-31, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7741}, pages = {280--291}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-35843-2\_25}, doi = {10.1007/978-3-642-35843-2\_25}, timestamp = {Mon, 28 Aug 2023 21:17:48 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/KatsuraNSBI13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsSimpler and Faster Lempel Ziv Factorization
Keisuke Goto, Hideo Bannai — 2013 Data Compression Conference, DCC 2013, Snowbird, UT, USA, March 20-22, 2013
Cite (BibTeX)
@inproceedings{DBLP:conf/dcc/GotoB13, author = {Keisuke Goto and Hideo Bannai}, editor = {Ali Bilgin and Michael W. Marcellin and Joan Serra{-}Sagrist{\`{a}} and James A. Storer}, title = {Simpler and Faster Lempel Ziv Factorization}, booktitle = {2013 Data Compression Conference, {DCC} 2013, Snowbird, UT, USA, March 20-22, 2013}, pages = {133--142}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/DCC.2013.21}, doi = {10.1109/DCC.2013.21}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dcc/GotoB13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintSpace Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets
Keisuke Goto, Hideo Bannai
Cite (BibTeX)
@article{DBLP:journals/corr/GotoB13, author = {Keisuke Goto and Hideo Bannai}, title = {Space Efficient Linear Time Lempel-Ziv Factorization on Constant{\textasciitilde}Size{\textasciitilde}Alphabets}, journal = {CoRR}, volume = {abs/1310.1448}, year = {2013}, url = {http://arxiv.org/abs/1310.1448}, eprinttype = {arXiv}, eprint = {1310.1448}, timestamp = {Mon, 22 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/GotoB13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2012
JournalAn efficient algorithm to test square-freeness of strings compressed by straight-line programs
Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein — Inf. Process. Lett., 2012
Cite (BibTeX)
@article{DBLP:journals/ipl/BannaiGIILL12, author = {Hideo Bannai and Travis Gagie and Tomohiro I and Shunsuke Inenaga and Gad M. Landau and Moshe Lewenstein}, title = {An efficient algorithm to test square-freeness of strings compressed by straight-line programs}, journal = {Inf. Process. Lett.}, volume = {112}, number = {19}, pages = {711--714}, year = {2012}, url = {https://doi.org/10.1016/j.ipl.2012.06.017}, doi = {10.1016/J.IPL.2012.06.017}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BannaiGIILL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsComputing q-Gram Non-overlapping Frequencies on SLP Compressed Texts
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 21-27, 2012. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/sofsem/GotoBIT12, author = {Keisuke Goto and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {M{\'{a}}ria Bielikov{\'{a}} and Gerhard Friedrich and Georg Gottlob and Stefan Katzenbeisser and Gy{\"{o}}rgy Tur{\'{a}}n}, title = {Computing q-Gram Non-overlapping Frequencies on {SLP} Compressed Texts}, booktitle = {{SOFSEM} 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, {\v{S}}pindler{\r{u}}v Ml{\'{y}}n, Czech Republic, January 21-27, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7147}, pages = {301--312}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-27660-6\_25}, doi = {10.1007/978-3-642-27660-6\_25}, timestamp = {Mon, 22 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sofsem/GotoBIT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsEager XPath Evaluation over XML Streams
Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/HagioOBT12, author = {Kazuhito Hagio and Takashi Ohgami and Hideo Bannai and Masayuki Takeda}, editor = {Liliana Calder{\'{o}}n{-}Benavides and Cristina N. Gonz{\'{a}}lez{-}Caro and Edgar Ch{\'{a}}vez and Nivio Ziviani}, title = {Eager XPath Evaluation over {XML} Streams}, booktitle = {String Processing and Information Retrieval - 19th International Symposium, {SPIRE} 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7608}, pages = {245--250}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34109-0\_26}, doi = {10.1007/978-3-642-34109-0\_26}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/spire/HagioOBT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsEfficient LZ78 Factorization of Grammar Compressed Text
Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/BannaiIT12, author = {Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {Liliana Calder{\'{o}}n{-}Benavides and Cristina N. Gonz{\'{a}}lez{-}Caro and Edgar Ch{\'{a}}vez and Nivio Ziviani}, title = {Efficient {LZ78} Factorization of Grammar Compressed Text}, booktitle = {String Processing and Information Retrieval - 19th International Symposium, {SPIRE} 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7608}, pages = {86--98}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34109-0\_10}, doi = {10.1007/978-3-642-34109-0\_10}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/spire/BannaiIT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalFinding Characteristic Substrings from Compressed Texts
Shunsuke Inenaga, Hideo Bannai — Int. J. Found. Comput. Sci., 2012
Cite (BibTeX)
@article{DBLP:journals/ijfcs/InenagaB12, author = {Shunsuke Inenaga and Hideo Bannai}, title = {Finding Characteristic Substrings from Compressed Texts}, journal = {Int. J. Found. Comput. Sci.}, volume = {23}, number = {2}, pages = {261--280}, year = {2012}, url = {https://doi.org/10.1142/S0129054112400126}, doi = {10.1142/S0129054112400126}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/InenagaB12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsGeneral Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations
Tomohiro I, Yuki Enokuma, Hideo Bannai, Masayuki Takeda — Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2012, Bristol, UK, September 24-28, 2012. Proceedings, Part II
Cite (BibTeX)
@inproceedings{DBLP:conf/pkdd/IEBT12, author = {Tomohiro I and Yuki Enokuma and Hideo Bannai and Masayuki Takeda}, editor = {Peter A. Flach and Tijl De Bie and Nello Cristianini}, title = {General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations}, booktitle = {Machine Learning and Knowledge Discovery in Databases - European Conference, {ECML} {PKDD} 2012, Bristol, UK, September 24-28, 2012. Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {7524}, pages = {435--450}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-33486-3\_28}, doi = {10.1007/978-3-642-33486-3\_28}, timestamp = {Tue, 14 May 2019 10:00:47 +0200}, biburl = {https://dblp.org/rec/conf/pkdd/IEBT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsPolyphonic Music Classification on Symbolic Data Using Dissimilarity Functions
Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda, Ken Satoh — Proceedings of the 13th International Society for Music Information Retrieval Conference, ISMIR 2012, Mosteiro S.Bento Da Vitória, Porto, Portugal, October 8-12, 2012
Cite (BibTeX)
@inproceedings{DBLP:conf/ismir/AnanHBTS12, author = {Yoko Anan and Kohei Hatano and Hideo Bannai and Masayuki Takeda and Ken Satoh}, editor = {Fabien Gouyon and Perfecto Herrera and Luis Gustavo Martins and Meinard M{\"{u}}ller}, title = {Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions}, booktitle = {Proceedings of the 13th International Society for Music Information Retrieval Conference, {ISMIR} 2012, Mosteiro S.Bento Da Vit{\'{o}}ria, Porto, Portugal, October 8-12, 2012}, pages = {229--234}, publisher = {{FEUP} Edi{\c{c}}{\~{o}}es}, year = {2012}, url = {http://ismir2012.ismir.net/event/papers/229-ismir-2012.pdf}, timestamp = {Tue, 04 Jan 2022 10:38:10 +0100}, biburl = {https://dblp.org/rec/conf/ismir/AnanHBTS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsSpeeding Up q-Gram Mining on Grammar-Based Compressed Texts
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/GotoBIT12, author = {Keisuke Goto and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {Juha K{\"{a}}rkk{\"{a}}inen and Jens Stoye}, title = {Speeding Up q-Gram Mining on Grammar-Based Compressed Texts}, booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012, Helsinki, Finland, July 3-5, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7354}, pages = {220--231}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31265-6\_18}, doi = {10.1007/978-3-642-31265-6\_18}, timestamp = {Tue, 21 Mar 2023 21:02:12 +0100}, biburl = {https://dblp.org/rec/conf/cpm/GotoBIT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsThe Position Heap of a Trie
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/NakashimaIIBT12, author = {Yuto Nakashima and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Liliana Calder{\'{o}}n{-}Benavides and Cristina N. Gonz{\'{a}}lez{-}Caro and Edgar Ch{\'{a}}vez and Nivio Ziviani}, title = {The Position Heap of a Trie}, booktitle = {String Processing and Information Retrieval - 19th International Symposium, {SPIRE} 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7608}, pages = {360--371}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34109-0\_38}, doi = {10.1007/978-3-642-34109-0\_38}, timestamp = {Sun, 21 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/NakashimaIIBT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintTime and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding
Jun-ichi Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/abs-1204-5524, author = {Jun{-}ichi Yamamoto and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, title = {Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding}, journal = {CoRR}, volume = {abs/1204.5524}, year = {2012}, url = {http://arxiv.org/abs/1204.5524}, eprinttype = {arXiv}, eprint = {1204.5524}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-5524.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2011
ProceedingsComputing Longest Common Substring/Subsequence of Non-linear Texts
Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Proceedings of the Prague Stringology Conference 2011, Prague, Czech Republic, August 29-31, 2011
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/ShimohiraIBT11, author = {Kouji Shimohira and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Computing Longest Common Substring/Subsequence of Non-linear Texts}, booktitle = {Proceedings of the Prague Stringology Conference 2011, Prague, Czech Republic, August 29-31, 2011}, pages = {197--208}, publisher = {Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2011}, url = {http://www.stringology.org/event/2011/p17.html}, timestamp = {Wed, 19 Nov 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stringology/ShimohiraIBT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintComputing q-gram Frequencies on Collage Systems
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/abs-1107-3019, author = {Keisuke Goto and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, title = {Computing q-gram Frequencies on Collage Systems}, journal = {CoRR}, volume = {abs/1107.3019}, year = {2011}, url = {http://arxiv.org/abs/1107.3019}, eprinttype = {arXiv}, eprint = {1107.3019}, timestamp = {Mon, 22 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1107-3019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsEfficient Eager XPath Filtering over XML Streams
Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda — Proceedings of the Prague Stringology Conference 2011, Prague, Czech Republic, August 29-31, 2011
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/HagioOBT11, author = {Kazuhito Hagio and Takashi Ohgami and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Efficient Eager XPath Filtering over {XML} Streams}, booktitle = {Proceedings of the Prague Stringology Conference 2011, Prague, Czech Republic, August 29-31, 2011}, pages = {30--44}, publisher = {Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2011}, url = {http://www.stringology.org/event/2011/p04.html}, timestamp = {Wed, 19 Nov 2025 11:16:19 +0100}, biburl = {https://dblp.org/rec/conf/stringology/HagioOBT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFast q-gram Mining on SLP Compressed Strings
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings
Journal version: J. Discrete Algorithms, 2013
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/GotoBIT11, author = {Keisuke Goto and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {Roberto Grossi and Fabrizio Sebastiani and Fabrizio Silvestri}, title = {Fast q-gram Mining on {SLP} Compressed Strings}, booktitle = {String Processing and Information Retrieval, 18th International Symposium, {SPIRE} 2011, Pisa, Italy, October 17-21, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7024}, pages = {278--289}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-24583-1\_27}, doi = {10.1007/978-3-642-24583-1\_27}, timestamp = {Mon, 22 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/spire/GotoBIT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFaster Subsequence and Don't-Care Pattern Matching on Compressed Texts
Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/YamamotoBIT11, author = {Takanori Yamamoto and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {Raffaele Giancarlo and Giovanni Manzini}, title = {Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts}, booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011, Palermo, Italy, June 27-29, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6661}, pages = {309--322}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-21458-5\_27}, doi = {10.1007/978-3-642-21458-5\_27}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/cpm/YamamotoBIT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsInferring Strings from Suffix Trees and Links on a Binary Alphabet
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Proceedings of the Prague Stringology Conference 2011, Prague, Czech Republic, August 29-31, 2011
Journal version: Discret. Appl. Math., 2014
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/IIBT11, author = {Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Inferring Strings from Suffix Trees and Links on a Binary Alphabet}, booktitle = {Proceedings of the Prague Stringology Conference 2011, Prague, Czech Republic, August 29-31, 2011}, pages = {121--130}, publisher = {Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2011}, url = {http://www.stringology.org/event/2011/p11.html}, timestamp = {Wed, 19 Nov 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stringology/IIBT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsMusic Genre Classification using Similarity Functions
Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda — Proceedings of the 12th International Society for Music Information Retrieval Conference, ISMIR 2011, Miami, Florida, USA, October 24-28, 2011
Cite (BibTeX)
@inproceedings{DBLP:conf/ismir/AnanHBT11, author = {Yoko Anan and Kohei Hatano and Hideo Bannai and Masayuki Takeda}, editor = {Anssi Klapuri and Colby Leider}, title = {Music Genre Classification using Similarity Functions}, booktitle = {Proceedings of the 12th International Society for Music Information Retrieval Conference, {ISMIR} 2011, Miami, Florida, USA, October 24-28, 2011}, pages = {693--698}, publisher = {University of Miami}, year = {2011}, url = {http://ismir2011.ismir.net/papers/PS6-7.pdf}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ismir/AnanHBT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintRestructuring Compressed Texts without Explicit Decompression
Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga, Hideo Bannai, Hiroshi Sakamoto, Masayuki Takeda
Cite (BibTeX)
@article{DBLP:journals/corr/abs-1107-2729, author = {Keisuke Goto and Shirou Maruyama and Shunsuke Inenaga and Hideo Bannai and Hiroshi Sakamoto and Masayuki Takeda}, title = {Restructuring Compressed Texts without Explicit Decompression}, journal = {CoRR}, volume = {abs/1107.2729}, year = {2011}, url = {http://arxiv.org/abs/1107.2729}, eprinttype = {arXiv}, eprint = {1107.2729}, timestamp = {Mon, 22 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1107-2729.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalVerifying and enumerating parameterized border arrays
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2011
Cite (BibTeX)
@article{DBLP:journals/tcs/IIBT11, author = {Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Verifying and enumerating parameterized border arrays}, journal = {Theor. Comput. Sci.}, volume = {412}, number = {50}, pages = {6959--6981}, year = {2011}, url = {https://doi.org/10.1016/j.tcs.2011.09.008}, doi = {10.1016/J.TCS.2011.09.008}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/IIBT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2010
ProceedingsCounting and Verifying Maximal Palindromes
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/spire/IIBT10, author = {Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Edgar Ch{\'{a}}vez and Stefano Lonardi}, title = {Counting and Verifying Maximal Palindromes}, booktitle = {String Processing and Information Retrieval - 17th International Symposium, {SPIRE} 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6393}, pages = {135--146}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16321-0\_13}, doi = {10.1007/978-3-642-16321-0\_13}, timestamp = {Sat, 05 Sep 2020 18:08:29 +0200}, biburl = {https://dblp.org/rec/conf/spire/IIBT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsSparse Substring Pattern Set Discovery Using Linear Programming Boosting
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda — Discovery Science - 13th International Conference, DS 2010, Canberra, Australia, October 6-8, 2010. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/dis/KashiharaHBT10, author = {Kazuaki Kashihara and Kohei Hatano and Hideo Bannai and Masayuki Takeda}, editor = {Bernhard Pfahringer and Geoffrey Holmes and Achim G. Hoffmann}, title = {Sparse Substring Pattern Set Discovery Using Linear Programming Boosting}, booktitle = {Discovery Science - 13th International Conference, {DS} 2010, Canberra, Australia, October 6-8, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6332}, pages = {132--143}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16184-1\_10}, doi = {10.1007/978-3-642-16184-1\_10}, timestamp = {Thu, 19 Mar 2020 15:28:05 +0100}, biburl = {https://dblp.org/rec/conf/dis/KashiharaHBT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsThe Number of Runs in a Ternary Word
Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson — Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/BannaiGKMSS10, author = {Hideo Bannai and Mathieu Giraud and Kazuhiko Kusano and Wataru Matsubara and Ayumi Shinohara and Jamie Simpson}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {The Number of Runs in a Ternary Word}, booktitle = {Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010}, pages = {178--181}, publisher = {Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague}, year = {2010}, url = {http://www.stringology.org/event/2010/p16.html}, timestamp = {Wed, 19 Nov 2025 11:16:20 +0100}, biburl = {https://dblp.org/rec/conf/stringology/BannaiGKMSS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsVerifying a Parameterized Border Array in <i>O</i>(<i>n</i><sup>1.5</sup>) Time
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/IIBT10, author = {Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Amihood Amir and Laxmi Parida}, title = {Verifying a Parameterized Border Array in \emph{O}(\emph{n}\({}^{\mbox{1.5}}\)) Time}, booktitle = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010, New York, NY, USA, June 21-23, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6129}, pages = {238--250}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13509-5\_22}, doi = {10.1007/978-3-642-13509-5\_22}, timestamp = {Tue, 14 May 2019 10:00:38 +0200}, biburl = {https://dblp.org/rec/conf/cpm/IIBT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2009
ProceedingsA Series of Run-Rich Strings
Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara — Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/lata/MatsubaraKBS09, author = {Wataru Matsubara and Kazuhiko Kusano and Hideo Bannai and Ayumi Shinohara}, editor = {Adrian{-}Horia Dediu and Armand{-}Mihai Ionescu and Carlos Mart{\'{\i}}n{-}Vide}, title = {A Series of Run-Rich Strings}, booktitle = {Language and Automata Theory and Applications, Third International Conference, {LATA} 2009, Tarragona, Spain, April 2-8, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5457}, pages = {578--587}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-00982-2\_49}, doi = {10.1007/978-3-642-00982-2\_49}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/lata/MatsubaraKBS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsBetter Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality
Takanori Yamamoto, Hideo Bannai, Masao Nagasaki, Satoru Miyano — Discovery Science, 12th International Conference, DS 2009, Porto, Portugal, October 3-5, 2009
Cite (BibTeX)
@inproceedings{DBLP:conf/dis/YamamotoBNM09, author = {Takanori Yamamoto and Hideo Bannai and Masao Nagasaki and Satoru Miyano}, editor = {Jo{\~{a}}o Gama and V{\'{\i}}tor Santos Costa and Al{\'{\i}}pio M{\'{a}}rio Jorge and Pavel Brazdil}, title = {Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality}, booktitle = {Discovery Science, 12th International Conference, {DS} 2009, Porto, Portugal, October 3-5, 2009}, series = {Lecture Notes in Computer Science}, volume = {5808}, pages = {465--472}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-04747-3\_40}, doi = {10.1007/978-3-642-04747-3\_40}, timestamp = {Mon, 30 Nov 2020 08:47:30 +0100}, biburl = {https://dblp.org/rec/conf/dis/YamamotoBNM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsBit-parallel Algorithms for Computing all the Runs in a String
Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara — Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/HirashimaBMIS09, author = {Kazunori Hirashima and Hideo Bannai and Wataru Matsubara and Akira Ishino and Ayumi Shinohara}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Bit-parallel Algorithms for Computing all the Runs in a String}, booktitle = {Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009}, pages = {203--213}, publisher = {Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague}, year = {2009}, url = {http://www.stringology.org/event/2009/p19.html}, timestamp = {Wed, 19 Nov 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stringology/HirashimaBMIS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsCounting Parameterized Border Arrays for a Binary Alphabet
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/lata/IIBT09, author = {Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Adrian{-}Horia Dediu and Armand{-}Mihai Ionescu and Carlos Mart{\'{\i}}n{-}Vide}, title = {Counting Parameterized Border Arrays for a Binary Alphabet}, booktitle = {Language and Automata Theory and Applications, Third International Conference, {LATA} 2009, Tarragona, Spain, April 2-8, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5457}, pages = {422--433}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-00982-2\_36}, doi = {10.1007/978-3-642-00982-2\_36}, timestamp = {Sun, 01 Feb 2026 13:30:45 +0100}, biburl = {https://dblp.org/rec/conf/lata/IIBT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFinding Characteristic Substrings from Compressed Texts
Shunsuke Inenaga, Hideo Bannai — Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009
Journal version: Int. J. Found. Comput. Sci., 2012
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/InenagaB09, author = {Shunsuke Inenaga and Hideo Bannai}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Finding Characteristic Substrings from Compressed Texts}, booktitle = {Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009}, pages = {40--54}, publisher = {Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague}, year = {2009}, url = {http://www.stringology.org/event/2009/p05.html}, timestamp = {Wed, 19 Nov 2025 11:16:20 +0100}, biburl = {https://dblp.org/rec/conf/stringology/InenagaB09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsLightweight Parameterized Suffix Array Construction
Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicı́, Czech Republic, June 28-July 2, 2009, Revised Selected Papers
Cite (BibTeX)
@inproceedings{DBLP:conf/iwoca/TomohiroDBIT09, author = {Tomohiro I and Satoshi Deguchi and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {Jir{\'{\i}} Fiala and Jan Kratochv{\'{\i}}l and Mirka Miller}, title = {Lightweight Parameterized Suffix Array Construction}, booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009, Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {5874}, pages = {312--323}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10217-2\_31}, doi = {10.1007/978-3-642-10217-2\_31}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/TomohiroDBIT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalLinear-Time Text Compression by Longest-First Substitution
Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara — Algorithms, 2009
Cite (BibTeX)
@article{DBLP:journals/algorithms/NakamuraIBFTS09, author = {Ryosuke Nakamura and Shunsuke Inenaga and Hideo Bannai and Takashi Funamoto and Masayuki Takeda and Ayumi Shinohara}, title = {Linear-Time Text Compression by Longest-First Substitution}, journal = {Algorithms}, volume = {2}, number = {4}, pages = {1429--1448}, year = {2009}, url = {https://doi.org/10.3390/a2041429}, doi = {10.3390/A2041429}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithms/NakamuraIBFTS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2008
ProceedingsNew Lower Bounds for the Maximum Number of Runs in a String
Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara — Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/MatsubaraKIBS08, author = {Wataru Matsubara and Kazuhiko Kusano and Akira Ishino and Hideo Bannai and Ayumi Shinohara}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {New Lower Bounds for the Maximum Number of Runs in a String}, booktitle = {Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008}, pages = {140--145}, publisher = {Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague}, year = {2008}, url = {http://www.stringology.org/event/2008/p13.html}, timestamp = {Wed, 19 Nov 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stringology/MatsubaraKIBS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsParameterized Suffix Arrays for Binary Strings
Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/DeguchiHBIT08, author = {Satoshi Deguchi and Fumihito Higashijima and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Parameterized Suffix Arrays for Binary Strings}, booktitle = {Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008}, pages = {84--94}, publisher = {Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague}, year = {2008}, url = {http://www.stringology.org/event/2008/p08.html}, timestamp = {Wed, 19 Nov 2025 11:16:20 +0100}, biburl = {https://dblp.org/rec/conf/stringology/DeguchiHBIT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalReachability on Suffix Tree Graphs
Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — Int. J. Found. Comput. Sci., 2008
Cite (BibTeX)
@article{DBLP:journals/ijfcs/HigaBIT08, author = {Yasuto Higa and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, title = {Reachability on Suffix Tree Graphs}, journal = {Int. J. Found. Comput. Sci.}, volume = {19}, number = {1}, pages = {147--162}, year = {2008}, url = {https://doi.org/10.1142/S0129054108005590}, doi = {10.1142/S0129054108005590}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/HigaBIT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsString Kernels Based on Variable-Length-Don't-Care Patterns
Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda — Discovery Science, 11th International Conference, DS 2008, Budapest, Hungary, October 13-16, 2008. Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/dis/NarisawaBHIT08, author = {Kazuyuki Narisawa and Hideo Bannai and Kohei Hatano and Shunsuke Inenaga and Masayuki Takeda}, editor = {Jean{-}Fran{\c{c}}ois Boulicaut and Michael R. Berthold and Tam{\'{a}}s Horv{\'{a}}th}, title = {String Kernels Based on Variable-Length-Don't-Care Patterns}, booktitle = {Discovery Science, 11th International Conference, {DS} 2008, Budapest, Hungary, October 13-16, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5255}, pages = {308--318}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-88411-8\_29}, doi = {10.1007/978-3-540-88411-8\_29}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/dis/NarisawaBHIT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalUniqueness of certain association schemes
Eiichi Bannai, Etsuko Bannai, Hideo Bannai — Eur. J. Comb., 2008
Cite (BibTeX)
@article{DBLP:journals/ejc/BannaiBB08, author = {Eiichi Bannai and Etsuko Bannai and Hideo Bannai}, title = {Uniqueness of certain association schemes}, journal = {Eur. J. Comb.}, volume = {29}, number = {6}, pages = {1379--1395}, year = {2008}, url = {https://doi.org/10.1016/j.ejc.2007.06.016}, doi = {10.1016/J.EJC.2007.06.016}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/BannaiBB08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2007
ProceedingsAlgorithms for String Pattern Discovery
Hideo Bannai — Modeling Decisions for Artificial Intelligence, 4th International Conference, MDAI 2007, Kitakyushu, Japan, August 16-18, 2007, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/mdai/Bannai07, author = {Hideo Bannai}, editor = {Vicen{\c{c}} Torra and Yasuo Narukawa and Yuji Yoshida}, title = {Algorithms for String Pattern Discovery}, booktitle = {Modeling Decisions for Artificial Intelligence, 4th International Conference, {MDAI} 2007, Kitakyushu, Japan, August 16-18, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4617}, pages = {24--29}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-73729-2\_3}, doi = {10.1007/978-3-540-73729-2\_3}, timestamp = {Tue, 07 May 2024 20:11:44 +0200}, biburl = {https://dblp.org/rec/conf/mdai/Bannai07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsEfficient Computation of Substring Equivalence Classes with Suffix Arrays
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings
Journal version: Algorithmica, 2017
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/NarisawaIBT07, author = {Kazuyuki Narisawa and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Bin Ma and Kaizhong Zhang}, title = {Efficient Computation of Substring Equivalence Classes with Suffix Arrays}, booktitle = {Combinatorial Pattern Matching, 18th Annual Symposium, {CPM} 2007, London, Canada, July 9-11, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4580}, pages = {340--351}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-73437-6\_34}, doi = {10.1007/978-3-540-73437-6\_34}, timestamp = {Mon, 13 Mar 2023 16:58:28 +0100}, biburl = {https://dblp.org/rec/conf/cpm/NarisawaIBT07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalOn the complexity of deriving position specific score matrices from positive and negative sequences
Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott — Discret. Appl. Math., 2007
Cite (BibTeX)
@article{DBLP:journals/dam/AkutsuBMO07, author = {Tatsuya Akutsu and Hideo Bannai and Satoru Miyano and Sascha Ott}, title = {On the complexity of deriving position specific score matrices from positive and negative sequences}, journal = {Discret. Appl. Math.}, volume = {155}, number = {6-7}, pages = {676--685}, year = {2007}, url = {https://doi.org/10.1016/j.dam.2004.10.011}, doi = {10.1016/J.DAM.2004.10.011}, timestamp = {Wed, 03 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/AkutsuBMO07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsSimple Linear-Time Off-Line Text Compression by Longest-First Substitution
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — 2007 Data Compression Conference (DCC 2007), 27-29 March 2007, Snowbird, UT, USA
Cite (BibTeX)
@inproceedings{DBLP:conf/dcc/NakamuraBIT07, author = {Ryosuke Nakamura and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, title = {Simple Linear-Time Off-Line Text Compression by Longest-First Substitution}, booktitle = {2007 Data Compression Conference {(DCC} 2007), 27-29 March 2007, Snowbird, UT, {USA}}, pages = {123--132}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/DCC.2007.70}, doi = {10.1109/DCC.2007.70}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dcc/NakamuraBIT07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsUnsupervised Spam Detection Based on String Alienness Measures
Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda — Discovery Science, 10th International Conference, DS 2007, Sendai, Japan, October 1-4, 2007, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/dis/NarisawaBHT07, author = {Kazuyuki Narisawa and Hideo Bannai and Kohei Hatano and Masayuki Takeda}, editor = {Vincent Corruble and Masayuki Takeda and Einoshin Suzuki}, title = {Unsupervised Spam Detection Based on String Alienness Measures}, booktitle = {Discovery Science, 10th International Conference, {DS} 2007, Sendai, Japan, October 1-4, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4755}, pages = {161--172}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-75488-6\_16}, doi = {10.1007/978-3-540-75488-6\_16}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/dis/NarisawaBHT07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2006
ProceedingsA New Family of String Classifiers Based on Local Relatedness
Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Discovery Science, 9th International Conference, DS 2006, Barcelona, Spain, October 7-10, 2006, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/dis/HigaIBT06, author = {Yasuto Higa and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Ljupco Todorovski and Nada Lavrac and Klaus P. Jantke}, title = {A New Family of String Classifiers Based on Local Relatedness}, booktitle = {Discovery Science, 9th International Conference, {DS} 2006, Barcelona, Spain, October 7-10, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4265}, pages = {114--124}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11893318\_14}, doi = {10.1007/11893318\_14}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/dis/HigaIBT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsReachability on suffix tree graphs
Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda — Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 28-30, 2006
Journal version: Int. J. Found. Comput. Sci., 2008
Cite (BibTeX)
@inproceedings{DBLP:conf/stringology/HigaBIT06, author = {Yasuto Higa and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {Jan Holub and Jan Zd{\'{a}}rek}, title = {Reachability on suffix tree graphs}, booktitle = {Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 28-30, 2006}, pages = {212--225}, publisher = {Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University}, year = {2006}, url = {http://www.stringology.org/event/2006/p20.html}, timestamp = {Wed, 19 Nov 2025 11:16:21 +0100}, biburl = {https://dblp.org/rec/conf/stringology/HigaBIT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2005
ProceedingsEstimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks
Osamu Hirose, Naoki Nariai, Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Satoru Miyano — Computational Science and Its Applications - ICCSA 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part III
Cite (BibTeX)
@inproceedings{DBLP:conf/iccsa/HiroseNTBIM05, author = {Osamu Hirose and Naoki Nariai and Yoshinori Tamada and Hideo Bannai and Seiya Imoto and Satoru Miyano}, editor = {Osvaldo Gervasi and Marina L. Gavrilova and Vipin Kumar and Antonio Lagan{\`{a}} and Heow Pueh Lee and Youngsong Mun and David Taniar and Chih Jeng Kenneth Tan}, title = {Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks}, booktitle = {Computational Science and Its Applications - {ICCSA} 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part {III}}, series = {Lecture Notes in Computer Science}, volume = {3482}, pages = {349--356}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11424857\_38}, doi = {10.1007/11424857\_38}, timestamp = {Thu, 28 Apr 2022 16:17:38 +0200}, biburl = {https://dblp.org/rec/conf/iccsa/HiroseNTBIM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsPractical Algorithms for Pattern Based Linear Regression
Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda — Discovery Science, 8th International Conference, DS 2005, Singapore, October 8-11, 2005, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/dis/BannaiHIT05, author = {Hideo Bannai and Kohei Hatano and Shunsuke Inenaga and Masayuki Takeda}, editor = {Achim G. Hoffmann and Hiroshi Motoda and Tobias Scheffer}, title = {Practical Algorithms for Pattern Based Linear Regression}, booktitle = {Discovery Science, 8th International Conference, {DS} 2005, Singapore, October 8-11, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3735}, pages = {44--56}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11563983\_6}, doi = {10.1007/11563983\_6}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/dis/BannaiHIT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalUtilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models
Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Toshiaki Katayama, Minoru Kanehisa, Satoru Miyano — J. Bioinform. Comput. Biol., 2005
Cite (BibTeX)
@article{DBLP:journals/jbcb/TamadaBIKKM05, author = {Yoshinori Tamada and Hideo Bannai and Seiya Imoto and Toshiaki Katayama and Minoru Kanehisa and Satoru Miyano}, title = {Utilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models}, journal = {J. Bioinform. Comput. Biol.}, volume = {3}, number = {6}, pages = {1295--1314}, year = {2005}, url = {https://doi.org/10.1142/S0219720005001569}, doi = {10.1142/S0219720005001569}, timestamp = {Mon, 03 Mar 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jbcb/TamadaBIKKM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2004
JournalAn O(N²) Algorithm for Discovering Optimal Boolean Pattern Pairs
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano — IEEE ACM Trans. Comput. Biol. Bioinform., 2004
Cite (BibTeX)
@article{DBLP:journals/tcbb/BannaiHSTNM04, author = {Hideo Bannai and Heikki Hyyr{\"{o}} and Ayumi Shinohara and Masayuki Takeda and Kenta Nakai and Satoru Miyano}, title = {An O(N\({}^{\mbox{2}}\)) Algorithm for Discovering Optimal Boolean Pattern Pairs}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {1}, number = {4}, pages = {159--170}, year = {2004}, url = {https://doi.org/10.1109/TCBB.2004.36}, doi = {10.1109/TCBB.2004.36}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/BannaiHSTNM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalEfficiently Finding Regulatory Elements Using Correlation with Gene Expression
Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano — J. Bioinform. Comput. Biol., 2004
Cite (BibTeX)
@article{DBLP:journals/jbcb/BannaiISTM04, author = {Hideo Bannai and Shunsuke Inenaga and Ayumi Shinohara and Masayuki Takeda and Satoru Miyano}, title = {Efficiently Finding Regulatory Elements Using Correlation with Gene Expression}, journal = {J. Bioinform. Comput. Biol.}, volume = {2}, number = {2}, pages = {273--288}, year = {2004}, url = {https://doi.org/10.1142/S0219720004000612}, doi = {10.1142/S0219720004000612}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jbcb/BannaiISTM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFinding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano — Discovery Science, 7th International Conference, DS 2004, Padova, Italy, October 2-5, 2004, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/dis/InenagaBHSTNM04, author = {Shunsuke Inenaga and Hideo Bannai and Heikki Hyyr{\"{o}} and Ayumi Shinohara and Masayuki Takeda and Kenta Nakai and Satoru Miyano}, editor = {Einoshin Suzuki and Setsuo Arikawa}, title = {Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance}, booktitle = {Discovery Science, 7th International Conference, {DS} 2004, Padova, Italy, October 2-5, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3245}, pages = {32--46}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30214-8\_3}, doi = {10.1007/978-3-540-30214-8\_3}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dis/InenagaBHSTNM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFinding Optimal Pairs of Patterns
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano — Algorithms in Bioinformatics, 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/wabi/BannaiHSTNM04, author = {Hideo Bannai and Heikki Hyyr{\"{o}} and Ayumi Shinohara and Masayuki Takeda and Kenta Nakai and Satoru Miyano}, editor = {Inge Jonassen and Junhyong Kim}, title = {Finding Optimal Pairs of Patterns}, booktitle = {Algorithms in Bioinformatics, 4th International Workshop, {WABI} 2004, Bergen, Norway, September 17-21, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3240}, pages = {450--462}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30219-3\_38}, doi = {10.1007/978-3-540-30219-3\_38}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wabi/BannaiHSTNM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2003
ProceedingsDiscovering Most Classificatory Patterns for Very Expressive Pattern Classes
Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa — Discovery Science, 6th International Conference, DS 2003, Sapporo, Japan, October 17-19,2003, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/dis/TakedaIBSA03, author = {Masayuki Takeda and Shunsuke Inenaga and Hideo Bannai and Ayumi Shinohara and Setsuo Arikawa}, editor = {Gunter Grieser and Yuzuru Tanaka and Akihiro Yamamoto}, title = {Discovering Most Classificatory Patterns for Very Expressive Pattern Classes}, booktitle = {Discovery Science, 6th International Conference, {DS} 2003, Sapporo, Japan, October 17-19,2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2843}, pages = {486--493}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39644-4\_50}, doi = {10.1007/978-3-540-39644-4\_50}, timestamp = {Sun, 07 Dec 2025 22:10:07 +0100}, biburl = {https://dblp.org/rec/conf/dis/TakedaIBSA03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsEstimating gene networks from gene expression data by combining Bayesian network model with promoter element detection
Yoshinori Tamada, SunYong Kim, Hideo Bannai, Seiya Imoto, Kousuke Tashiro, Satoru Kuhara, Satoru Miyano — Proceedings of the European Conference on Computational Biology (ECCB 2003), September 27-30, 2003, Paris, France
Cite (BibTeX)
@inproceedings{DBLP:conf/eccb/TamadaKBITKM03, author = {Yoshinori Tamada and SunYong Kim and Hideo Bannai and Seiya Imoto and Kousuke Tashiro and Satoru Kuhara and Satoru Miyano}, title = {Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection}, booktitle = {Proceedings of the European Conference on Computational Biology {(ECCB} 2003), September 27-30, 2003, Paris, France}, pages = {227--236}, year = {2003}, url = {https://doi.org/10.1093/bioinformatics/btg1082}, doi = {10.1093/BIOINFORMATICS/BTG1082}, timestamp = {Sun, 01 Feb 2026 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/eccb/TamadaKBITKM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsInferring Strings from Graphs and Arrays
Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda — Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/mfcs/BannaiIST03, author = {Hideo Bannai and Shunsuke Inenaga and Ayumi Shinohara and Masayuki Takeda}, editor = {Branislav Rovan and Peter Vojt{\'{a}}s}, title = {Inferring Strings from Graphs and Arrays}, booktitle = {Mathematical Foundations of Computer Science 2003, 28th International Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2747}, pages = {208--217}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45138-9\_15}, doi = {10.1007/978-3-540-45138-9\_15}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/BannaiIST03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsIntrasplicing - Analysis of Long Intron Sequences
Sascha Ott, Yoshinori Tamada, Hideo Bannai, Kenta Nakai, Satoru Miyano — Proceedings of the 8th Pacific Symposium on Biocomputing, PSB 2003, Lihue, Hawaii, USA, January 3-7, 2003
Cite (BibTeX)
@inproceedings{DBLP:conf/psb/OttTBNM03, author = {Sascha Ott and Yoshinori Tamada and Hideo Bannai and Kenta Nakai and Satoru Miyano}, editor = {Russ B. Altman and A. Keith Dunker and Lawrence Hunter and Teri E. Klein}, title = {Intrasplicing - Analysis of Long Intron Sequences}, booktitle = {Proceedings of the 8th Pacific Symposium on Biocomputing, {PSB} 2003, Lihue, Hawaii, USA, January 3-7, 2003}, pages = {339--350}, year = {2003}, url = {http://psb.stanford.edu/psb-online/proceedings/psb03/ott.pdf}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/psb/OttTBNM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalThe Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation
Eijiro Sumii, Hideo Bannai — J. Funct. Log. Program., 2003
Cite (BibTeX)
@article{DBLP:journals/jflp/SumiiB03, author = {Eijiro Sumii and Hideo Bannai}, title = {The Extension of {ML} with Hypothetical Views for Discovery Science: Formalization and Implementation}, journal = {J. Funct. Log. Program.}, volume = {2003}, year = {2003}, url = {http://danae.uni-muenster.de/lehre/kuchen/JFLP/articles/2003/S03-01/JFLP-A03-03/vml.pdf}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jflp/SumiiB03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2002
ProceedingsDiscovering Best Variable-Length-Don't-Care Patterns
Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa — Discovery Science, 5th International Conference, DS 2002, Lübeck, Germany, November 24-26, 2002, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/dis/InenagaBSTA02, author = {Shunsuke Inenaga and Hideo Bannai and Ayumi Shinohara and Masayuki Takeda and Setsuo Arikawa}, editor = {Steffen Lange and Ken Satoh and Carl H. Smith}, title = {Discovering Best Variable-Length-Don't-Care Patterns}, booktitle = {Discovery Science, 5th International Conference, {DS} 2002, L{\"{u}}beck, Germany, November 24-26, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2534}, pages = {86--97}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36182-0\_10}, doi = {10.1007/3-540-36182-0\_10}, timestamp = {Tue, 28 Jul 2026 19:33:21 +0200}, biburl = {https://dblp.org/rec/conf/dis/InenagaBSTA02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalExtensive feature detection of N-terminal protein sorting signals
Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano — Bioinform., 2002
Cite (BibTeX)
@article{DBLP:journals/bioinformatics/BannaiTMNM02, author = {Hideo Bannai and Yoshinori Tamada and Osamu Maruyama and Kenta Nakai and Satoru Miyano}, title = {Extensive feature detection of N-terminal protein sorting signals}, journal = {Bioinform.}, volume = {18}, number = {2}, pages = {298--305}, year = {2002}, url = {https://doi.org/10.1093/bioinformatics/18.2.298}, doi = {10.1093/BIOINFORMATICS/18.2.298}, timestamp = {Thu, 25 Dec 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/bioinformatics/BannaiTMNM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalFast algorithm for extracting multiple unordered short motifs using bit operations
Osamu Maruyama, Hideo Bannai, Yoshinori Tamada, Satoru Kuhara, Satoru Miyano — Inf. Sci., 2002
Cite (BibTeX)
@article{DBLP:journals/isci/MaruyamaBTKM02, author = {Osamu Maruyama and Hideo Bannai and Yoshinori Tamada and Satoru Kuhara and Satoru Miyano}, title = {Fast algorithm for extracting multiple unordered short motifs using bit operations}, journal = {Inf. Sci.}, volume = {146}, number = {1-4}, pages = {115--126}, year = {2002}, url = {https://doi.org/10.1016/S0020-0255(02)00219-0}, doi = {10.1016/S0020-0255(02)00219-0}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isci/MaruyamaBTKM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFast Algorithm for Extracting Multiple Unordered Short Motifs Using Bit Operations
Osamu Maruyama, Satoru Kuhara, Hideo Bannai, Satoru Miyano, Yoshinori Tamada — Proceedings of the 6th Joint Conference on Information Science, March 8-13, 2002, Research Triangle Park, North Carolina, USA
Journal version: Inf. Sci., 2002
Cite (BibTeX)
@inproceedings{DBLP:conf/jcis/MaruyamaKBMT02, author = {Osamu Maruyama and Satoru Kuhara and Hideo Bannai and Satoru Miyano and Yoshinori Tamada}, editor = {H. John Caulfield and Shu{-}Heng Chen and Heng{-}Da Cheng and Richard J. Duro and Vasant G. Honavar and Etienne E. Kerre and Mi Lu and Manuel Gra{\~{n}}a Romay and Timothy K. Shih and Dan Ventura and Paul P. Wang and Yuanyuan Yang}, title = {Fast Algorithm for Extracting Multiple Unordered Short Motifs Using Bit Operations}, booktitle = {Proceedings of the 6th Joint Conference on Information Science, March 8-13, 2002, Research Triangle Park, North Carolina, {USA}}, pages = {1180--1185}, publisher = {{JCIS} / Association for Intelligent Machinery, Inc.}, year = {2002}, timestamp = {Mon, 13 Nov 2017 18:15:11 +0100}, biburl = {https://dblp.org/rec/conf/jcis/MaruyamaKBMT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsFoundations of Designing Computational Knowledge Discovery Processes
Yoshinori Tamada, Hideo Bannai, Osamu Maruyama, Satoru Miyano — Progress in Discovery Science, Final Report of the Japanese Discovery Science Project, 2002
Cite (BibTeX)
@inproceedings{DBLP:conf/dsp/TamadaBMM02, author = {Yoshinori Tamada and Hideo Bannai and Osamu Maruyama and Satoru Miyano}, editor = {Setsuo Arikawa and Ayumi Shinohara}, title = {Foundations of Designing Computational Knowledge Discovery Processes}, booktitle = {Progress in Discovery Science, Final Report of the Japanese Discovery Science Project}, series = {Lecture Notes in Computer Science}, volume = {2281}, pages = {459--470}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45884-0\_34}, doi = {10.1007/3-540-45884-0\_34}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/dsp/TamadaBMM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsOn the Complexity of Deriving Position Specific Score Matrices from Examples
Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott — Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/cpm/AkutsuBMO02, author = {Tatsuya Akutsu and Hideo Bannai and Satoru Miyano and Sascha Ott}, editor = {Alberto Apostolico and Masayuki Takeda}, title = {On the Complexity of Deriving Position Specific Score Matrices from Examples}, booktitle = {Combinatorial Pattern Matching, 13th Annual Symposium, {CPM} 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2373}, pages = {168--177}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45452-7\_15}, doi = {10.1007/3-540-45452-7\_15}, timestamp = {Wed, 03 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/AkutsuBMO02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsSpace-Economical Construction of Index Structures for All Suffixes of a String
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa — Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/mfcs/InenagaSTBA02, author = {Shunsuke Inenaga and Ayumi Shinohara and Masayuki Takeda and Hideo Bannai and Setsuo Arikawa}, editor = {Krzysztof Diks and Wojciech Rytter}, title = {Space-Economical Construction of Index Structures for All Suffixes of a String}, booktitle = {Mathematical Foundations of Computer Science 2002, 27th International Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2420}, pages = {341--352}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45687-2\_28}, doi = {10.1007/3-540-45687-2\_28}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/InenagaSTBA02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsVM lambda: A Functional Calculusfor Scientific Discovery
Eijiro Sumii, Hideo Bannai — Functional and Logic Programming, 6th International Symposium, FLOPS 2002, Aizu, Japan, September 15-17, 2002, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/flops/SumiiB02, author = {Eijiro Sumii and Hideo Bannai}, editor = {Zhenjiang Hu and Mario Rodr{\'{\i}}guez{-}Artalejo}, title = {{VM} lambda: {A} Functional Calculusfor Scientific Discovery}, booktitle = {Functional and Logic Programming, 6th International Symposium, {FLOPS} 2002, Aizu, Japan, September 15-17, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2441}, pages = {290--304}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45788-7\_18}, doi = {10.1007/3-540-45788-7\_18}, timestamp = {Mon, 20 Apr 2026 19:25:48 +0200}, biburl = {https://dblp.org/rec/conf/flops/SumiiB02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
2001
JournalHypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process
Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano — Electron. Trans. Artif. Intell., 2001
Cite (BibTeX)
@article{DBLP:journals/etai/BannaiTMM01, author = {Hideo Bannai and Yoshinori Tamada and Osamu Maruyama and Satoru Miyano}, title = {HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process}, journal = {Electron. Trans. Artif. Intell.}, volume = {5}, number = {B}, pages = {73--83}, year = {2001}, url = {http://www.ep.liu.se/ej/etai/2001/004/}, timestamp = {Wed, 05 May 2004 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/etai/BannaiTMM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsViews: Fundamental Building Blocks in the Process of Knowledge Discovery
Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano — Proceedings of the Fourteenth International Florida Artificial Intelligence Research Society Conference, May 21-23, 2001, Key West, Florida, USA
Cite (BibTeX)
@inproceedings{DBLP:conf/flairs/BannaiTMNM01, author = {Hideo Bannai and Yoshinori Tamada and Osamu Maruyama and Kenta Nakai and Satoru Miyano}, editor = {Ingrid Russell and John F. Kolen}, title = {Views: Fundamental Building Blocks in the Process of Knowledge Discovery}, booktitle = {Proceedings of the Fourteenth International Florida Artificial Intelligence Research Society Conference, May 21-23, 2001, Key West, Florida, {USA}}, pages = {233--238}, publisher = {{AAAI} Press}, year = {2001}, url = {http://www.aaai.org/Library/FLAIRS/2001/flairs01-045.php}, timestamp = {Wed, 26 Oct 2022 08:35:34 +0200}, biburl = {https://dblp.org/rec/conf/flairs/BannaiTMNM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsVM lambda: a Functional Calculus for Scientific Discovery
Eijiro Sumii, Hideo Bannai — The Second Asian Workshop on Programming Languages and Systems, APLAS'01, Korea Advanced Institute of Science and Technology, Daejeon, Korea, December 17-18, 2001, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/aplas/SumiiB01, author = {Eijiro Sumii and Hideo Bannai}, title = {{VM} lambda: a Functional Calculus for Scientific Discovery}, booktitle = {The Second Asian Workshop on Programming Languages and Systems, APLAS'01, Korea Advanced Institute of Science and Technology, Daejeon, Korea, December 17-18, 2001, Proceedings}, pages = {265--275}, year = {2001}, timestamp = {Tue, 01 Jun 2004 13:15:57 +0200}, biburl = {https://dblp.org/rec/conf/aplas/SumiiB01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }ProceedingsVML: A View Modeling Language for Computational Knowledge Discovery
Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano — Discovery Science, 4th International Conference, DS 2001, Washington, DC, USA, November 25-28, 2001, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/dis/BannaiTMM01, author = {Hideo Bannai and Yoshinori Tamada and Osamu Maruyama and Satoru Miyano}, editor = {Klaus P. Jantke and Ayumi Shinohara}, title = {{VML:} {A} View Modeling Language for Computational Knowledge Discovery}, booktitle = {Discovery Science, 4th International Conference, {DS} 2001, Washington, DC, USA, November 25-28, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2226}, pages = {30--44}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45650-3\_6}, doi = {10.1007/3-540-45650-3\_6}, timestamp = {Sun, 06 Oct 2024 20:59:46 +0200}, biburl = {https://dblp.org/rec/conf/dis/BannaiTMM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
1999
ProceedingsA Definition of Discovery in Terms of Generalized Descriptional Complexity
Hideo Bannai, Satoru Miyano — Discovery Science, Second International Conference, DS '99, Tokyo, Japan, December, 1999, Proceedings
Cite (BibTeX)
@inproceedings{DBLP:conf/dis/BannaiM98, author = {Hideo Bannai and Satoru Miyano}, editor = {Setsuo Arikawa and Koichi Furukawa}, title = {A Definition of Discovery in Terms of Generalized Descriptional Complexity}, booktitle = {Discovery Science, Second International Conference, {DS} '99, Tokyo, Japan, December, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1721}, pages = {316--318}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46846-3\_29}, doi = {10.1007/3-540-46846-3\_29}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/dis/BannaiM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

