Pureに変更を加えた場合、すぐここに表示されます。

研究成果 1993 2019

2019

Computing runs on a trie

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Dynamic index and LZ factorization in compressed space

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

研究成果: ジャーナルへの寄稿記事

Factorization
Deletion
Insertion
Encoding
Signature
2 引用 (Scopus)

Faster queries for longest substring palindrome after block edit

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Bioinformatics

On the size of overlapping Lempel-Ziv and Lyndon factorizations

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization

On the size of the smallest alphabet for Lyndon trees

Nakashima, Y., Takagi, T., Inenaga, S., Bannai, H. & Takeda, M., 11 5 2019, : : Theoretical Computer Science. 792, p. 131-143 13 p.

研究成果: ジャーナルへの寄稿記事

Binary trees
Ordered Trees
Strings
Binary Tree
Leaves

Shortest unique palindromic substring queries on run-length encoded strings

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Run Length
Strings
Query
Interval
Distinct

The Parameterized Position Heap of a Trie

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Heap
Strings
Query
Path
Matching Problem
2018
1 引用 (Scopus)

Algorithms and combinatorial properties on shortest unique palindromic substrings

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

研究成果: ジャーナルへの寄稿記事

Strings
Interval
Query
Palindrome
Optimal Solution
1 引用 (Scopus)

Computing abelian string regularities based on RLE

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Run-length Encoding
Strings
Regularity
Computing
Permutation

Computing longest common square subsequences

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

研究成果: 著書/レポートタイプへの貢献会議での発言

4 引用 (Scopus)

Faster online elastic degenerate string matching

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

研究成果: 著書/レポートタイプへの貢献会議での発言

2 引用 (Scopus)

Longest lyndon substring after edit

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

研究成果: 著書/レポートタイプへの貢献会議での発言

3 引用 (Scopus)

Longest substring palindrome after edit

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Substitution reactions

Lyndon factorization of grammar compressed texts revisited

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Data structures
Processing
1 引用 (Scopus)

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

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

研究成果: 著書/レポートタイプへの貢献会議での発言

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., 1 1 2018, Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers. Smyth, W. F., Brankovic, L. & Ryan, J. (版). Springer Verlag, p. 397-408 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 10765 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

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., 12 1 2017, 28th International Symposium on Algorithms and Computation, ISAAC 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 巻 92.

研究成果: 著書/レポートタイプへの貢献会議での発言

1 引用 (Scopus)

Efficient Computation of Substring Equivalence Classes with Suffix Arrays

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

研究成果: ジャーナルへの寄稿記事

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

Faster STR-IC-LCS Computation via RLE

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

研究成果: 著書/レポートタイプへの貢献会議での発言

2 引用 (Scopus)

Inferring strings from Lyndon factorization

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

研究成果: ジャーナルへの寄稿記事

Factorization
Strings
p.m.
Lyndon Words
Unique factorisation
1 引用 (Scopus)

Order preserving pattern matching on trees and DAGs

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Pattern matching
Pattern Matching
Matching Problem
Strings
Time Complexity
3 引用 (Scopus)

Small-space LCE data structure with constant-time queries

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Data structures
Factorization
22 引用 (Scopus)

The "runs" theorem

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

研究成果: ジャーナルへの寄稿記事

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., 7 1 2017, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 巻 78. 24

研究成果: 著書/レポートタイプへの貢献会議での発言

2016
7 引用 (Scopus)

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

Fujishige, Y., Tsujimaru, Y., Inenaga, S., Bannai, H. & Takeda, M., 8 1 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 巻 58. 38

研究成果: 著書/レポートタイプへの貢献会議での発言

Polynomials
4 引用 (Scopus)

Deterministic sub-linear space LCE data structures with efficient construction

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Data structures
Sorting
Processing
2 引用 (Scopus)

Factorizing a string into squares in linear time

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Random access storage
9 引用 (Scopus)

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text

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

研究成果: ジャーナルへの寄稿記事

Straight-line Programs
Factorization
Data structures
Preprocessing
Data Structures
6 引用 (Scopus)

Finding gapped palindromes online

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Palindrome
Strings
Online Algorithms
Reverse
Speedup
5 引用 (Scopus)

Fully dynamic data structure for LCE queries in compressed space

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Data structures
Random access storage
Processing
Factorization
4 引用 (Scopus)

Generalized pattern matching and periodicity under substring consistent equivalence relations

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

研究成果: ジャーナルへの寄稿記事

Pattern matching
Pattern Matching
Equivalence relation
Periodicity
Strings
4 引用 (Scopus)

Shortest unique substring queries on run-length encoded strings

Mieno, T., Inenaga, S., Bannai, H. & Takeda, M., 8 1 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 巻 58. 69

研究成果: 著書/レポートタイプへの貢献会議での発言

Data structures
2015
11 引用 (Scopus)

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

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Fast Algorithm
Strings
Computing
23 引用 (Scopus)

A new characterization of maximal repetitions by Lyndon trees

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

研究成果: 著書/レポートタイプへの貢献会議での発言

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

An opportunistic text indexing structure based on run length encoding

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

研究成果: 著書/レポートタイプへの貢献会議での発言

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

Compressed automata for dictionary matching

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

研究成果: ジャーナルへの寄稿記事

Glossaries
Automata
Straight-line Programs
Matching Problem
Dictionary

Computing left-right maximal generic words

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Computing
Data Structures
Distinct
Word problem
5 引用 (Scopus)

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

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

研究成果: ジャーナルへの寄稿記事

Heap
Linear Time
Strings
Factorization
Suffix Tree
7 引用 (Scopus)

Detecting regularities on grammar-compressed strings

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

研究成果: ジャーナルへの寄稿記事

Straight-line Programs
Grammar
Strings
Regularity
Context free grammars
2 引用 (Scopus)

Inferring strings from full abelian periods

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Reverse engineering
Strings
Time Constant
Preprocessing
Output
8 引用 (Scopus)

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

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Grammar
Encoding
Compression
Online Algorithms

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

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Byproducts
Time Constant
Deletion
Insertion
Integer
2014
3 引用 (Scopus)

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.

研究成果: 著書/レポートタイプへの貢献会議での発言

Strings
Cover
Computing
Permutation
Regularity
19 引用 (Scopus)

Computing palindromic factorizations and palindromic covers on-line

I, T., Sugimoto, S., Inenaga, S., Bannai, H. & Takeda, M., 1 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); 巻数 8486).

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Prefix
Cover
Computing
Strings
8 引用 (Scopus)

Faster compact on-line Lempel-ziv factorization

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
4 引用 (Scopus)

Inferring strings from Lyndon factorization

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

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Strings
Lyndon Words
Unique factorisation
Lexicographic Order
10 引用 (Scopus)

Inferring strings from suffix trees and links on a binary alphabet

I, T., Inenaga, S., Bannai, H. & Takeda, M., 1 30 2014, : : Discrete Applied Mathematics. 163, PART 3, p. 316-325 10 p.

研究成果: ジャーナルへの寄稿記事

Suffix Tree
Reverse engineering
Strings
Binary
Information retrieval
17 引用 (Scopus)

Shortest unique substrings queries in optimal time

Tsuruta, K., Inenaga, S., Bannai, H. & Takeda, M., 1 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); 巻数 8327 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Query
Suffix Array
Linear-time Algorithm
Computational Experiments
Experiments
2013

Compressed automata for dictionary matching

I, T., Nishimoto, T., Inenaga, S., Bannai, H. & Takeda, M., 1 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); 巻数 7982).

研究成果: 著書/レポートタイプへの貢献会議での発言

Glossaries
Automata
Matching Problem
Dictionary
4 引用 (Scopus)

Computing convolution on grammar-compressed text

Tanaka, T., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2013, Proceedings - DCC 2013: 2013 Data Compression Conference. Institute of Electrical and Electronics Engineers Inc., p. 451-460 10 p. 6543081. (Data Compression Conference Proceedings).

研究成果: 著書/レポートタイプへの貢献会議での発言

Convolution
Context free grammars
Fast Fourier transforms
Redundancy