( en | de | ru )

 

Disambiguation of "Akutsu, Tatsuya"

Author of the publication

copydeleteadd this publication to your clipboard
New Algorithms for Unordered Tree Inclusion.

, , , , and . CoRR, (2017)

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.

Tatsuya Nakada

Tatsuya Hagino

Tatsuya Banno

Tatsuya Ōta

Tatsuya Okabe

 

Other publications of authors with the same name

A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs., , and . APBC, volume 5 of Advances in Bioinformatics and Computational Biology, page 257-266. Imperial College Press, (2007)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., and . Inf. Process. Lett., 93 (1): 7-12 (2005)Approximate String Matching with don't Care Characters.. Inf. Process. Lett., 55 (5): 235-239 (1995)Integer Programming-Based Method for Designing Synthetic Metabolic Networks by Minimum Reaction Insertion in a Boolean Model, , , and . PLOS ONE, 9 (3): e92637+ (Mar 20, 2014)Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs., , and . IEEE ACM Trans. Comput. Biol. Bioinform., 15 (2): 633-646 (2018)Common Attractors in Multiple Boolean Networks., , , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 20 (5): 2862-2873 (September 2023)An FVS-Based Approach to Attractor Detection in Asynchronous Random Boolean Networks., , and . IEEE ACM Trans. Comput. Biol. Bioinform., 19 (2): 806-818 (2022)On the complexity of finding a largest common subtree of bounded degree., , , and . Theor. Comput. Sci., (2015)LBSizeCleav: improved support vector machine (SVM)-based prediction of Dicer cleavage sites using loop/bulge length., , and . BMC Bioinform., (2016)