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).

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

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).

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

Pattern matching
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).

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

Pattern matching
Factorization

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)

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).

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

2 引用 (Scopus)

Faster online elastic degenerate string matching

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

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

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).

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

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

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.

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

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

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

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
1 引用 (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

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

Deterministic sub-linear space LCE data structures with efficient construction

Tanimura, Y., Tomohiro, I., 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
1 引用 (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
5 引用 (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., Tomohiro, I., 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. 72

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

Data structures
Random access storage
Processing
Factorization
3 引用 (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
10 引用 (Scopus)

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

Tanimura, Y., Fujishige, Y., Tomohiro, I., 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
1 引用 (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, 巻 9079. 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

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
1 引用 (Scopus)

Inferring strings from full abelian periods

Nishida, M., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2015, Algorithms and Computation - 26th International Symposium, ISAAC 2015, Proceedings. 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., Tomohiro, I., 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
18 引用 (Scopus)

Computing palindromic factorizations and palindromic covers on-line

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

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

Factorization
Prefix
Cover
Computing
Strings
7 引用 (Scopus)

Faster compact on-line Lempel-ziv factorization

Yamamoto, J., Tomohiro, I., 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, 巻 25. p. 675-686 12 p.

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

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
16 引用 (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

Tomohiro, I., Nishimoto, T., Inenaga, S., Bannai, H. & Takeda, M., 8 13 2013, Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings. p. 319-330 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7982 LNCS).

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

Glossaries
Automata
Matching Problem
Dictionary
4 引用 (Scopus)

Computing convolution on grammar-compressed text

Tanaka, T., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 8 8 2013, Proceedings - DCC 2013: 2013 Data Compression Conference. p. 451-460 10 p. 6543081. (Data Compression Conference Proceedings).

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

Convolution
Context free grammars
Fast Fourier transforms
Redundancy
1 引用 (Scopus)

Computing reversed Lempel-Ziv factorization online

Sugimoto, S., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 10 1 2013, Proceedings of the Prague Stringology Conference 2013, PSC 2013. p. 107-118 12 p. (Proceedings of the Prague Stringology Conference 2013, PSC 2013).

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

Factorization
Computing
Computer Science
Strings
5 引用 (Scopus)

Converting SLP to LZ78 in almost linear time

Bannai, H., Gawrychowski, P., Inenaga, S. & Takeda, M., 9 24 2013, Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings. p. 38-49 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7922 LNCS).

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

Factorization
Data structures
Linear Time
Labels
Straight-line Programs
2 引用 (Scopus)

Detecting regularities on grammar-compressed strings

Tomohiro, I., Matsubara, W., Shimohira, K., Inenaga, S., Bannai, H., Takeda, M., Narisawa, K. & Shinohara, A., 10 15 2013, Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings. p. 571-582 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8087 LNCS).

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

Straight-line Programs
Grammar
Strings
Regularity
Palindrome
6 引用 (Scopus)

Efficient Lyndon factorization of grammar compressed text

Tomohiro, I., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 9 24 2013, Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings. p. 153-164 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7922 LNCS).

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

Straight-line Programs
Factorization
Grammar
Strings
Polynomials
7 引用 (Scopus)

Faster lyndon factorization algorithms for SLP and LZ78 compressed text

Tomohiro, I., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2013, String Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Proceedings. Springer Verlag, 巻 8214 LNCS. p. 174-185 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8214 LNCS).

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

Straight-line Programs
Factorization
Encoding
Efficient Algorithms
Strings
6 引用 (Scopus)

From run length encoding to LZ78 and back again

Tamakoshi, Y., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 8 8 2013, Proceedings - DCC 2013: 2013 Data Compression Conference. p. 143-152 10 p. 6543050

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

2012
1 引用 (Scopus)

Computing q-gram non-overlapping frequencies on SLP compressed texts

Goto, K., Bannai, H., Inenaga, S. & Takeda, M., 1 25 2012, SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 巻 7147 LNCS. p. 301-312 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7147 LNCS).

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

Straight-line Programs
Data mining
Learning systems
Computing
Data Mining

Eager xpath evaluation over XML streams

Hagio, K., Ohgami, T., Bannai, H. & Takeda, M., 2012, String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. 巻 7608 LNCS. p. 245-250 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7608 LNCS).

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

XPath
XML
Evaluation
D-space
Evaluate
11 引用 (Scopus)

Efficient LZ78 factorization of grammar compressed text

Bannai, H., Inenaga, S. & Takeda, M., 10 22 2012, String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. p. 86-98 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7608 LNCS).

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

Straight-line Programs
Factorization
Grammar
Strings
Context free grammars

General algorithms for mining closed flexible patterns under various equivalence relations

Tomohiro, I., Enokuma, Y., Bannai, H. & Takeda, M., 10 4 2012, Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2012, Proceedings. PART 2 版 p. 435-450 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7524 LNAI, 番号 PART 2).

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

Equivalence relation
Mining
Closed
Coarsening
Redundancy
3 引用 (Scopus)

Polyphonic music classification on symbolic data using dissimilarity functions

Anan, Y., hatano, K., Bannai, H., Takeda, M. & Satoh, K., 2012, Proceedings of the 13th International Society for Music Information Retrieval Conference, ISMIR 2012. p. 229-234 6 p.

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

Music
Polyphonic
Experiments
Computational
Convert
7 引用 (Scopus)

Speeding up q-gram mining on grammar-based compressed texts

Goto, K., Bannai, H., Inenaga, S. & Takeda, M., 7 4 2012, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Proceedings. p. 220-231 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7354 LNCS).

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

Straight-line Programs
Grammar
Mining
Strings
Redundancy
5 引用 (Scopus)

The position heap of a trie

Nakashima, Y., I, T., Inenaga, S., Bannai, H. & Takeda, M., 10 22 2012, String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. p. 360-371 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7608 LNCS).

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

Heap
Text Indexing
Strings
Data structures
Linear Time
2011
5 引用 (Scopus)

An online algorithm for lightweight grammar-based compression

Maruyama, S., Takeda, M., Nakahara, M. & Sakamoto, H., 11 21 2011, Proceedings - 1st International Conference on Data Compression, Communication, and Processing, CCP 2011. p. 19-28 10 p. 6061023. (Proceedings - 1st International Conference on Data Compression, Communication, and Processing, CCP 2011).

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

Context free grammars
Binary trees
Compressors
Data storage equipment