( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximate String Matching with don't Care Characters.

. Inf. Process. Lett., 55 (5): 235-239 (1995)

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.

Tatsuya Nakada

Tatsuya Hagino

Tatsuya Banno

Tatsuya Okabe

Tatsuya Ōta

 

Другие публикации лиц с тем же именем

A bisection algorithm for grammar-based compression of ordered trees.. Inf. Process. Lett., 110 (18-19): 815-820 (2010)Approximate String Matching with don't Care Characters.. Inf. Process. Lett., 55 (5): 235-239 (1995)Performance analysis of a greedy algorithm for inferring Boolean functions., и . Inf. Process. Lett., 93 (1): 7-12 (2005)Development and comparison of search algorithms for robot motion planning in the configuration space., , , и . IROS, стр. 429-434. IEEE, (1991)Assessing the performance of computational predictors for estimating protein stability changes upon missense mutations., , , , , и . Briefings Bioinform., (2021)Cascleave: towards more accurate prediction of caspase substrate cleavage sites., , , , , , , и . Bioinform., 26 (6): 752-760 (2010)On the Compressive Power of Boolean Threshold Autoencoders., , , , и . CoRR, (2020)Integer Programming-Based Method for Designing Synthetic Metabolic Networks by Minimum Reaction Insertion in a Boolean Model, , , и . PLOS ONE, 9 (3): e92637+ (20.03.2014)A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs., , и . APBC, том 5 из Advances in Bioinformatics and Computational Biology, стр. 257-266. Imperial College Press, (2007)Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications., , , , , , и . CoRR, (2020)