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

研究成果 2001 2019

フィルター
記事
2019

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

A hardness result and new algorithm for the longest common palindromic subsequence problem

Inenaga, S. & Hyyrö, H., 1 1 2018, : : Information Processing Letters. 129, p. 11-15 5 p.

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

Longest Common Subsequence
Hardness
Denote
Strings
Distinct
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)

Diverse Palindromic Factorization is NP-Complete

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

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

Factorization

Dynamic RLE-Compressed Edit Distance Tables under General Weighted Cost Functions

Hyyrö, H. & Inenaga, S., 6 1 2018, : : International Journal of Foundations of Computer Science. 29, 4, p. 623-645 23 p.

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

Cost functions
Costs

Efficient dynamic dictionary matching with DAWGs and AC-automata

Hendrian, D., Inenaga, S., Yoshinaka, R. & Shinohara, A., 1 1 2018, (受理済み/印刷中) : : Theoretical Computer Science.

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

Glossaries
Automata
Insertion
Pattern matching
Pattern Matching

On the size of the smallest alphabet for Lyndon trees

Nakashima, Y., Takagi, T., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2018, (受理済み/印刷中) : : Theoretical Computer Science.

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

Binary trees
Ordered Trees
Strings
Binary Tree
Leaves
7 引用 (Scopus)
Palindrome
Optimal Algorithm
Integer
Upper bound
2017
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
1 引用 (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)

Packed compact tries: A fast and efficient data structure for online string processing

Takagi, T., Inenaga, S., Sadakane, K. & Arimura, H., 9 1 2017, : : IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E100A, 9, p. 1785-1793 9 p.

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

Pattern matching
Data structures
Data Structures
Strings
Pattern Matching
17 引用 (Scopus)

The "runs" theorem

Bannai, H., Tomohiro, I., 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
2016
5 引用 (Scopus)

Closed factorization

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

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

Factorization
Strings
Closed
Sturmian Words
Factorise
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
3 引用 (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
2015
5 引用 (Scopus)

Compressed automata for dictionary matching

Tomohiro, I., 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
5 引用 (Scopus)

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

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

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

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

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

Dynamic edit distance table under a general weighted cost function

Hyyrö, H., Narisawa, K. & Inenaga, S., 9 1 2015, : : Journal of Discrete Algorithms. 34, p. 2-17 16 p.

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

Edit Distance
Cost functions
Cost Function
Table
Strings
2014
8 引用 (Scopus)

Inferring strings from suffix trees and links on a binary alphabet

Tomohiro, I., 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
2013
11 引用 (Scopus)

Fast q-gram mining on SLP compressed strings

Goto, K., Bannai, H., Inenaga, S. & Takeda, M., 1 1 2013, : : Journal of Discrete Algorithms. 18, p. 89-99 11 p.

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

Straight-line Programs
Mining
Strings
Data Classification
Computational Experiments
6 引用 (Scopus)

Palindrome pattern matching

Tomohiro, I., Inenaga, S. & Takeda, M., 4 29 2013, : : Theoretical Computer Science. 483, p. 162-170 9 p.

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

Palindrome
Pattern matching
Pattern Matching
Strings
Matching Problem
2012
4 引用 (Scopus)

An efficient algorithm to test square-freeness of strings compressed by straight-line programs

Bannai, H., Gagie, T., Tomohiro, I., Inenaga, S., Landau, G. M. & Lewenstein, M., 10 15 2012, : : Information Processing Letters. 112, 19, p. 711-714 4 p.

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

Straight-line Programs
Efficient Algorithms
Strings
Square free
Arbitrary
3 引用 (Scopus)

Finding characteristic substrings from compressed texts

Inenaga, S. & Bannai, H., 2 1 2012, : : International Journal of Foundations of Computer Science. 23, 2, p. 261-280 20 p.

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

Equivalence classes
Computer science
Polynomials
2011

Missing pattern discovery

Angelov, S., Inenaga, S., Kivioja, T. & Mäkinen, V., 6 1 2011, : : Journal of Discrete Algorithms. 9, 2, p. 153-165 13 p.

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

Pattern Discovery
Genes
Experiments
Genome
Experiment

Password based anonymous authentication with private information retrieval

Nakamura, T., Inenaga, S., Ikeda, D., Baba, K. & Yasuura, H., 4 1 2011, : : Journal of Digital Information Management. 9, 2, p. 72-78 7 p.

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

Information retrieval
information retrieval
Authentication
service provider
Private information
10 引用 (Scopus)

Verifying and enumerating parameterized border arrays

Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 11 25 2011, : : Theoretical Computer Science. 412, 50, p. 6959-6981 23 p.

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

Pattern matching
Pattern Matching
Matching Problem
Linear-time Algorithm
Binary
2009
47 引用 (Scopus)

Efficient algorithms to compute compressed longest common substrings and compressed palindromes

Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T. & Hashimoto, K., 3 1 2009, : : Theoretical Computer Science. 410, 8-10, p. 900-913 14 p.

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

Straight-line Programs
Palindrome
Efficient Algorithms
Strings
Polynomials
9 引用 (Scopus)

Linear-Time text compression by longest-first substitution

Nakamura, R., Inenaga, S., Bannai, H., Funamoto, T., Takeda, M. & Shinohara, A., 12 1 2009, : : Algorithms. 2, 4, p. 1429-1448 20 p.

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

Text Compression
Substitution
Linear Time
Substitution reactions
Linear-time Algorithm
2008
Merging
Labeling

Reachability on suffix tree graphs

Higa, Y., Bannai, H., Inenaga, S. & Takeda, M., 2 1 2008, : : International Journal of Foundations of Computer Science. 19, 1, p. 147-162 16 p.

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

Merging
Labeling
2005
1 引用 (Scopus)

A fully compressed pattern matching algorithm for simple collage systems

Inenaga, S., Shinohara, A. & Takeda, M., 12 1 2005, : : International Journal of Foundations of Computer Science. 16, 6, p. 1155-1166 12 p.

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

Pattern matching
Glossaries
7 引用 (Scopus)

Fully incremental LCS computation

Ishida, Y., Inenaga, S., Shinohara, A. & Takeda, M., 2005, : : Lecture Notes in Computer Science. 3623, p. 563-574 12 p.

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

Longest Common Subsequence
Pattern matching
Information retrieval
Sequence Comparison
Space Complexity
30 引用 (Scopus)

On-line construction of compact directed acyclic word graphs

Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G. & Pavesi, G., 3 1 2005, : : Discrete Applied Mathematics. 146, 2, p. 156-179 24 p.

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

Suffix Tree
Graph in graph theory
Linear Space
Linear Time
Strings
2004
4 引用 (Scopus)
Context free grammars
Context-free Grammar
Pattern matching
Pattern Matching
Matching Algorithm
7 引用 (Scopus)

Compact directed acyclic word graphs for a sliding window

Inenaga, S., Shinohara, A., Takeda, M. & Arikawa, S., 1 1 2004, : : Journal of Discrete Algorithms. 2, 1 SPEC. ISS., p. 33-51 19 p.

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

Suffix Tree
Sliding Window
Data structures
Data Structures
Data compression
19 引用 (Scopus)

Efficiently finding regulatory elements using correlation with gene expression

Bannai, H., Inenaga, S., Shinohara, A., Takeda, M. & Miyano, S., 6 1 2004, : : Journal of bioinformatics and computational biology. 2, 2, p. 273-288 16 p.

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

Gene expression
Gene Expression
Microarrays
Genes
DNA sequences
6 引用 (Scopus)

Finding missing patterns

Inenaga, S., Kivioja, T. & Mäkinen, V., 12 1 2004, : : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3240, p. 463-474 12 p.

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

Suffix Tree
Time Complexity
Linear Time
Text
Optimization
10 引用 (Scopus)
Strings
Efficient Algorithms
Denote
Form
Class
3 引用 (Scopus)

Ternary directed acyclic word graphs

Miyamoto, S., Inenaga, S., Takeda, M. & Shinohara, A., 11 29 2004, : : Theoretical Computer Science. 328, 1-2, p. 97-111 15 p.

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

Pattern matching
Ternary
Data structures
Graph in graph theory
Experiments
2003
14 引用 (Scopus)
Pattern matching
Strings
Pattern Matching
Pruning
Class
36 引用 (Scopus)
Strings
Graph in graph theory
Suffix Array
Subsequence
benzoylprop-ethyl
6 引用 (Scopus)
Text Compression
Substitution
Linear Time
Substitution reactions
Line
2 引用 (Scopus)
Pattern matching
Ternary
Data structures
Binary search
Graph in graph theory
2002
17 引用 (Scopus)
Introns
Zebrafish
Diptera
Gene Expression
Datasets