Takeyuki Tamura
Takeyuki Tamura
Bioinformatics Center, Institute for Chemical Research, Kyoto University
Bestätigte E-Mail-Adresse bei kuicr.kyoto-u.ac.jp - Startseite
Zitiert von
Zitiert von
Subcellular location prediction of proteins using support vector machines with alignment of block sequences utilizing amino acid composition
T Tamura, T Akutsu
BMC bioinformatics 8 (1), 466, 2007
Finding a periodic attractor of a Boolean network
T Akutsu, S Kosub, AA Melkman, T Tamura
IEEE/ACM transactions on computational biology and bioinformatics 9 (5 …, 2012
Completing networks using observed data
T Akutsu, T Tamura, K Horimoto
International Conference on Algorithmic Learning Theory, 126-140, 2009
Detecting a singleton attractor in a Boolean network utilizing SAT algorithms
T Tamura, T Akutsu
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2009
On control of singleton attractors in multiple Boolean networks: integer programming-based method
Y Qiu, T Tamura, WK Ching, T Akutsu
BMC systems biology 8 (S1), S7, 2014
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures
D Fukagawa, T Tamura, A Takasu, E Tomita, T Akutsu
BMC bioinformatics 12 (S1), S13, 2011
Compound analysis via graph kernels incorporating chirality
JB Brown, T Urata, T Tamura, MA Arai, T Kawabata, T Akutsu
Journal of Bioinformatics and Computational Biology 8 (supp01), 63-81, 2010
Finding minimum reaction cuts of metabolic networks under a boolean model using integer programming and feedback vertex sets
T Tamura, K Takemoto, T Akutsu
International Journal of Knowledge Discovery in Bioinformatics (IJKDB) 1 (1 …, 2010
Colony-live a high-throughput method for measuring microbial colony growth kinetics reveals diverse growth effects of gene knockouts in Escherichia coli
R Takeuchi, T Tamura, T Nakayashiki, Y Tanaka, A Muto, BL Wanner, ...
BMC microbiology 14 (1), 171, 2014
Determining a singleton attractor of an AND/OR Boolean network in O (1.587 n) time
AA Melkman, T Tamura, T Akutsu
Information Processing Letters 110 (14-15), 565-569, 2010
Integer programming-based approach to attractor detection and control of boolean networks
T Akutsu, Y Zhao, M Hayashida, T Tamura
IEICE TRANSACTIONS on Information and Systems 95 (12), 2960-2970, 2012
Exact algorithms for computing the tree edit distance between unordered trees
T Akutsu, D Fukagawa, A Takasu, T Tamura
Theoretical Computer Science 412 (4-5), 352-364, 2011
Finding optimal control policy in probabilistic Boolean networks with hard constraints by using integer programming and dynamic programming
X Chen, T Akutsu, T Tamura, WK Ching
International Journal of Data Mining and Bioinformatics 7 (3), 1-22, 2013
A clique-based method using dynamic programming for computing edit distance between unordered trees
T Mori, T Tamura, D Fukagawa, A Takasu, E Tomita, T Akutsu
Journal of computational biology 19 (10), 1089-1104, 2012
Algorithms for inference, analysis and control of Boolean networks
T Akutsu, M Hayashida, T Tamura
International Conference on Algebraic Biology, 1-15, 2008
Determining a singleton attractor of a Boolean network with nested canalyzing functions
T Akutsu, AA Melkman, T Tamura, M Yamamoto
Journal of computational biology 18 (10), 1275-1290, 2011
Network completion using dynamic programming and least-squares fitting
N Nakajima, T Tamura, Y Yamanishi, K Horimoto, T Akutsu
The Scientific World Journal 2012, 2012
A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree
T Akutsu, T Tamura
Algorithms 6 (1), 119-135, 2013
Efficient exponential-time algorithms for edit distance between unordered trees
T Akutsu, T Tamura, D Fukagawa, A Takasu
Journal of Discrete Algorithms 25, 79-93, 2014
Integer programming-based methods for attractor detection and control of boolean networks
T Akutsu, M Hayashida, T Tamura
Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held …, 2009
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20