default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShunsuke Inenaga
- > Home > Persons > Shunsuke Inenaga
Publications
- 2005
[j7]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara
, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi:
On-line construction of compact directed acyclic word graphs. Discret. Appl. Math. 146(2): 156-179 (2005)- 2004
- [j4]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Compact directed acyclic word graphs for a sliding window. J. Discrete Algorithms 2(1): 33-51 (2004) - 2003
- [j2]Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa:
A Note on Randomized Algorithm for String Matching with Mismatches. Nord. J. Comput. 10(1): 2-12 (2003) - [c15]Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa:
Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493 - 2002
- [c11]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 - [c10]Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97 - [c9]Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga:
Finding Best Patterns Practically. Progress in Discovery Science 2002: 307-317 - [c8]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa:
Space-Economical Construction of Index Structures for All Suffixes of a String. MFCS 2002: 341-352 - [c7]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE 2002: 310-324 - [c6]Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa:
A Note on Randomized Algorithm for String Matching with Mismatches. PSC 2002: 9-17 - 2001
- [c4]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 - [c3]Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
A Practical Algorithm to Find the Best Episode Patterns. Discovery Science 2001: 435-440 - [c2]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. SPIRE 2001: 96-110 - [c1]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Construction of the CDAWG for a Trie. PSC 2001: 37-48
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-03-01 01:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
