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

研究成果 2001 2019

2001
15 引用 (Scopus)

A practical algorithm to find the best episode patterns

Hirao, M., Inenaga, S., Shinohara, A., Takeda, M. & Arikawa, S., 2001, Discovery Science - 4th International Conference, DS 2001, Proceedings. Springer Verlag, 巻 2226. p. 435-440 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2226).

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

Subsequence
NP-complete problem
Strings
Optimization Problem
Concepts
20 引用 (Scopus)

On-line construction of compact directed acyclic word graphs

Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G. & Pavesi, G., 1 1 2001, Combinatorial Pattern Matching - 12th Annual Symposium, CPM 2001, Proceedings. Springer Verlag, 巻 2089. p. 169-180 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2089).

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

Text Indexing
String Algorithms
Graph in graph theory
Strings
5 引用 (Scopus)

On-line construction of symmetric compact directed acyclic word graphs

Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M. & Arikawa, S., 1 1 2001, Proceedings - 8th Symposium on String Processing and Information Retrieval, SPIRE 2001. Institute of Electrical and Electronics Engineers Inc., p. 96-110 15 p. 989743. (Proceedings - 8th Symposium on String Processing and Information Retrieval, SPIRE 2001).

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

Data structures
2002
17 引用 (Scopus)
Introns
Zebrafish
Diptera
Gene Expression
Datasets
5 引用 (Scopus)

Compact directed acyclic word graphs for a sliding window

Inenaga, S., Shinohara, A., Takeda, M. & Arikawa, S., 1 1 2002, String Processing and Information Retrieval - 9th International Symposium, SPIRE 2002, Proceedings. Laender, A. H. F. & Oliveira, A. L. (版). Springer Verlag, p. 310-324 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2476).

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

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

Discovering best variable-length-don’t-care patterns

Inenaga, S., Bannai, H., Shinohara, A., Takeda, M. & Arikawa, S., 1 1 2002, Discovery Science - 5th International Conference, DS 2002, Proceedings. Springer Verlag, p. 86-97 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2534).

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

Strings
Pattern matching
Pruning
Heuristics
Pattern Matching
11 引用 (Scopus)

Finding best patterns practically

Shinohara, A., Takeda, M., Arikawa, S., Hirao, M., Hoshino, H. & Inenaga, S., 2002, Progress in Discovery Science. 巻 2281. p. 307-317 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2281).

研究成果: 著書/レポートタイプへの貢献

Subsequence
Data structures
Strings
Pruning
Data Structures
4 引用 (Scopus)

Space-economical construction of index structures for all suffixes of a string

Inenaga, S., Shinohara, A., Takeda, M., Bannai, H. & Arikawa, S., 1 1 2002, Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings. Diks, K., Rytter, W. & Rytter, W. (版). Springer Verlag, p. 341-352 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2420).

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

Suffix
Strings
Graph in graph theory
Vertex of a graph
Linear Time
4 引用 (Scopus)

The minimum DAWG for all suffixes of a string and its applications

Inenaga, S., Takeda, M., Shinohara, A., Hoshino, H. & Arikawa, S., 1 1 2002, Combinatorial Pattern Matching - 13th Annual Symposium, CPM 2002, Proceedings. Apostolico, A. & Takeda, M. (版). Springer Verlag, p. 153-167 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2373).

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

Suffix
Pattern matching
Pattern Matching
Strings
Graph in graph theory
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

Ternary directed acyclic word graphs

Miyamoto, S., Inenaga, S., Takeda, M. & Shinohara, A., 1 1 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Ibarra, O. H. & Dang, Z. (版). Springer Verlag, p. 108-120 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2759).

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

Pattern matching
Ternary
Data structures
Binary search
Graph in graph theory
2 引用 (Scopus)
Pattern matching
Ternary
Data structures
Binary search
Graph in graph theory
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
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
2 引用 (Scopus)

Composite pattern discovery for PCR application

Angelov, S. & Inenaga, S., 12 1 2005, String Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings. p. 167-178 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 3772 LNCS).

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

Pattern Discovery
Composite
Composite materials
Genome
Genes
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

Practical algorithms for pattern based linear regression

Bannai, H., hatano, K., Inenaga, S. & Takeda, M., 12 1 2005, Discovery Science - 8th International Conference, DS 2005, Proceedings. p. 44-56 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 3735 LNAI).

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

Linear regression
Strings
Branch-and-bound
Numerics
Attribute
2006

A new family of string classifiers based on local relatedness

Higa, Y., Inenaga, S., Bannai, H. & Takeda, M., 2006, Discovery Science - 9th International Conference, DS 2006, Proceedings. Springer Verlag, 巻 4265 LNAI. p. 114-124 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 4265 LNAI).

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

Longest Common Subsequence
Classifiers
Strings
Classifier
String Matching
14 引用 (Scopus)

On-line linear-time construction of word suffix trees

Inenaga, S. & Takeda, M., 1 1 2006, Combinatorial Pattern Matching - 17th Annual Symposium, CPM 2006, Proceedings. Springer Verlag, p. 60-71 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 4009 LNCS).

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

Suffix Tree
Linear Time
Data compression
Bioinformatics
Suffix

Reachability on suffix tree graphs

Higa, Y., Bannai, H., Inenaga, S. & Takeda, M., 12 1 2006, Proceedings of the Prague Stringology Conference '06. p. 212-225 14 p. (Proceedings of the Prague Stringology Conference '06).

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

Suffix Tree
Reachability
Strings
Graph in graph theory
Query
4 引用 (Scopus)

Sparse compact directed acyclic word graphs

Inenaga, S. & Takeda, M., 2006, Proceedings of the Prague Stringology Conference '06. p. 197-211 15 p.

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

Suffix Tree
Graph in graph theory
Suffix
K-space
Strings
2 引用 (Scopus)

Sparse directed acyclic word graphs

Inenaga, S. & Takeda, M., 1 1 2006, String Processing and Information Retrieval - 13th International Conference, SPIRE 2006, Proceedings. Springer Verlag, p. 61-73 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 4209 LNCS).

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

Data structures
Suffix Tree
Composite materials
Graph in graph theory
Text Indexing
2007
14 引用 (Scopus)

Efficient computation of substring equivalence classes with suffix arrays

Narisawa, K., Inenaga, S., Bannai, H. & Takeda, M., 12 1 2007, Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. p. 340-351 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 4580 LNCS).

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

Suffix Array
Equivalence classes
Equivalence class
Suffix Tree
Text Analysis
2008
5 引用 (Scopus)

Computing longest common substring and all palindromes from compressed strings

Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T. & Hashimoto, K., 2008, SOFSEM 2008: Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 巻 4910 LNCS. p. 364-375 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 4910 LNCS).

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

Straight-line Programs
Palindrome
Strings
Polynomials
Computing
14 引用 (Scopus)

Parameterized suffix arrays for binary strings

Deguchi, S., Higashijima, F., Bannai, H., Inenaga, S. & Takeda, M., 12 1 2008, Proceedings of the Prague Stringology Conference 2008. p. 84-94 11 p. (Proceedings of the Prague Stringology Conference 2008).

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

Suffix Array
Strings
Binary
Suffix Tree
Prefix
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

String Kernels based on variable-length-don't-care patterns

Narisawa, K., Bannai, H., hatano, K., Inenaga, S. & Takeda, M., 2008, Discovery Science - 11th International Conference, DS 2008, Proceedings. 巻 5255 LNAI. p. 308-318 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5255 LNAI).

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

Pattern matching
Support vector machines
Strings
kernel
Spam
2009
4 引用 (Scopus)

Anonymous authentication systems based on private information retrieval

Nakamura, T., Inenaga, S., Ikeda, D., Baba, K. & Yasuura, H., 2009, 2009 1st International Conference on Networked Digital Technologies, NDT 2009. p. 53-58 6 p. 5272083

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

Information retrieval
Authentication
Network protocols
Servers
22 引用 (Scopus)

Counting parameterized border arrays for a binary alphabet

Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 7 13 2009, Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings. p. 422-433 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5457).

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

Counting
Binary
Pattern matching
Pattern Matching
Matching Problem
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
5 引用 (Scopus)

Finding characteristic substrings from compressed texts

Inenaga, S. & Bannai, H., 2009, Proceedings of the Prague Stringology Conference 2009. p. 40-54 15 p.

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

Strings
Text Mining
Straight-line Programs
Equivalence class
Polynomial time
15 引用 (Scopus)

Lightweight parameterized suffix array construction

Tomohiro, I., Deguchi, S., Bannai, H., Inenaga, S. & Takeda, M., 12 1 2009, Combinatorial Algorithms - 20th International Workshop, IWOCA 2009, Revised Selected Papers. p. 312-323 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5874 LNCS).

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

Suffix Array
Prefix
Strings
Experimental Results
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
1 引用 (Scopus)

Testing square-freeness of strings compressed by balanced straight line program

Matsubara, W., Inenaga, S. & Shinohara, A., 2009, Theory of Computing 2009 - Proceedings of the Fifteenth Computing: The Australasian Theory Symposium, CATS 2009. 巻 94.

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

Testing
1 引用 (Scopus)

Towards modeling stored-value electronic money systems

Inenaga, S., Oyama, K. & Yasuura, H., 2009, 2009 World Congress on Nature and Biologically Inspired Computing, NABIC 2009 - Proceedings. p. 902-907 6 p. 5393854

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

Communication
Data communication systems
Electronic money
2010

An identifiable yet unlinkable authentication system with smart cards for multiple services

Nakamura, T., Inenaga, S., Ikeda, D., Baba, K. & Yasuura, H., 5 20 2010, Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4 版 p. 236-251 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6019 LNCS, 番号 PART 4).

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

Smart cards
Smart Card
Authentication
Data storage equipment
Hash functions
14 引用 (Scopus)

Counting and verifying maximal palindromes

Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 11 24 2010, String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Proceedings. 巻 6393 LNCS. p. 135-146 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6393 LNCS).

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

Palindrome
Counting
Strings
Distinct
Linear-time Algorithm
1 引用 (Scopus)

Dynamic edit distance table under a general weighted cost function

Hyyrö, H., Narisawa, K. & Inenaga, S., 3 1 2010, SOFSEM 2010: Theory and Practice of Computer Science - 36th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. p. 515-527 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5901 LNCS).

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

Edit Distance
Cost functions
Computer science
Cost Function
Table
12 引用 (Scopus)

Verifying a parameterized border array in O(n1.5) time

Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 12 1 2010, Combinatorial Pattern Matching - 21st Annual Symposium, CPM 2010, Proceedings. p. 238-250 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6129 LNCS).

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

Pattern matching
Pattern Matching
Matching Problem
Bell numbers
Bijection
2011

An anonymous authentication protocol with single-database PIR

Nakamura, T., Inenaga, S., Baba, K., Ikeda, D. & Yasuura, H., 2011, Information Security 2011 - Proceedings of the Ninth Australasian Information Security Conference, AISC 2011. 巻 116. p. 3-8 6 p.

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

Authentication
Managers
Communication

Computing longest common substring/subsequence of non-linear texts

Shimohira, K., Inenaga, S., Bannai, H. & Takeda, M., 2011, Proceedings of the Prague Stringology Conference 2011. p. 197-208 12 p.

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

Longest Common Subsequence
Computing
Directed Graph
Arc of a curve
Strings