Takeyuki Tamura

Tatsuya Akutsu, Takeyuki Tamura, Morihiro Hayashida, 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

Algorithms for Singleton Attractor Detection in Planar and Nonplanar AND/OR Boolean Networks

Tatsuya Akutsu, Takeyuki Tamura, T. Akutsu, 2009, Math. Comput. Sci..

Computational Methods for Modification of Metabolic Networks

Tatsuya Akutsu, Takeyuki Tamura, Wei Lu, 2015, Computational and structural biotechnology journal.

Discrimination of singleton and periodic attractors in Boolean networks

Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching, 2017, Autom..

A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree

Tatsuya Akutsu, Takeyuki Tamura, 2012, MFCS.

Approximation Algorithms for Optimal RNA Secondary Structures Common to Multiple Sequences

Tatsuya Akutsu, Takeyuki Tamura, 2007, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes

Tatsuya Akutsu, Takeyuki Tamura, T. Akutsu, 2008, AB.

On control of singleton attractors in multiple Boolean networks: integer programming-based method

Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching, 2014, BMC Systems Biology.

Inferring Pedigree Graphs from Genetic Distances

Takeyuki Tamura, Hiro Ito, 2008, IEICE Trans. Inf. Syst..

Network Completion Using Dynamic Programming and Least-Squares Fitting

Tatsuya Akutsu, Takeyuki Tamura, Yoshihiro Yamanishi, 2012, TheScientificWorldJournal.

Finding optimal control policy in Probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming

Xi Chen, Tatsuya Akutsu, Takeyuki Tamura, 2010, BIBM.

Computing Smallest Intervention Strategies for Multiple Metabolic Networks in a Boolean Model

Jiangning Song, Tatsuya Akutsu, Takeyuki Tamura, 2015, J. Comput. Biol..

Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment

Tatsuya Akutsu, Takeyuki Tamura, Morihiro Hayashida, 2012, PRIB.

Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree

Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, 2020, Int. J. Found. Comput. Sci..

New Algorithms for Unordered Tree Inclusion pdf

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2017, ArXiv.

Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd

Takeyuki Tamura, 2017 .

On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors

Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching, 2013, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles

Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching, 2011, IEICE Trans. Inf. Syst..

A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree

Tatsuya Akutsu, Takeyuki Tamura, 2013, Algorithms.

Toward more accurate prediction of caspase cleavage sites: a comprehensive review of current methods, tools and features

Jiangning Song, Tatsuya Akutsu, Takeyuki Tamura, 2018, Briefings Bioinform..

Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model

Tatsuya Akutsu, Takeyuki Tamura, Kazuhiro Takemoto, 2012 .

Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks

Tatsuya Akutsu, Takeyuki Tamura, 2010, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms

Tatsuya Akutsu, Takeyuki Tamura, T. Akutsu, 2009, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Efficient Methods for Determining DNA Probe Orders

Takeyuki Tamura, Kazuo Iwama, Hiro Ito, 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Integer Programming-Based Method for Designing Synthetic Metabolic Networks by Minimum Reaction Insertion in a Boolean Model

Jiangning Song, Tatsuya Akutsu, Takeyuki Tamura, 2014, PloS one.

Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks

Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching, 2008, EURASIP J. Bioinform. Syst. Biol..

Efficient reaction deletion algorithms for redesign of constraint-based metabolic networks for metabolite production with weak coupling

Takeyuki Tamura, 2020 .

Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions

Tatsuya Akutsu, Takeyuki Tamura, Masaki Yamamoto, 2011, J. Comput. Biol..

Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets

Tatsuya Akutsu, Takeyuki Tamura, Kazuhiro Takemoto, 2010, Int. J. Knowl. Discov. Bioinform..

Exact algorithms for computing the tree edit distance between unordered trees

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2010, Theor. Comput. Sci..

On the parameterized complexity of associative and commutative unification

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2013, Theor. Comput. Sci..

On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2

Tatsuya Akutsu, Takeyuki Tamura, T. Akutsu, 2009, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree

Tatsuya Akutsu, Takeyuki Tamura, 2012, ISAAC.

An O(1.787n)-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes

Tatsuya Akutsu, Takeyuki Tamura, T. Akutsu, 2007, FCT.

Subcellular location prediction of proteins using support vector machines with alignment of block sequences utilizing amino acid composition

Tatsuya Akutsu, Takeyuki Tamura, T. Akutsu, 2007, BMC Bioinformatics.

Algorithms for Inference, Analysis and Control of Boolean Networks

Tatsuya Akutsu, Takeyuki Tamura, Morihiro Hayashida, 2008, AB.

Measuring Structural Robustness of Metabolic Networks under a Boolean Model Using Integer Programming and Feedback Vertex Sets

Tatsuya Akutsu, Takeyuki Tamura, Kazuhiro Takemoto, 2009, 2009 International Conference on Complex, Intelligent and Software Intensive Systems.

Singleton and 2-periodic attractors of sign-definite Boolean networks

Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, 2012, Inf. Process. Lett..

On the parameterized complexity of associative and commutative unification

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2017, Theor. Comput. Sci..

Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd

Takeyuki Tamura, T. Tamura, Takeyuki Tamura, 2017, BMC Bioinformatics.

Efficient computation of impact degrees for multiple reactions in metabolic networks with cycles

Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching, 2009, DTMBIO.

Computing Minimum Reaction Modifications in a Boolean Metabolic Network

Jiangning Song, Tatsuya Akutsu, Takeyuki Tamura, 2018, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2012, CPM.

Efficient exponential-time algorithms for edit distance between unordered trees

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2014, J. Discrete Algorithms.

On the complexity of finding a largest common subtree of bounded degree

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2015, Theor. Comput. Sci..

Flux balance impact degree: a new definition of impact degree to properly treat reversible reactions in metabolic networks

Tatsuya Akutsu, Takeyuki Tamura, Yang Zhao, 2013, Bioinform..

An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2011, 2011 International Conference on Complex, Intelligent, and Software Intensive Systems.

Completing Networks Using Observed Data

Tatsuya Akutsu, Takeyuki Tamura, Katsuhisa Horimoto, 2009, ALT.

Determining a singleton attractor of an AND/OR Boolean network in O(1.587n) time

Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, 2010, Inf. Process. Lett..

Finding Influential Genes Using Gene Expression Data and Boolean Models of Metabolic Networks

Tatsuya Akutsu, Takeyuki Tamura, Chun-Yu Lin, 2016, 2016 IEEE 16th International Conference on Bioinformatics and Bioengineering (BIBE).

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2015, IEEE Transactions on Knowledge and Data Engineering.

A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth

Tatsuya Akutsu, Takeyuki Tamura, Kun-Mao Chao, 2015, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Finding optimal control policy in Probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming

Xi Chen, Tatsuya Akutsu, Takeyuki Tamura, 2010, 2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM).

A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications

Tatsuya Akutsu, Takeyuki Tamura, Colin de la Higuera, 2018, CPM.

Gene Deletion Algorithms for Minimum Reaction Network Design by Mixed-Integer Linear Programming for Metabolite Production in Constraint-Based Models: gDel_minRN

Takeyuki Tamura, Yukako Tohsato, Ai Muto-Fujita, 2021, J. Comput. Biol..

New and improved algorithms for unordered tree inclusion

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, 2021, Theor. Comput. Sci..

L1 Norm Minimal Mode-Based Methods for Listing Reaction Network Designs for Metabolite Production

Takeyuki Tamura, T. Tamura, Takeyuki Tamura, 2021, IEICE Trans. Inf. Syst..

Colony-live — a high-throughput method for measuring microbial colony growth kinetics— reveals diverse growth effects of gene knockouts in Escherichia coli

Takeyuki Tamura, Hirotada Mori, Ai Muto, 2014, BMC Microbiology.

Theoretical estimation of metabolic network robustness against multiple reaction knockouts using branching process approximation

Tatsuya Akutsu, Takeyuki Tamura, Kazuhiro Takemoto, 2013, 1307.4922.