( en | de | ru )

 

Disambiguation of "Tamura, Takeyuki"

Author of the publication

copydeleteadd this publication to your clipboard
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)
DOI: 10.1371/journal.pone.0092637

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.

Claudia Tamura

Ichiro Tamura

Hitoshi Tamura

Naoki Tamura

Gabriel Tamura

 

Other publications of authors with the same name

An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles., , , and . IEICE Trans. Inf. Syst., 94-D (12): 2393-2399 (2011)A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures., , , , and . BMC Bioinform., 12 (S-1): S13 (2011)On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree., and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 146-155. Springer, (2012)A dynamic programming algorithm to predict synthesis processes of tree-structured compounds with graph grammar., , , and . Genome informatics. International Conference on Genome Informatics, (2010)Imperfectness of Data for STS-Based Physical Mapping., , and . IFIP TCS, volume 155 of IFIP, page 279-292. Kluwer/Springer, (2004)Singleton and 2-periodic attractors of sign-definite Boolean networks., , and . Inf. Process. Lett., 112 (1-2): 35-38 (2012)Efficient exponential-time algorithms for edit distance between unordered trees., , , and . J. Discrete Algorithms, (2014)A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees., , , , , and . J. Comput. Biol., 19 (10): 1089-1104 (2012)Integer programming-based methods for attractor detection and control of boolean networks., , and . CDC, page 5610-5617. IEEE, (2009)Finding optimal control policy in Probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming., , , and . BIBM, page 240-246. IEEE Computer Society, (2010)