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

Research Output 1999 2019

2019

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

Dynamic index and LZ factorization in compressed space

Nishimoto, T., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2019, In : Discrete Applied Mathematics.

Research output: Contribution to journalArticle

Factorization
Deletion
Insertion
Encoding
Signature

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

Bioinformatics

Indexing the bijective BWT

Bannai, H., Kärkkäinen, J., Köppl, D. & Piątkowski, 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, 17. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 128).

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

Data compression

MR-RePair: Grammar Compression Based on Maximal Repeats

Furuya, I., Takagi, T., Nakashima, Y., Inenaga, S., Bannai, H. & Kida, T., May 10 2019, Proceedings - DCC 2019: 2019 Data Compression Conference. Serra-Sagrista, J., Bilgin, A., Marcellin, M. W. & Storer, J. A. (eds.). Institute of Electrical and Electronics Engineers Inc., p. 508-517 10 p. 8712661. (Data Compression Conference Proceedings; vol. 2019-March).

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

Repair

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

Factorization

Refining the r-index

Bannai, H., Gagie, T. & I, T., Jan 1 2019, (Accepted/In press) In : Theoretical Computer Science.

Research output: Contribution to journalArticle

Burrows-Wheeler Transform
Computational methods
Computational Methods
Computer science
Refining

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

Run Length
Strings
Query
Interval
Distinct
2018
1 Citation (Scopus)

Algorithms and combinatorial properties on shortest unique palindromic substrings

Inoue, H., Nakashima, Y., Mieno, T., Inenaga, S., Bannai, H. & Takeda, M., Sep 1 2018, In : Journal of Discrete Algorithms. 52-53, p. 122-132 11 p.

Research output: Contribution to journalArticle

Strings
Interval
Query
Palindrome
Optimal Solution

Block palindromes: A new generalization of palindromes

Goto, K., Tomohiro, I., Bannai, H. & Inenaga, S., 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. 183-190 8 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

Palindrome
Strings
Generalization
1 Citation (Scopus)

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

Run-length Encoding
Strings
Regularity
Computing
Permutation

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

1 Citation (Scopus)

Diverse Palindromic Factorization is NP-Complete

Bannai, H., Gagie, T., Inenaga, S., Kärkkäinen, J., Kempa, D., Piakowski, M. & Sugimoto, S., Feb 1 2018, In : International Journal of Foundations of Computer Science. 29, 2, p. 143-163 21 p.

Research output: Contribution to journalArticle

Factorization
4 Citations (Scopus)

Faster online elastic degenerate string matching

Aoyama, K., Nakashima, Y., Tomohiro, I., 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

1 Citation (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

1 Citation (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

Substitution reactions

Lyndon factorization of grammar compressed texts revisited

Furuya, I., Nakashima, Y., Tomohiro, I., 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

Factorization
Data structures
Processing
2 Citations (Scopus)

Online LZ77 parsing and matching statistics with RLBWTs

Bannai, H., Gagie, T. & Tomohiro, I., 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. 71-712 642 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 105).

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

Statistics
Mathematical transformations
String searching algorithms
Experiments

On the size of the smallest alphabet for Lyndon trees

Nakashima, Y., Takagi, T., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2018, (Accepted/In press) In : Theoretical Computer Science.

Research output: Contribution to journalArticle

Binary trees
Ordered Trees
Strings
Binary Tree
Leaves

Order-preserving pattern matching indeterminate strings

Henriques, R., Francisco, A. P., Russo, L. M. S. & Bannai, H., 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. 21-215 195 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 105).

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

Pattern matching
Polynomials
Time series analysis
Time series

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

Suffix Array
Counting
Strings
Reverse engineering
Permutation

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

Query
Interval
Strings
Palindrome
Optimal Solution
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. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 92.

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

3 Citations (Scopus)

Computing all distinct squares in linear time for integer alphabets

Bannai, H., Inenaga, S. & Köppl, D., Jul 1 2017, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. Radoszewski, J., Karkkainen, J., Radoszewski, J. & Rytter, W. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 22. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 78).

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

Topology
1 Citation (Scopus)

Efficient Computation of Substring Equivalence Classes with Suffix Arrays

Narisawa, K., Hiratsuka, H., Inenaga, S., Bannai, H. & Takeda, M., Oct 1 2017, In : Algorithmica. 79, 2, p. 291-318 28 p.

Research output: Contribution to journalArticle

Suffix Array
Equivalence classes
Equivalence class
Strings
Text Indexing
2 Citations (Scopus)

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

1 Citation (Scopus)

Inferring strings from Lyndon factorization

Nakashima, Y., Okabe, T., I, T., Inenaga, S., Bannai, H. & Takeda, M., Aug 15 2017, In : Theoretical Computer Science. 689, p. 147-156 10 p.

Research output: Contribution to journalArticle

Factorization
Strings
p.m.
Lyndon Words
Unique factorisation
3 Citations (Scopus)

Longest common subsequence in at least k length order-isomorphic substrings

Ueki, Y., Diptarama, Kurihara, M., Matsuoka, Y., Narisawa, K., Yoshinaka, R., Bannai, H., Inenaga, S. & Shinohara, A., Jan 1 2017, SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. & Steffen, B. (eds.). Springer Verlag, p. 363-374 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10139 LNCS).

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

Longest Common Subsequence
Isomorphic
Subsequence
Strings
Restriction
1 Citation (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

Pattern matching
Pattern Matching
Matching Problem
Strings
Time Complexity
3 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

Data structures
Factorization
17 Citations (Scopus)

The "runs" theorem

Bannai, H., Tomohiro, I., Inenaga, S., Nakashima, Y., Takeda, M. & Tsuruta, K., Jan 1 2017, In : SIAM Journal on Computing. 46, 5, p. 1501-1514 14 p.

Research output: Contribution to journalArticle

Strings
Theorem
Linear-time Algorithm
Lyndon Words
Factorization

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
5 Citations (Scopus)

Closed factorization

Badkobeh, G., Bannai, H., Goto, K., I, T., Iliopoulos, C. S., Inenaga, S., Puglisi, S. J. & Sugimoto, S., Oct 30 2016, In : Discrete Applied Mathematics. 212, p. 23-29 7 p.

Research output: Contribution to journalArticle

Factorization
Strings
Closed
Sturmian Words
Factorise
6 Citations (Scopus)

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. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 58. 38

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

Polynomials
4 Citations (Scopus)

Deterministic sub-linear space LCE data structures with efficient construction

Tanimura, Y., Tomohiro, I., 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

Data structures
Sorting
Processing
2 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

Factorization
Random access storage
9 Citations (Scopus)

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text

I, T., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Dec 20 2016, In : Theoretical Computer Science. 656, p. 215-224 10 p.

Research output: Contribution to journalArticle

Straight-line Programs
Factorization
Data structures
Preprocessing
Data Structures
5 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

Palindrome
Strings
Online Algorithms
Reverse
Speedup
5 Citations (Scopus)

Fully dynamic data structure for LCE queries in compressed space

Nishimoto, T., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., Aug 1 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 58. 72

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

Data structures
Random access storage
Processing
Factorization
3 Citations (Scopus)

Generalized pattern matching and periodicity under substring consistent equivalence relations

Matsuoka, Y., Aoki, T., Inenaga, S., Bannai, H. & Takeda, M., Dec 20 2016, In : Theoretical Computer Science. 656, p. 225-233 9 p.

Research output: Contribution to journalArticle

Pattern matching
Pattern Matching
Equivalence relation
Periodicity
Strings
4 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. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 58. 69

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

Data structures
2015
11 Citations (Scopus)

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

Tanimura, Y., Fujishige, Y., Tomohiro, I., 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

Fast Algorithm
Strings
Computing
23 Citations (Scopus)

A new characterization of maximal repetitions by Lyndon trees

Bannai, H., Tomohiro, I., Inenaga, S., Nakashima, Y., Takeda, M. & Tsuruta, K., Jan 1 2015, p. 562-571. 10 p.

Research output: Contribution to conferencePaper

Strings
Factorization
Linear-time Algorithm
Lyndon Words
Upper bound
1 Citation (Scopus)

An opportunistic text indexing structure based on run length encoding

Tamakoshi, Y., Goto, K., Inenaga, S., Bannai, H. & Takeda, M., 2015, Algorithms and Complexity - 9th International Conference, CIAC 2015, Proceedings. Springer Verlag, Vol. 9079. 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

Run-length Encoding
Text Indexing
Data structures
Data Structures
Strings
5 Citations (Scopus)

Compressed automata for dictionary matching

Tomohiro, I., Nishimoto, T., Inenaga, S., Bannai, H. & Takeda, M., May 1 2015, In : Theoretical Computer Science. 578, p. 30-41 12 p.

Research output: Contribution to journalArticle

Glossaries
Automata
Straight-line Programs
Matching Problem
Dictionary

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

Computing
Data Structures
Distinct
Word problem
5 Citations (Scopus)

Constructing LZ78 tries and position heaps in linear time for large alphabets

Nakashima, Y., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., Sep 1 2015, In : Information Processing Letters. 115, 9, p. 655-659 5 p.

Research output: Contribution to journalArticle

Heap
Linear Time
Strings
Factorization
Suffix Tree
7 Citations (Scopus)

Detecting regularities on grammar-compressed strings

Tomohiro, I., Matsubara, W., Shimohira, K., Inenaga, S., Bannai, H., Takeda, M., Narisawa, K. & Shinohara, A., Jan 1 2015, In : Information and Computation. 240, p. 74-89 16 p.

Research output: Contribution to journalArticle

Straight-line Programs
Grammar
Strings
Regularity
Context free grammars
7 Citations (Scopus)

Diverse palindromic factorization is NP-complete

Bannai, H., Gagie, T., Inenaga, S., Kärkkäinen, J., Kempa, D., Piątkowski, M., Puglisi, S. J. & Sugimoto, S., Jan 1 2015, Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. Potapov, I. (ed.). Springer Verlag, p. 85-96 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9168).

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

Palindrome
Factorization
NP-complete problem
Strings

Editorial

Bannai, H. & Pissis, S. P., Sep 1 2015, In : Journal of Discrete Algorithms. 34, 1 p.

Research output: Contribution to journalEditorial