| 2005 |
|---|
| 8 | EE | Shunsuke Inenaga,
Hiromasa Hoshino,
Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa,
Giancarlo Mauri,
Giulio Pavesi:
On-line construction of compact directed acyclic word graphs.
Discrete Applied Mathematics 146(2): 156-179 (2005) |
| 2003 |
|---|
| 7 | | Masahiro Hirao,
Hiromasa Hoshino,
Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa:
A practical algorithm to find the best subsequence patterns.
Theor. Comput. Sci. 292(2): 465-479 (2003) |
| 2002 |
|---|
| 6 | EE | Shunsuke Inenaga,
Masayuki Takeda,
Ayumi Shinohara,
Hiromasa Hoshino,
Setsuo Arikawa:
The Minimum DAWG for All Suffixes of a String and Its Applications.
CPM 2002: 153-167 |
| 5 | EE | Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa,
Masahiro Hirao,
Hiromasa Hoshino,
Shunsuke Inenaga:
Finding Best Patterns Practically.
Progress in Discovery Science 2002: 307-317 |
| 2001 |
|---|
| 4 | EE | Shunsuke Inenaga,
Hiromasa Hoshino,
Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa,
Giancarlo Mauri,
Giulio Pavesi:
On-Line Construction of Compact Directed Acyclic Word Graphs.
CPM 2001: 169-180 |
| 3 | | Shunsuke Inenaga,
Hiromasa Hoshino,
Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa:
On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.
SPIRE 2001: 96-110 |
| 2000 |
|---|
| 2 | EE | Masahiro Hirao,
Hiromasa Hoshino,
Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa:
A Practical Algorithm to Find the Best Subsequence Patterns.
Discovery Science 2000: 141-154 |
| 1 | EE | Hiromasa Hoshino,
Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa:
Online Construction of Subsequence Automata for Multiple Texts.
SPIRE 2000: 146-152 |
