Takeyuki Tamura

According to our database1, Takeyuki Tamura
  • authored at least 51 papers between 2004 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
On the parameterized complexity of associative and commutative unification.
Theor. Comput. Sci., 2017

Discrimination of singleton and periodic attractors in Boolean networks.
Automatica, 2017

2016
Finding and Analyzing the Minimum Set of Driver Nodes in control of Boolean Networks.
Advances in Complex Systems, 2016

Similar subtree search using extended tree inclusion.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 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
Similar Subtree Search Using Extended Tree Inclusion.
IEEE Trans. Knowl. Data Eng., 2015

On the complexity of finding a largest common subtree of bounded degree.
Theor. Comput. Sci., 2015

Computing Smallest Intervention Strategies for Multiple Metabolic Networks in a Boolean Model.
Journal of Computational Biology, 2015

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

2014
Efficient exponential-time algorithms for edit distance between unordered trees.
J. Discrete Algorithms, 2014

On control of singleton attractors in multiple Boolean networks: integer programming-based method.
BMC Systems Biology, 2014

On the Parameterized Complexity of Associative and Commutative Unification.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013
Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming.
IJDMB, 2013

On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors.
IEICE Transactions, 2013

On the Parameterized Complexity of Associative and Commutative Unification.
CoRR, 2013

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

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

On the Complexity of Finding a Largest Common Subtree of Bounded Degree.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012
Finding a Periodic Attractor of a Boolean Network.
IEEE/ACM Trans. Comput. Biology Bioinform., 2012

A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees.
Journal of Computational Biology, 2012

Singleton and 2-periodic attractors of sign-definite Boolean networks.
Inf. Process. Lett., 2012

Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks.
IEICE Transactions, 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

Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Exact algorithms for computing the tree edit distance between unordered trees.
Theor. Comput. Sci., 2011

Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions.
Journal of Computational Biology, 2011

An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles.
IEICE Transactions, 2011

A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures.
BMC Bioinformatics, 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.587n) time.
Inf. Process. Lett., 2010

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

Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks.
IEICE Transactions, 2010

Finding optimal control policy in Probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

2009
Algorithms for Singleton Attractor Detection in Planar and Nonplanar AND/OR Boolean Networks.
Mathematics in Computer Science, 2009

Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms.
IEICE Transactions, 2009

On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2.
IEICE Transactions, 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

Completing Networks Using Observed Data.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
Inferring Pedigree Graphs from Genetic Distances.
IEICE Transactions, 2008

Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks.
EURASIP J. Bioinformatics and Systems Biology, 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

Algorithms for Inference, Analysis and Control of Boolean Networks.
Proceedings of the Algebraic Biology, Third International Conference, 2008

2007
Approximation Algorithms for Optimal RNA Secondary Structures Common to Multiple Sequences.
IEICE Transactions, 2007

Subcellular location prediction of proteins using support vector machines with alignment of block sequences utilizing amino acid composition.
BMC Bioinformatics, 2007

An O(1.787n)-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
Efficient Methods for Determining DNA Probe Orders.
IEICE Transactions, 2006

2004
Imperfectness of Data for STS-Based Physical Mapping.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004


  Loading...