( en | de | ru )

 

Disambiguation of "Shimozono, Shinichi"

Author of the publication

copydeleteadd this publication to your clipboard
On approximation algorithms for local multiple alignment.

, , and . RECOMB, page 1-7. ACM, (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Shinichi Kotabe

 

Other publications of authors with the same name

Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases., , and . New Generation Comput., 18 (1): 49-60 (2000)A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane., , and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 216-227. Springer, (2000)An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases., , , , and . Discovery Science, volume 1532 of Lecture Notes in Computer Science, page 393-394. Springer, (1998)Time and Space Efficient Discovery of Maximal Geometric Graphs., , and . Discovery Science, volume 4755 of Lecture Notes in Computer Science, page 42-55. Springer, (2007)A Space-Saving Linear-Time Algorithm for Grammar-Based Compression., , and . SPIRE, volume 3246 of Lecture Notes in Computer Science, page 218-229. Springer, (2004)BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences., , , , , , , , , and . ISMB, page 359-366. AAAI, (1995)A Space-Saving Approximation Algorithm for Grammar-Based Compression., , , and . IEICE Trans. Inf. Syst., 92-D (2): 158-165 (2009)Complexity of Finding Alphabet Indexing., and . IEICE Trans. Inf. Syst., 78-D (1): 13-18 (1995)On approximation algorithms for local multiple alignment., , and . RECOMB, page 1-7. ACM, (2000)Constructive Learning of Context-Free Languages with a Subpansive Tree., , , and . ICGI, volume 1891 of Lecture Notes in Computer Science, page 270-283. Springer, (2000)