Hiromasa Hoshino

According to our database, Hiromasa Hoshino authored at least 7 papers between 2000 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2005

On-line construction of compact directed acyclic word graphs.

Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi

Discret. Appl. Math., 2005

2003

A practical algorithm to find the best subsequence patterns.

Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Theor. Comput. Sci., 2003

2002

Finding Best Patterns Practically.

Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga

Proceedings of the Progress in Discovery Science, 2002

The Minimum DAWG for All Suffixes of a String and Its Applications.

Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

Construction of the CDAWG for a Trie.

Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, 2001

On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.

Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

2000

Online Construction of Subsequence Automata for Multiple Texts.

Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000