( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Exact algorithms for computing the tree edit distance between unordered trees.

, , , и . Theor. Comput. Sci., 412 (4-5): 352-364 (2011)

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

 

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

Domain-Based Approaches to Prediction and Analysis of Protein-Protein Interactions., и . IJKDB, 4 (1): 24-41 (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)Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies., , , , , , и . CoRR, (2020)A bisection algorithm for grammar-based compression of ordered trees.. Inf. Process. Lett., 110 (18-19): 815-820 (2010)Performance analysis of a greedy algorithm for inferring Boolean functions., и . Inf. Process. Lett., 93 (1): 7-12 (2005)Approximate String Matching with don't Care Characters.. Inf. Process. Lett., 55 (5): 235-239 (1995)An FVS-Based Approach to Attractor Detection in Asynchronous Random Boolean Networks., , и . IEEE ACM Trans. Comput. Biol. Bioinform., 19 (2): 806-818 (2022)Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs., , и . IEEE ACM Trans. Comput. Biol. Bioinform., 15 (2): 633-646 (2018)Common Attractors in Multiple Boolean Networks., , , , , и . IEEE ACM Trans. Comput. Biol. Bioinform., 20 (5): 2862-2873 (сентября 2023)