( en | de | ru )

 

Disambiguation of "Akutsu, Tatsuya"

Author of the publication

copydeleteadd this publication to your clipboard
Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks.

, and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 93-A (8): 1497-1507 (2010)

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 Okabe

Tatsuya Ōta

 

Other publications of authors with the same name

Development and comparison of search algorithms for robot motion planning in the configuration space., , , and . IROS, page 429-434. IEEE, (1991)Domain-Based Approaches to Prediction and Analysis of Protein-Protein Interactions., and . IJKDB, 4 (1): 24-41 (2014)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)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)Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications., , , , , , and . CoRR, (2020)Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies., , , , , , and . CoRR, (2020)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)A bisection algorithm for grammar-based compression of ordered trees.. Inf. Process. Lett., 110 (18-19): 815-820 (2010)Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies., , and . BMC Bioinform., 12 (S-14): S3 (2011)