If you made any changes in Pure these will be visible here soon.

Research Output

Filter
Conference contribution
2020

C-Trie++: A dynamic trie tailored for fast prefix searches

Tsuruta, K., Koppl, D., Kanda, S., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Mar 2020, Proceedings - DCC 2020: Data Compression Conference. Bilgin, A., Marcellin, M. W., Serra-Sagrista, J. & Storer, J. A. (eds.). Institute of Electrical and Electronics Engineers Inc., p. 243-252 10 p. 9105914. (Data Compression Conference Proceedings; vol. 2020-March).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Faster STR-EC-LCS Computation

Yamada, K., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2020, SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Proceedings. Chatzigeorgiou, A., Dondi, R., Herodotou, H., Kapoutsis, C., Manolopoulos, Y., Papadopoulos, G. A. & Sikora, F. (eds.). Springer, p. 125-135 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12011 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window

Mieno, T., Kuhara, Y., Akagi, T., Fujishige, Y., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2020, SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Proceedings. Chatzigeorgiou, A., Dondi, R., Herodotou, H., Kapoutsis, C., Manolopoulos, Y., Papadopoulos, G. A. & Sikora, F. (eds.). Springer, p. 148-160 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12011 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2019

An improved data structure for left-right maximal generic words problem

Fujishige, Y., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Dec 2019, 30th International Symposium on Algorithms and Computation, ISAAC 2019. Lu, P. & Zhang, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 149).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Compact Data Structures for Shortest Unique Substring Queries

Mieno, T., Köppl, D., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2019, String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. Brisaboa, N. R. & Puglisi, S. J. (eds.). Springer, p. 107-123 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11811 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Computing maximal palindromes and distinct palindromes in a trie

Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 2019, Proceedings of the Prague Stringology Conference, PSC 2019. Holub, J. & Zdarek, J. (eds.). Prague Stringology Club, p. 3-15 13 p. (Proceedings of the Prague Stringology Conference, PSC 2019).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Computing runs on a trie

Sugahara, R., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jun 1 2019, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Pisanti, N. & Pissis, S. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 23. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 128).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets

Fujisato, N., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2019, String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. Brisaboa, N. R. & Puglisi, S. J. (eds.). Springer, p. 382-391 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11811 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Faster queries for longest substring palindrome after block edit

Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jun 1 2019, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Pisanti, N. & Pissis, S. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 128).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

On Longest Common Property Preserved Substring Queries

Kai, K., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M. & Kociumaka, T., Jan 1 2019, String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. Brisaboa, N. R. & Puglisi, S. J. (eds.). Springer, p. 162-174 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11811 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

On the size of overlapping Lempel-Ziv and Lyndon factorizations

Urabe, Y., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jun 1 2019, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Pisanti, N. & Pissis, S. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 29. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 128).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shortest unique palindromic substring queries on run-length encoded strings

Watanabe, K., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2019, Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. Colbourn, C. J., Grossi, R. & Pisanti, N. (eds.). Springer Verlag, p. 430-441 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11638 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

The Parameterized Position Heap of a Trie

Fujisato, N., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2019, Algorithms and Complexity - 11th International Conference, CIAC 2019, Proceedings. Heggernes, P. (ed.). Springer Verlag, p. 237-248 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11485 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)
2018

Computing abelian string regularities based on RLE

Sugimoto, S., Noda, N., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2018, Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers. Smyth, W. F., Brankovic, L. & Ryan, J. (eds.). Springer Verlag, p. 420-431 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10765 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Computing longest common square subsequences

Inoue, T., Inenaga, S., Hyyrö, H., Bannai, H. & Takeda, M., May 1 2018, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. Zhu, B., Navarro, G. & Sankoff, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 151-1513 1363 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 105).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Faster online elastic degenerate string matching

Aoyama, K., Nakashima, Y., I, T., Inenaga, S., Bannai, H. & Takeda, M., May 1 2018, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. Zhu, B., Navarro, G. & Sankoff, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 91-910 820 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 105).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Longest lyndon substring after edit

Urabe, Y., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., May 1 2018, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. Zhu, B., Navarro, G. & Sankoff, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 191-1910 1720 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 105).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Longest substring palindrome after edit

Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., May 1 2018, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. Zhu, B., Navarro, G. & Sankoff, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 121-1214 1094 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 105).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Lyndon factorization of grammar compressed texts revisited

Furuya, I., Nakashima, Y., I, T., Inenaga, S., Bannai, H. & Takeda, M., May 1 2018, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. Zhu, B., Navarro, G. & Sankoff, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 241-2410 2170 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 105).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

O(n log n)-time text compression by LZ-style longest first substitution

Nishi, A., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 2018, Proceedings of the Prague Stringology Conference, PSC 2018. Holub, J. & Zdarek, J. (eds.). Prague Stringology Club, p. 12-26 15 p. (Proceedings of the Prague Stringology Conference, PSC 2018).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Recovering, counting and enumerating strings from forward and backward suffix arrays

Kuhara, Y., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2018, String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings. Gagie, T., Moffat, A., Navarro, G. & Cuadros-Vargas, E. (eds.). Springer Verlag, p. 254-267 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11147 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Right-to-left online construction of parameterized position heaps

Fujisato, N., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 2018, Proceedings of the Prague Stringology Conference, PSC 2018. Holub, J. & Zdarek, J. (eds.). Prague Stringology Club, p. 91-102 12 p. (Proceedings of the Prague Stringology Conference, PSC 2018).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Shortest unique palindromic substring queries in optimal time

Nakashima, Y., Inoue, H., Mieno, T., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2018, Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers. Smyth, W. F., Brankovic, L. & Ryan, J. (eds.). Springer Verlag, p. 397-408 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10765 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2017

Almost linear time computation of maximal repetitions in run length encoded strings

Fujishige, Y., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Dec 1 2017, 28th International Symposium on Algorithms and Computation, ISAAC 2017. Tokuyama, T. & Okamoto, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 92).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Faster STR-IC-LCS Computation via RLE

Kuboi, K., Fujishige, Y., Inenaga, S., Bannai, H. & Takeda, M., Jul 1 2017, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 78. 20

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

On reverse engineering the Lyndon tree

Nakashima, Y., Takagi, T., Inenaga, S., Bannai, H. & Takeda, M., 2017, Proceedings of the Prague Stringology Conference, PSC 2017. Holub, J. & Zdarek, J. (eds.). Prague Stringology Club, p. 108-117 10 p. (Proceedings of the Prague Stringology Conference, PSC 2017).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Order preserving pattern matching on trees and DAGs

Nakamura, T., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2017, String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. Venturini, R., Fici, G. & Sciortino, M. (eds.). Springer Verlag, p. 271-277 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10508 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Small-space LCE data structure with constant-time queries

Tanimura, Y., Nishimoto, T., Bannai, H., Inenaga, S. & Takeda, M., Nov 1 2017, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. Larsen, K. G., Raskin, J-F. & Bodlaender, H. L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 83).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Tight bounds on the maximum number of shortest unique substrings

Mieno, T., Inenaga, S., Bannai, H. & Takeda, M., Jul 1 2017, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 78. 24

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2016

Computing DAWGs and minimal absent words in linear time for integer alphabets

Fujishige, Y., Tsujimaru, Y., Inenaga, S., Bannai, H. & Takeda, M., Aug 1 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 38. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Computing smallest and largest repetition factorizations in O(n log n) time

Inoue, H., Matsuoka, Y., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 2016, Proceedings of the Prague Stringology Conference, PSC 2016. Holub, J. & Zdarek, J. (eds.). Prague Stringology Club, p. 135-145 11 p. (Proceedings of the Prague Stringology Conference, PSC 2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Deterministic sub-linear space LCE data structures with efficient construction

Tanimura, Y., I, T., Bannai, H., Inenaga, S., Puglisi, S. J. & Takeda, M., Jun 1 2016, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. Grossi, R. & Lewenstein, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1.1-1.10 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 54).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Dynamic index and LZ factorization in compressed space

Nishimoto, T., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 2016, Proceedings of the Prague Stringology Conference, PSC 2016. Holub, J. & Zdarek, J. (eds.). Prague Stringology Club, p. 158-171 14 p. (Proceedings of the Prague Stringology Conference, PSC 2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Factorizing a string into squares in linear time

Matsuoka, Y., Inenaga, S., Bannai, H., Takeda, M. & Manea, F., Jun 1 2016, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 54. p. 27.1-27.12

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Finding gapped palindromes online

Fujishige, Y., Nakamura, M., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2016, Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings. Mäkinen, V., Puglisi, S. J. & Salmela, L. (eds.). Springer Verlag, p. 191-202 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9843 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Fully dynamic data structure for LCE queries in compressed space

Nishimoto, T., I, T., Inenaga, S., Bannai, H. & Takeda, M., Aug 1 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 72. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Shortest unique substring queries on run-length encoded strings

Mieno, T., Inenaga, S., Bannai, H. & Takeda, M., Aug 1 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 69. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)
2015

A faster algorithm for computing maximal α-gapped repeats in a string

Tanimura, Y., Fujishige, Y., I, T., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2015, String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings. Puglisi, S. J., Iliopoulos, C. S. & Yilmaz, E. (eds.). Springer Verlag, p. 124-136 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9309).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

A new characterization of maximal repetitions by Lyndon trees

Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M. & Tsuruta, K., 2015, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015. January ed. Association for Computing Machinery, p. 562-571 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2015-January, no. January).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Citations (Scopus)

An opportunistic text indexing structure based on run length encoding

Tamakoshi, Y., Goto, K., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2015, Algorithms and Complexity - 9th International Conference, CIAC 2015, Proceedings. Widmayer, P. & Paschos, V. T. (eds.). Springer Verlag, p. 390-402 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9079).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Computing left-right maximal generic words

Nishimoto, T., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2015, Proceedings of the Prague Stringology Conference 2015, PSC 2015. Zd'arek, J. & Holub, J. (eds.). Prague Stringology Club, p. 5-16 12 p. (Proceedings of the Prague Stringology Conference 2015, PSC 2015).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Inferring strings from full abelian periods

Nishida, M., I, T., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2015, Algorithms and Computation - 26th International Symposium, ISAAC 2015, Proceedings. Elbassioni, K. & Makino, K. (eds.). Springer Verlag, p. 768-779 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9472).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

LZD factorization: Simple and practical online grammar compression with variable-to-fixed encoding

Goto, K., Bannai, H., Inenaga, S. & Takeda, M., Jan 1 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (eds.). Springer Verlag, p. 219-230 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9133).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Semi-dynamic compact index for short patterns and succinct van Emde Boas tree

Matsuoka, Y., I, T., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (eds.). Springer Verlag, p. 355-366 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9133).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2014

Computing Abelian covers and Abelian runs

Matsuda, S., Inenaga, S., Bannai, H. & Takeda, M., 2014, Proceedings of the Prague Stringology Conference 2014, PSC 2014. Prague Stringology Club, p. 43-51 9 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Computing palindromic factorizations and palindromic covers on-line

I, T., Sugimoto, S., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2014, Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings. Springer Verlag, p. 150-161 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8486).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

Faster compact on-line Lempel-ziv factorization

Yamamoto, J., I, T., Bannai, H., Inenaga, S. & Takeda, M., Mar 1 2014, 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014. Portier, N. & Mayr, E. W. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 675-686 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 25).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Inferring strings from Lyndon factorization

Nakashima, Y., Okabe, T., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2014, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2 ed. Springer Verlag, p. 565-576 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8635 LNCS, no. PART 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Shortest unique substrings queries in optimal time

Tsuruta, K., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2014, SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Springer Verlag, p. 503-513 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8327 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)
2013

Compressed automata for dictionary matching

I, T., Nishimoto, T., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2013, Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings. Springer Verlag, p. 319-330 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7982).

Research output: Chapter in Book/Report/Conference proceedingConference contribution