Author of the publication

Integer programming-based methods for attractor detection and control of boolean networks.

, , and . CDC, page 5610-5617. IEEE, (2009)

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.

 

Other publications of authors with the same name

A dynamic programming algorithm to predict synthesis processes of tree-structured compounds with graph grammar., , , and . Genome informatics. International Conference on Genome Informatics, (2010)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)Imperfectness of Data for STS-Based Physical Mapping., , and . IFIP TCS, volume 155 of IFIP, page 279-292. Kluwer/Springer, (2004)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)On the Parameterized Complexity of Associative and Commutative Unification., , and . CoRR, (2013)Computational Methods for Modification of Metabolic Networks., , and . Computational and structural biotechnology journal, (2015)Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd.. BMC Bioinform., 19 (1): 325:1-325:9 (2018)On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 92-A (8): 1771-1778 (2009)Exact algorithms for computing the tree edit distance between unordered trees., , , and . Theor. Comput. Sci., 412 (4-5): 352-364 (2011)