Shinichi Shimozono

According to our database1, Shinichi Shimozono authored at least 21 papers between 1995 and 2009.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
A Space-Saving Approximation Algorithm for Grammar-Based Compression.
IEICE Trans. Inf. Syst., 2009

2007
Hardness Results on Local Multiple Alignment of Biological Sequences.
Inf. Media Technol., 2007

Time and Space Efficient Discovery of Maximal Geometric Graphs.
Proceedings of the Discovery Science, 10th International Conference, 2007

2004
A Space-Saving Linear-Time Algorithm for Grammar-Based Compression.
Proceedings of the String Processing and Information Retrieval, 2004

Approximate Point Set Pattern Matching on Sequences and Planes.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2001
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Mining Semi-structured Data by Path Expressions.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

2000
Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases.
New Gener. Comput., 2000

On approximation algorithms for local multiple alignment.
Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, 2000

Text Data Mining: Discovery of Important Keywords in the Cyberspace.
Proceedings of the 2000 Kyoto International Conference on Digital Libraries: Research and Practice, 2000

A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Constructive Learning of Context-Free Languages with a Subpansive Tree.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

1999
Alphabet Indexing for Approximating Features of Symbols.
Theor. Comput. Sci., 1999

1998
On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram.
Inf. Process. Lett., 1998

Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases.
Proceedings of the Discovery Science, 1998

1997
Finding Optimal Subgraphs by Local Search.
Theor. Comput. Sci., 1997

1996
On the Hardness of Approximating the Minimum Consistent OBDD Problem.
Proceedings of the Algorithm Theory, 1996

1995
Complexity of Finding Alphabet Indexing.
IEICE Trans. Inf. Syst., 1995

BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences.
Proceedings of the Third International Conference on Intelligent Systems for Molecular Biology, 1995

An Approximation Algorithm for Alphabet Indexing Problem.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995


  Loading...