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

研究成果 1993 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

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
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
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
20 引用 (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
2016
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
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
2015
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
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
2014
9 引用 (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
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

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

An online algorithm for lightweight grammar-based compression

Maruyama, S., Sakamoto, H. & Takeda, M., 6 1 2012, : : Algorithms. 5, 2, p. 214-235 22 p.

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

Online Algorithms
Grammar
Context free grammars
Compression
Context-free Grammar
2011
8 引用 (Scopus)

Adaptive online prediction using weighted windows

Yoshida, S. I., hatano, K., Takimoto, E. & Takeda, M., 1 1 2011, : : IEICE Transactions on Information and Systems. E94-D, 10, p. 1917-1923 7 p.

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

11 引用 (Scopus)

Verifying and enumerating parameterized border arrays

I, T., 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
2010
1 引用 (Scopus)

Context-sensitive grammar transform: Compression and pattern matching

Maruyama, S., Tanaka, Y., Sakamoto, H. & Takeda, M., 1 1 2010, : : IEICE Transactions on Information and Systems. E93-D, 2, p. 219-226 8 p.

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

Context sensitive grammars
Pattern matching
2009

A run-time efficient implementation of compressed pattern matching automata

Matsumoto, T., Hagio, K. & Takeda, M., 8 2009, : : International Journal of Foundations of Computer Science. 20, 4, p. 717-733 17 p.

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

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

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

Development of the measures to evaluate the similarity of drug brand names

Ohtani, H., Takeda, M., Imada, Y. & Sawada, Y., 5 1 2006, : : Yakugaku Zasshi. 126, 5, p. 349-356 8 p.

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

Names
Pharmaceutical Preparations
Space Simulation
Head
Control Groups
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
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)

An O(N2) algorithm for discovering optimal Boolean pattern pairs

Bannai, H., Hyyrö, H., Shinohara, A., Takeda, M., Nakai, K. & Miyano, S., 10 1 2004, : : IEEE/ACM Transactions on Computational Biology and Bioinformatics. 1, 4, p. 159-170 12 p.

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

Strings
Boolean functions
RNA Stability
Numerics
Messenger RNA
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
10 引用 (Scopus)
Strings
Efficient Algorithms
Denote
Form
Class
4 引用 (Scopus)

Finding optimal pairs of patterns

Bannai, H., Hyyrö, H., Shinohara, A., Takeda, M., Nakai, K. & Miyano, S., 2004, : : Lecture Notes in Computer Science. 3240, p. 450-462 13 p.

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

Strings
Microarrays
Nucleotides
Numerics
Gene expression
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
1 引用 (Scopus)
Mutual Information
Thesauri
Query Expansion
Thesaurus
Normalize
11 引用 (Scopus)

A practical algorithm to find the best subsequence patterns

Hirao, M., Hoshino, H., Shinohara, A., Takeda, M. & Arikawa, S., 1 27 2003, : : Theoretical Computer Science. 292, 2, p. 465-479 15 p.

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

Subsequence
Data structures
Data Structures
Heuristics
Pruning
42 引用 (Scopus)

Collage system: A unifying framework for compressed pattern matching

Kida, T., Matsumoto, T., Shibata, Y., Takeda, M., Shinohara, A. & Arikawa, S., 4 4 2003, : : Theoretical Computer Science. 298, 1, p. 253-272 20 p.

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

Pattern matching
Pattern Matching
Glossaries
Truncation
Compression
7 引用 (Scopus)

Discovering characteristic expressions in literary works

Takeda, M., Matsumoto, T., Fukuda, T. & Nanri, I., 1 27 2003, : : Theoretical Computer Science. 292, 2, p. 525-546 22 p.

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

Equivalence classes
Equivalence relation
Equivalence class
Strings
Pattern Discovery
4 引用 (Scopus)

Discovering instances of poetic allusion from anthologies of classical Japanese poems

Takeda, M., Fukuda, T., Nanri, I., Yamasaki, M. & Tamari, K., 1 27 2003, : : Theoretical Computer Science. 292, 2, p. 497-524 28 p.

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

Similarity Measure
Strings
Generalise
History
Similarity
14 引用 (Scopus)
Pattern matching
Strings
Pattern Matching
Pruning
Class
39 引用 (Scopus)
Strings
Graph in graph theory
Suffix Array
Subsequence
benzoylprop-ethyl
6 引用 (Scopus)
Text Compression
Substitution
Linear Time
Substitution reactions
Line
Corollary
Imply
Theorem
2 引用 (Scopus)
Pattern matching
Ternary
Data structures
Binary search
Graph in graph theory

Uniform characterizations of polynomial-query learnabilities

Hayashi, Y., Matsumoto, S., Shinohara, A. & Takeda, M., 1 27 2003, : : Theoretical Computer Science. 292, 2, p. 377-385 9 p.

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

Learnability
Polynomials
Query
Polynomial
Equivalence
2002
17 引用 (Scopus)
Introns
Zebrafish
Diptera
Gene Expression
Datasets
2001
11 引用 (Scopus)

Compressed pattern matching for Sequitur

Mitarai, S., Hirao, M., Matsumoto, T., Shinohara, A., Takeda, M. & Arikawa, S., 2001, : : Unknown Journal. p. 469-478 10 p.

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

Pattern matching
decompression
compression
programme
33 引用 (Scopus)

Faster approximate string matching over compressed text

Navarro, G., Kida, T., Takeda, M., Shinohara, A. & Arikawa, S., 1 1 2001, : : Data Compression Conference Proceedings. p. 459-468 10 p.

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

2000
4 引用 (Scopus)

Discovering characteristic patterns from collections of classical Japanese poems

Yamasaki, M., Takeda, M., Fukuda, T. & Nanri, I., 1 1 2000, New Generation Computing, 18, 1, p. 61-73 13 p.

研究成果: 専門家出版物への寄稿タイプ 記事

Schema
History
Form
30 引用 (Scopus)

Speeding up pattern matching by text compression

Shibata, Y., Kida, T., Fukamachi, S., Takeda, M., Shinohara, A., Shinohara, T. & Arikawa, S., 1 1 2000, : : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1767, p. 306-315 10 p.

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

Text Compression
Pattern matching
Pattern Matching
Encoding
Compression
1998
45 引用 (Scopus)

Multiple pattern matching in LZW compressed text

Kida, T., Takeda, M., Shinohara, A., Miyazaki, M. & Arikawa, S., 1998, : : Unknown Journal. p. 103-112 10 p.

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

Pattern matching
decompression
1993
4 引用 (Scopus)

A fast string-searching algorithm for multiple patterns

Uratani, N. & Takeda, M., 1 1 1993, : : Information Processing and Management. 29, 6, p. 775-791 17 p.

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

String searching algorithms