Takeyuki Tamura
Orcid: 0000-0003-1596-901X
According to our database1,
Takeyuki Tamura
authored at least 58 papers
between 2004 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Gene Deletion Algorithms for Minimum Reaction Network Design by Mixed-Integer Linear Programming for Metabolite Production in Constraint-Based Models: gDel_minRN.
J. Comput. Biol., May, 2023
MetNetComp: Database for Minimal and Maximal Gene-Deletion Strategies for Growth-Coupled Production of Genome-Scale Metabolic Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023
Trimming Gene Deletion Strategies for Growth-Coupled Production in Constraint-Based Metabolic Networks: TrimGdel.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023
2021
L1 Norm Minimal Mode-Based Methods for Listing Reaction Network Designs for Metabolite Production.
IEICE Trans. Inf. Syst., 2021
Dynamic Solution Space Division-Based Methods for Calculating Reaction Deletion Strategies for Constraint-Based Metabolic Networks for Substance Production: DynCubeProd.
Frontiers Bioinform., 2021
2020
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree.
Int. J. Found. Comput. Sci., 2020
2019
Toward more accurate prediction of caspase cleavage sites: a comprehensive review of current methods, tools and features.
Briefings Bioinform., 2019
2018
IEEE ACM Trans. Comput. Biol. Bioinform., 2018
Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd.
BMC Bioinform., 2018
A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018
2017
Theor. Comput. Sci., 2017
Autom., 2017
2016
Finding and Analyzing the Minimum Set of Driver Nodes in control of Boolean Networks.
Adv. Complex Syst., 2016
Finding Influential Genes Using Gene Expression Data and Boolean Models of Metabolic Networks.
Proceedings of the 16th IEEE International Conference on Bioinformatics and Bioengineering, 2016
2015
IEEE Trans. Knowl. Data Eng., 2015
Theor. Comput. Sci., 2015
Computing Smallest Intervention Strategies for Multiple Metabolic Networks in a Boolean Model.
J. Comput. Biol., 2015
A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
2014
J. Discrete Algorithms, 2014
On control of singleton attractors in multiple Boolean networks: integer programming-based method.
BMC Syst. Biol., 2014
2013
Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming.
Int. J. Data Min. Bioinform., 2013
On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
CoRR, 2013
Flux balance impact degree: a new definition of impact degree to properly treat reversible reactions in metabolic networks.
Bioinform., 2013
A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree.
Algorithms, 2013
2012
IEEE ACM Trans. Comput. Biol. Bioinform., 2012
A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees.
J. Comput. Biol., 2012
Inf. Process. Lett., 2012
Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks.
IEICE Trans. Inf. Syst., 2012
Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment.
Proceedings of the Pattern Recognition in Bioinformatics, 2012
A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
2011
Theor. Comput. Sci., 2011
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions.
J. Comput. Biol., 2011
An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles.
IEICE Trans. Inf. Syst., 2011
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures.
BMC Bioinform., 2011
An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures.
Proceedings of the International Conference on Complex, 2011
2010
Determining a singleton attractor of an AND/OR Boolean network in O(1.587<sup>n</sup>) time.
Inf. Process. Lett., 2010
Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets.
Int. J. Knowl. Discov. Bioinform., 2010
Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010
2009
Algorithms for Singleton Attractor Detection in Planar and Nonplanar AND/OR Boolean Networks.
Math. Comput. Sci., 2009
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009
Measuring Structural Robustness of Metabolic Networks under a Boolean Model Using Integer Programming and Feedback Vertex Sets.
Proceedings of the 2009 International Conference on Complex, 2009
Efficient computation of impact degrees for multiple reactions in metabolic networks with cycles.
Proceedings of the Proceeding of the 3rd International Workshop on Data and Text Mining in Bioinformatics, 2009
Integer programming-based methods for attractor detection and control of boolean networks.
Proceedings of the 48th IEEE Conference on Decision and Control, 2009
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009
2008
Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks.
EURASIP J. Bioinform. Syst. Biol., 2008
An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes.
Proceedings of the Algebraic Biology, Third International Conference, 2008
Proceedings of the Algebraic Biology, Third International Conference, 2008
2007
Approximation Algorithms for Optimal RNA Secondary Structures Common to Multiple Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007
Subcellular location prediction of proteins using support vector machines with alignment of block sequences utilizing amino acid composition.
BMC Bioinform., 2007
An O(1.787<sup>n</sup>)-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007
2006
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
2004
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004