Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Shinichi Shimozono

dblp:57/5649 · DBLP profile ↗
← Back
14ranked-venue papers
4as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 7 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 5Artificial intelligence and machine learning · 3Databases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Approximation and online algorithms · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 3 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
sequence analysis		 0.022000
On approximation algorithms for local multiple alignment · RECOMB 2000
BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences · ISMB 1995
Bioinformatics and computational biology › multiple sequence alignment
local multiple alignment		 0.012000
On approximation algorithms for local multiple alignment · RECOMB 2000
Bioinformatics and computational biology
multiple sequence alignment		 0.012000
On approximation algorithms for local multiple alignment · RECOMB 2000

Methods — techniques the papers use, named apart from their topics

approximation algorithm · 0.1parallel computing · 0.0knowledge discovery · 0.0
YearPublicationVenuePosition
2007 Time and Space Efficient Discovery of Maximal Geometric Graphs
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
 Discovery Science3
2004 Approximate Point Set Pattern Matching on Sequences and Planes
Tomoaki Suga, Shinichi Shimozono
 CPM2
2004 A Space-Saving Linear-Time Algorithm for Grammar-Based Compression
Hiroshi Sakamoto, Takuya Kida, Shinichi Shimozono
 SPIRE3
2001 Mining Semi-structured Data by Path Expressions
Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Shinichi Shimozono, Setsuo Arikawa
 Discovery Science4
2001 Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara
 ISAAC2
2000 A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane
Norihiro Kubo, Shinichi Shimozono, Katsuhiro Muramoto
 ISAAC2
2000 On approximation algorithms for local multiple alignment
abstract
This paper studies the local multiple alignment problem, which is also known as the general consensus patterns problem. Local multiple alignment is, given protein or DNA sequences, to locate a region (i.e., a substring) of fixed length from each sequence so that the score determined from the set of regions is optimized. We consider the following scoring schemes. the score indicating the average information content, the score defined by Li et al, and the sum-of-pairs score
Tatsuya Akutsu, Hiroki Arimura, Shinichi Shimozono
 RECOMB3
1999 Alphabet Indexing for Approximating Features of Symbols
Shinichi Shimozono
 Theor. Comput. Sci.1
1998 An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases
Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Shinichi Shimozono, Setsuo Arikawa
 Discovery Science4
1998 Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words
Hiroki Arimura, Shinichi Shimozono
 ISAAC2
1998 On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram
Shinichi Shimozono, Kouichi Hirata, Ayumi Shinohara
 Inf. Process. Lett.1
1997 Finding Optimal Subgraphs by Local Search
Shinichi Shimozono
 Theor. Comput. Sci.1
1995 An Approximation Algorithm for Alphabet Indexing Problem
Shinichi Shimozono
 ISAAC1
1995 BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences
Takayoshi Shoudai, Michael Lappe, Satoru Miyano, Ayumi Shinohara, Takeo Okazaki, Setsuo Arikawa, Tomoyuki Uchida, Shinichi Shimozono, Takeshi Shinohara, Satoru Kuhara
 ISMB8