default search action
Shinichi Shimozono
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j7]Hiroshi Sakamoto, Shirou Maruyama, Takuya Kida, Shinichi Shimozono:
A Space-Saving Approximation Algorithm for Grammar-Based Compression. IEICE Trans. Inf. Syst. 92-D(2): 158-165 (2009) - 2007
- [j6]Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono:
Hardness Results on Local Multiple Alignment of Biological Sequences. Inf. Media Technol. 2(2): 514-522 (2007) - [c14]Hiroki Arimura
, Takeaki Uno, Shinichi Shimozono:
Time and Space Efficient Discovery of Maximal Geometric Graphs. Discovery Science 2007: 42-55 - 2004
- [c13]Tomoaki Suga, Shinichi Shimozono:
Approximate Point Set Pattern Matching on Sequences and Planes. CPM 2004: 89-101 - [c12]Hiroshi Sakamoto, Takuya Kida, Shinichi Shimozono:
A Space-Saving Linear-Time Algorithm for Grammar-Based Compression. SPIRE 2004: 218-229 - 2001
- [c11]Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Shinichi Shimozono, Setsuo Arikawa:
Mining Semi-structured Data by Path Expressions. Discovery Science 2001: 378-388 - [c10]Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. ISAAC 2001: 719-730 - 2000
- [j5]Shinichi Shimozono, Hiroki Arimura
Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases. New Gener. Comput. 18(1): 49-60 (2000) - [c9]Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimozono, Kouichi Hirata
Constructive Learning of Context-Free Languages with a Subpansive Tree. ICGI 2000: 270-283 - [c8]Norihiro Kubo, Shinichi Shimozono, Katsuhiro Muramoto:
A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane. ISAAC 2000: 216-227 - [c7]Hiroki Arimura, Jun-ichiro Abe, Hiroshi Sakamoto, Setsuo Arikawa, Ryoichi Fujino, Shinichi Shimozono:
Text Data Mining: Discovery of Important Keywords in the Cyberspace. Kyoto International Conference on Digital Libraries 2000: 121-126 - [c6]Tatsuya Akutsu
On approximation algorithms for local multiple alignment. RECOMB 2000: 1-7
1990 – 1999
- 1999
- [j4]Shinichi Shimozono:
Alphabet Indexing for Approximating Features of Symbols. Theor. Comput. Sci. 210(2): 245-260 (1999) - 1998
- [j3]Shinichi Shimozono, Kouichi Hirata
On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram. Inf. Process. Lett. 66(4): 165-170 (1998) - [c5]Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Shinichi Shimozono, Setsuo Arikawa:
An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases. Discovery Science 1998: 393-394 - [c4]Hiroki Arimura, Shinichi Shimozono:
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. ISAAC 1998: 39-48 - 1997
- [j2]Shinichi Shimozono:
Finding Optimal Subgraphs by Local Search. Theor. Comput. Sci. 172(1-2): 265-271 (1997) - 1996
- [c3]Kouichi Hirata
On the Hardness of Approximating the Minimum Consistent OBDD Problem. SWAT 1996: 112-123 - 1995
- [j1]Shinichi Shimozono, Satoru Miyano:
Complexity of Finding Alphabet Indexing. IEICE Trans. Inf. Syst. 78-D(1): 13-18 (1995) - [c2]Shinichi Shimozono:
An Approximation Algorithm for Alphabet Indexing Problem. ISAAC 1995: 2-11 - [c1]Takayoshi Shoudai, Michael Lappe, Satoru Miyano, Ayumi Shinohara, Takeo Okazaki, Setsuo Arikawa, Tomoyuki Uchida, Shinichi Shimozono, Takeshi Shinohara, Satoru Kuhara:
BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences. ISMB 1995: 359-366
Coauthor Index
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 2024-08-28 23:31 CEST 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: