If you made any changes in Pure these will be visible here soon.

Research Output

Filter
Article
2020

Dynamic index and LZ factorization in compressed space

Nishimoto, T., I, T., Inenaga, S., Bannai, H. & Takeda, M., Mar 15 2020, In : Discrete Applied Mathematics. 274, p. 116-129 14 p.

Research output: Contribution to journalArticle

1 Citation (Scopus)

Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings

Watanabe, K., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., Jan 1 2020, (Accepted/In press) In : Theory of Computing Systems.

Research output: Contribution to journalArticle

2019

On the size of the smallest alphabet for Lyndon trees

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

Research output: Contribution to journalArticle

2018

Algorithms and combinatorial properties on shortest unique palindromic substrings

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

Research output: Contribution to journalArticle

3 Citations (Scopus)
2017

Efficient Computation of Substring Equivalence Classes with Suffix Arrays

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Inferring strings from Lyndon factorization

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

Research output: Contribution to journalArticle

2 Citations (Scopus)

The "runs" theorem

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

Research output: Contribution to journalArticle

33 Citations (Scopus)
2016

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text

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

Research output: Contribution to journalArticle

11 Citations (Scopus)

Generalized pattern matching and periodicity under substring consistent equivalence relations

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

Research output: Contribution to journalArticle

7 Citations (Scopus)
2015

Compressed automata for dictionary matching

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

Research output: Contribution to journalArticle

6 Citations (Scopus)

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

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

Research output: Contribution to journalArticle

8 Citations (Scopus)

Detecting regularities on grammar-compressed strings

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

Research output: Contribution to journalArticle

9 Citations (Scopus)
2014

Inferring strings from suffix trees and links on a binary alphabet

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

Research output: Contribution to journalArticle

12 Citations (Scopus)
2013

Fast q-gram mining on SLP compressed strings

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

Research output: Contribution to journalArticle

13 Citations (Scopus)

Palindrome pattern matching

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

Research output: Contribution to journalArticle

8 Citations (Scopus)
2012

An online algorithm for lightweight grammar-based compression

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

Research output: Contribution to journalArticle

18 Citations (Scopus)
2011

Adaptive online prediction using weighted windows

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

Research output: Contribution to journalArticle

9 Citations (Scopus)

Verifying and enumerating parameterized border arrays

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

Research output: Contribution to journalArticle

13 Citations (Scopus)
2010

Context-sensitive grammar transform: Compression and pattern matching

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

Research output: Contribution to journalArticle

1 Citation (Scopus)
2009

A run-time efficient implementation of compressed pattern matching automata

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

Research output: Contribution to journalArticle

Linear-Time text compression by longest-first substitution

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

Research output: Contribution to journalArticle

13 Citations (Scopus)
2008

Reachability on suffix tree graphs

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

Research output: Contribution to journalArticle

2006

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

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

Research output: Contribution to journalArticle

5 Citations (Scopus)
2005

A fully compressed pattern matching algorithm for simple collage systems

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

On-line construction of compact directed acyclic word graphs

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

Research output: Contribution to journalArticle

30 Citations (Scopus)
2004
4 Citations (Scopus)

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

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

Research output: Contribution to journalArticle

7 Citations (Scopus)

Compact directed acyclic word graphs for a sliding window

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

Research output: Contribution to journalArticle

7 Citations (Scopus)

Efficiently finding regulatory elements using correlation with gene expression

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

Research output: Contribution to journalArticle

19 Citations (Scopus)

Ternary directed acyclic word graphs

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

Research output: Contribution to journalArticle

3 Citations (Scopus)
2003
1 Citation (Scopus)

A practical algorithm to find the best subsequence patterns

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

Research output: Contribution to journalArticle

11 Citations (Scopus)

Collage system: A unifying framework for compressed pattern matching

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

Research output: Contribution to journalArticle

43 Citations (Scopus)

Discovering characteristic expressions in literary works

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

Research output: Contribution to journalArticle

7 Citations (Scopus)

Discovering instances of poetic allusion from anthologies of classical Japanese poems

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

Research output: Contribution to journalArticle

4 Citations (Scopus)
14 Citations (Scopus)

Uniform characterizations of polynomial-query learnabilities

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

Research output: Contribution to journalArticle

2002

A string pattern regression algorithm and its application to pattern discovery in long introns.

Bannai, H., Inenaga, S., Shinohara, A., Takeda, M. & Miyano, S., Jan 1 2002, In : Genome informatics. International Conference on Genome Informatics. 13, p. 3-11 9 p.

Research output: Contribution to journalArticle

17 Citations (Scopus)
2001

Compressed pattern matching for Sequitur

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

Research output: Contribution to journalArticle

11 Citations (Scopus)

Faster approximate string matching over compressed text

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

Research output: Contribution to journalArticle

33 Citations (Scopus)
2000

Discovering characteristic patterns from collections of classical Japanese poems

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

Research output: Contribution to specialist publicationArticle

4 Citations (Scopus)

Speeding up pattern matching by text compression

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

Research output: Contribution to journalArticle

31 Citations (Scopus)
1998

Multiple pattern matching in LZW compressed text

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

Research output: Contribution to journalArticle

47 Citations (Scopus)
1993

A fast string-searching algorithm for multiple patterns

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

Research output: Contribution to journalArticle

4 Citations (Scopus)