Saori Itami-Matsumoto, Michiyo Hayakawa, Sawako Uchida-Kobayashi, Masaru Enomoto, Akihiro Tamori, Kazuyuki Mizuno, Hidenori Toyoda, Takeyuki Tamura, Tatsuya Akutsu, Takahiro Ochiya, Norifumi Kawada, Yoshiki Murakami |
Saori Itami-Matsumoto, Michiyo Hayakawa, Sawako Uchida-Kobayashi, Masaru Enomoto, Akihiro Tamori, Kazuyuki Mizuno, Hidenori Toyoda, Takeyuki Tamura, Tatsuya Akutsu, Takahiro Ochiya, Norifumi Kawada, Yoshiki Murakami |
Saori Itami-Matsumoto, Michiyo Hayakawa, Sawako Uchida-Kobayashi, Masaru Enomoto, Akihiro Tamori, Kazuyuki Mizuno, Hidenori Toyoda, Takeyuki Tamura, Tatsuya Akutsu, Takahiro Ochiya, Norifumi Kawada, Yoshiki Murakami |
Circulating Exosomal miRNA Profiles Predict the Occurrence and Recurrence of Hepatocellular Carcinoma in Patients with Direct-Acting Antiviral-Induced Sustained Viral Response. |
Circulating Exosomal miRNA Profiles Predict the Occurrence and Recurrence of Hepatocellular Carcinoma in Patients with Direct-Acting Antiviral-Induced Sustained Viral Response. |
Circulating Exosomal miRNA Profiles Predict the Occurrence and Recurrence of Hepatocellular Carcinoma in Patients with Direct-Acting Antiviral-Induced Sustained Viral Response. |
Biomedicines, 7, 4 |
Biomedicines, 7, 4 |
Biomedicines, 7, 4 |
2019/11/03 |
有 |
英語 |
|
公開 |
Yu Bao, Simone Marini, Takeyuki Tamura, Mayumi Kamada, Shingo Maegawa, Hiroshi Hosokawa, Jiangning Song, Tatsuya Akutsu |
Yu Bao, Simone Marini, Takeyuki Tamura, Mayumi Kamada, Shingo Maegawa, Hiroshi Hosokawa, Jiangning Song, Tatsuya Akutsu |
Yu Bao, Simone Marini, Takeyuki Tamura, Mayumi Kamada, Shingo Maegawa, Hiroshi Hosokawa, Jiangning Song, Tatsuya Akutsu |
Toward more accurate prediction of caspase cleavage sites: a comprehensive review of current methods, tools and features. |
Toward more accurate prediction of caspase cleavage sites: a comprehensive review of current methods, tools and features. |
Toward more accurate prediction of caspase cleavage sites: a comprehensive review of current methods, tools and features. |
Briefings Bioinform., 20, 5, 1669-1684 |
Briefings Bioinform., 20, 5, 1669-1684 |
Briefings Bioinform., 20, 5, 1669-1684 |
2019 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Takeyuki Tamura, Wei Lu, Jiangning song, Tatsuya Akutsu |
Takeyuki Tamura, Wei Lu, Jiangning song, Tatsuya Akutsu |
Takeyuki Tamura, Wei Lu, Jiangning Song, Tatsuya Akutsu |
Computing Minimum Reaction Modifications in a Boolean Metabolic Network. |
Computing Minimum Reaction Modifications in a Boolean Metabolic Network. |
Computing Minimum Reaction Modifications in a Boolean Metabolic Network. |
IEEE/ACM Trans. Comput. Biology Bioinform., 15, 6, 1853-1862 |
IEEE/ACM Trans. Comput. Biology Bioinform., 15, 6, 1853-1862 |
IEEE/ACM Trans. Comput. Biology Bioinform., 15, 6, 1853-1862 |
2018/11 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tamura T |
Tamura T |
Tamura T |
Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd. |
Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd. |
Grid-based computational methods for the design of constraint-based parsimonious chemical reaction networks to simulate metabolite production: GridProd. |
BMC bioinformatics, 19, 1, 325 |
BMC bioinformatics, 19, 1, 325 |
BMC bioinformatics, 19, 1, 325 |
2018/09/14 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Colin De La Higuera, Takeyuki Tamura |
Tatsuya Akutsu, Colin De La Higuera, Takeyuki Tamura |
Tatsuya Akutsu, Colin De La Higuera, Takeyuki Tamura |
A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications |
A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications |
A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications |
Leibniz International Proceedings in Informatics, LIPIcs, 105, 101-1012 |
Leibniz International Proceedings in Informatics, LIPIcs, 105, 101-1012 |
Leibniz International Proceedings in Informatics, LIPIcs, 105, 101-1012 |
2018/05/01 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Tatsuya Akutsu, Jesper Jansson,Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Jesper Jansson,Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Jesper Jansson,Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura |
New and Improved Algorithms for Unordered Tree Inclusion. |
New and Improved Algorithms for Unordered Tree Inclusion. |
New and Improved Algorithms for Unordered Tree Inclusion. |
29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, 27:1-27:12 |
29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, 27:1-27:12 |
29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, 27:1-27:12 |
2018 |
有 |
|
|
公開 |
Xiaoqing Cheng, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
Xiaoqing Cheng, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
Xiaoqing Cheng, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
Discrimination of singleton and periodic attractors in Boolean networks*  |
Discrimination of singleton and periodic attractors in Boolean networks*  |
Discrimination of singleton and periodic attractors in Boolean networks*  |
AUTOMATICA, 84, 205-213 |
AUTOMATICA, 84, 205-213 |
AUTOMATICA, 84, 205-213 |
2017/10 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura |
On the parameterized complexity of associative and commutative unification  |
On the parameterized complexity of associative and commutative unification  |
On the parameterized complexity of associative and commutative unification  |
THEORETICAL COMPUTER SCIENCE, 660, 57-74 |
THEORETICAL COMPUTER SCIENCE, 660, 57-74 |
THEORETICAL COMPUTER SCIENCE, 660, 57-74 |
2017/01 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Wenpin Hou, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
Wenpin Hou, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
Wenpin Hou, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
FINDING AND ANALYZING THE MINIMUM SET OF DRIVER NODES IN CONTROL OF BOOLEAN NETWORKS |
FINDING AND ANALYZING THE MINIMUM SET OF DRIVER NODES IN CONTROL OF BOOLEAN NETWORKS |
FINDING AND ANALYZING THE MINIMUM SET OF DRIVER NODES IN CONTROL OF BOOLEAN NETWORKS |
ADVANCES IN COMPLEX SYSTEMS, 19, 3, 1-32 |
ADVANCES IN COMPLEX SYSTEMS, 19, 3, 1-32 |
ADVANCES IN COMPLEX SYSTEMS, 19, 3, 1-32 |
2016/05 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu |
Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu |
Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu |
Similar Subtree Search Using Extended Tree Inclusion |
Similar Subtree Search Using Extended Tree Inclusion |
Similar Subtree Search Using Extended Tree Inclusion |
2016 32ND IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 1558-1559 |
2016 32ND IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 1558-1559 |
2016 32ND IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 1558-1559 |
2016 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Takeyuki Tamura, Tatsuya Akutsu, Chun-Yu Lin, Jinn-Moon Yang |
Takeyuki Tamura, Tatsuya Akutsu, Chun-Yu Lin, Jinn-Moon Yang |
Takeyuki Tamura, Tatsuya Akutsu, Chun-Yu Lin, Jinn-Moon Yang |
Finding Influential Genes Using Gene Expression Data and Boolean Models of Metabolic Networks |
Finding Influential Genes Using Gene Expression Data and Boolean Models of Metabolic Networks |
Finding Influential Genes Using Gene Expression Data and Boolean Models of Metabolic Networks |
2016 IEEE 16TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOENGINEERING (BIBE), 2016, BIBE, 57-63 |
2016 IEEE 16TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOENGINEERING (BIBE), 2016, BIBE, 57-63 |
2016 IEEE 16TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOENGINEERING (BIBE), 2016, BIBE, 57-63 |
2016 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu |
Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu |
Tomoya Mori, Atsuhiro Takasu, Jesper Jansson, Jaewook Hwang, Takeyuki Tamura, Tatsuya Akutsu |
Similar Subtree Search Using Extended Tree Inclusion |
Similar Subtree Search Using Extended Tree Inclusion |
Similar Subtree Search Using Extended Tree Inclusion |
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 27, 12, 3360-3373 |
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 27, 12, 3360-3373 |
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 27, 12, 3360-3373 |
2015/12 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu |
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu |
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu |
On the complexity of finding a largest common subtree of bounded degree  |
On the complexity of finding a largest common subtree of bounded degree  |
On the complexity of finding a largest common subtree of bounded degree  |
THEORETICAL COMPUTER SCIENCE, 590, 2-16 |
THEORETICAL COMPUTER SCIENCE, 590, 2-16 |
THEORETICAL COMPUTER SCIENCE, 590, 2-16 |
2015/07 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Wei Lu, Takeyuki Tamura, Jiangning Song, Tatsuya Akutsu |
Wei Lu, Takeyuki Tamura, Jiangning Song, Tatsuya Akutsu |
Wei Lu, Takeyuki Tamura, Jiangning Song, Tatsuya Akutsu |
Computing Smallest Intervention Strategies for Multiple Metabolic Networks in a Boolean Model  |
Computing Smallest Intervention Strategies for Multiple Metabolic Networks in a Boolean Model  |
Computing Smallest Intervention Strategies for Multiple Metabolic Networks in a Boolean Model  |
JOURNAL OF COMPUTATIONAL BIOLOGY, 22, 2, 85-110 |
JOURNAL OF COMPUTATIONAL BIOLOGY, 22, 2, 85-110 |
JOURNAL OF COMPUTATIONAL BIOLOGY, 22, 2, 85-110 |
2015/02 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Takeyuki Tamura, Wei Lu, Tatsuya Akutsu |
Takeyuki Tamura, Wei Lu, Tatsuya Akutsu |
Takeyuki Tamura, Wei Lu, Tatsuya Akutsu |
Computational Methods for Modification of Metabolic Networks  |
Computational Methods for Modification of Metabolic Networks  |
Computational Methods for Modification of Metabolic Networks  |
COMPUTATIONAL AND STRUCTURAL BIOTECHNOLOGY JOURNAL, 13, 376-381 |
COMPUTATIONAL AND STRUCTURAL BIOTECHNOLOGY JOURNAL, 13, 376-381 |
COMPUTATIONAL AND STRUCTURAL BIOTECHNOLOGY JOURNAL, 13, 376-381 |
2015 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Chia-Jung Chang, Takeyuki Tamura, Kun-Mao Chao, Tatsuya Akutsu |
Chia-Jung Chang, Takeyuki Tamura, Kun-Mao Chao, Tatsuya Akutsu |
Chia-Jung Chang, Takeyuki Tamura, Kun-Mao Chao, Tatsuya Akutsu |
A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth  |
A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth  |
A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth  |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E98A, 1, 384-390 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E98A, 1, 384-390 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E98A, 1, 384-390 |
2015/01 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Rikiya Takeuchi, Takeyuki Tamura, Toru Nakayashiki, Yuichirou Tanaka, Ai Muto, Barry L. Wanner, Hirotada Mori |
Rikiya Takeuchi, Takeyuki Tamura, Toru Nakayashiki, Yuichirou Tanaka, Ai Muto, Barry L. Wanner, Hirotada Mori |
Rikiya Takeuchi, Takeyuki Tamura, Toru Nakayashiki, Yuichirou Tanaka, Ai Muto, Barry L. Wanner, Hirotada Mori |
Colony-live -a high-throughput method for measuring microbial colony growth kinetics- reveals diverse growth effects of gene knockouts in Escherichia coli |
Colony-live -a high-throughput method for measuring microbial colony growth kinetics- reveals diverse growth effects of gene knockouts in Escherichia coli |
Colony-live -a high-throughput method for measuring microbial colony growth kinetics- reveals diverse growth effects of gene knockouts in Escherichia coli |
BMC MICROBIOLOGY, 14, 1, 171 |
BMC MICROBIOLOGY, 14, 1, 171 |
BMC MICROBIOLOGY, 14, 1, 171 |
2014/06 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu |
Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu |
Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu |
Efficient exponential-time algorithms for edit distance between unordered trees |
Efficient exponential-time algorithms for edit distance between unordered trees |
Efficient exponential-time algorithms for edit distance between unordered trees |
Journal of Discrete Algorithms, 25, 79-93 |
Journal of Discrete Algorithms, 25, 79-93 |
Journal of Discrete Algorithms, 25, 79-93 |
2014/03 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Wei Lu, Takeyuki Tamura, Jiangning Song, Tatsuya Akutsu |
Wei Lu, Takeyuki Tamura, Jiangning Song, Tatsuya Akutsu |
Wei Lu, Takeyuki Tamura, Jiangning Song, Tatsuya Akutsu |
Integer Programming-Based Method for Designing Synthetic Metabolic Networks by Minimum Reaction Insertion in a Boolean Model |
Integer Programming-Based Method for Designing Synthetic Metabolic Networks by Minimum Reaction Insertion in a Boolean Model |
Integer Programming-Based Method for Designing Synthetic Metabolic Networks by Minimum Reaction Insertion in a Boolean Model |
PLOS ONE, 9, 3, e92637 |
PLOS ONE, 9, 3, e92637 |
PLOS ONE, 9, 3, e92637 |
2014/03 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura |
On the Parameterized Complexity of Associative and Commutative Unification |
On the Parameterized Complexity of Associative and Commutative Unification |
On the Parameterized Complexity of Associative and Commutative Unification |
PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 8894, 15-27 |
PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 8894, 15-27 |
PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 8894, 15-27 |
2014 |
|
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura |
On the Parameterized Complexity of Associative and Commutative Unification |
On the Parameterized Complexity of Associative and Commutative Unification |
On the Parameterized Complexity of Associative and Commutative Unification |
PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 8894, 15-27 |
PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 8894, 15-27 |
PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 8894, 15-27 |
2014 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Yushan Qiu, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
Yushan Qiu, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
Yushan Qiu, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
On control of singleton attractors in multiple Boolean networks: integer programming-based method  |
On control of singleton attractors in multiple Boolean networks: integer programming-based method  |
On control of singleton attractors in multiple Boolean networks: integer programming-based method  |
BMC SYSTEMS BIOLOGY, 8, S1:S7, S7 |
BMC SYSTEMS BIOLOGY, 8, S1:S7, S7 |
BMC SYSTEMS BIOLOGY, 8, S1:S7, S7 |
2014/01 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Hao Jiang, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
Hao Jiang, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
Hao Jiang, Takeyuki Tamura, Wai-Ki Ching, Tatsuya Akutsu |
On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors |
On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors |
On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E96A, 11, 2265-2274 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E96A, 11, 2265-2274 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E96A, 11, 2265-2274 |
2013/11 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Kazuhiro Takemoto, Takeyuki Tamura, Tatsuya Akutsu |
Kazuhiro Takemoto, Takeyuki Tamura, Tatsuya Akutsu |
Kazuhiro Takemoto, Takeyuki Tamura, Tatsuya Akutsu |
Theoretical estimation of metabolic network robustness against multiple reaction knockouts using branching process approximation |
Theoretical estimation of metabolic network robustness against multiple reaction knockouts using branching process approximation |
Theoretical estimation of metabolic network robustness against multiple reaction knockouts using branching process approximation |
Physica A: Statistical Mechanics and its Applications, 392, 21, 5525-5535 |
Physica A: Statistical Mechanics and its Applications, 392, 21, 5525-5535 |
Physica A: Statistical Mechanics and its Applications, 392, 21, 5525-5535 |
2013/11/01 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Yang Zhao, Takeyuki Tamura, Tatsuya Akutsu, Jean-Philippe Vert |
Yang Zhao, Takeyuki Tamura, Tatsuya Akutsu, Jean-Philippe Vert |
Yang Zhao, Takeyuki Tamura, Tatsuya Akutsu, Jean-Philippe Vert |
Flux balance impact degree: a new definition of impact degree to properly treat reversible reactions in metabolic networks  |
Flux balance impact degree: a new definition of impact degree to properly treat reversible reactions in metabolic networks  |
Flux balance impact degree: a new definition of impact degree to properly treat reversible reactions in metabolic networks  |
BIOINFORMATICS, 29, 17, 2178-2185 |
BIOINFORMATICS, 29, 17, 2178-2185 |
BIOINFORMATICS, 29, 17, 2178-2185 |
2013/09 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Takeyuki Tamura |
Tatsuya Akutsu, Takeyuki Tamura |
Tatsuya Akutsu, Takeyuki Tamura |
A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded Degree  |
A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded Degree  |
A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded Degree  |
Algorithms, 6, 1, 119-135 |
Algorithms, 6, 1, 119-135 |
Algorithms, 6, 1, 119-135 |
2013 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu |
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu |
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu |
On the complexity of finding a largest common subtree of bounded degree |
On the complexity of finding a largest common subtree of bounded degree |
On the complexity of finding a largest common subtree of bounded degree |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8070, 4-15 |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8070, 4-15 |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8070, 4-15 |
2013 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Xi Chen, Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching |
Xi Chen, Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching |
Xi Chen, Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching |
Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming |
Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming |
Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming |
INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS, 7, 3, 322-343 |
INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS, 7, 3, 322-343 |
INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS, 7, 3, 322-343 |
2013 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Yang Zhao, Morihiro Hayashida, Takeyuki Tamura |
Tatsuya Akutsu, Yang Zhao, Morihiro Hayashida, Takeyuki Tamura |
Tatsuya Akutsu, Yang Zhao, Morihiro Hayashida, Takeyuki Tamura |
Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks  |
Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks  |
Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks  |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E95D, 12, 2960-2970 |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E95D, 12, 2960-2970 |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E95D, 12, 2960-2970 |
2012/12 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Yang Zhao, Morihiro Hayashida, Takeyuki Tamura |
Tatsuya Akutsu, Yang Zhao, Morihiro Hayashida, Takeyuki Tamura |
Tatsuya Akutsu, Yang Zhao, Morihiro Hayashida, Takeyuki Tamura |
Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks  |
Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks  |
Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks  |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E95D, 12, 2960-2970 |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E95D, 12, 2960-2970 |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E95D, 12, 2960-2970 |
2012/12 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu |
Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu |
Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu |
A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees  |
A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees  |
A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees  |
JOURNAL OF COMPUTATIONAL BIOLOGY, 19, 10, 1089-1104 |
JOURNAL OF COMPUTATIONAL BIOLOGY, 19, 10, 1089-1104 |
JOURNAL OF COMPUTATIONAL BIOLOGY, 19, 10, 1089-1104 |
2012/10 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura |
Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura |
Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura |
Finding a Periodic Attractor of a Boolean Network  |
Finding a Periodic Attractor of a Boolean Network  |
Finding a Periodic Attractor of a Boolean Network  |
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 9, 5, 1410-1421 |
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 9, 5, 1410-1421 |
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 9, 5, 1410-1421 |
2012/09 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura |
Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura |
Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura |
Finding a Periodic Attractor of a Boolean Network  |
Finding a Periodic Attractor of a Boolean Network  |
Finding a Periodic Attractor of a Boolean Network  |
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 9, 5, 1410-1421 |
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 9, 5, 1410-1421 |
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 9, 5, 1410-1421 |
2012/09 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura |
Singleton and 2-periodic attractors of sign-definite Boolean networks |
Singleton and 2-periodic attractors of sign-definite Boolean networks |
Singleton and 2-periodic attractors of sign-definite Boolean networks |
INFORMATION PROCESSING LETTERS, 112, 1-2, 35-38 |
INFORMATION PROCESSING LETTERS, 112, 1-2, 35-38 |
INFORMATION PROCESSING LETTERS, 112, 1-2, 35-38 |
2012/01 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Kazuhiro Takemoto, Takeyuki Tamura, Yang Cong, Wai-Ki Ching, Jean-Philippe Vert, Tatsuya Akutsu |
Kazuhiro Takemoto, Takeyuki Tamura, Yang Cong, Wai-Ki Ching, Jean-Philippe Vert, Tatsuya Akutsu |
Kazuhiro Takemoto, Takeyuki Tamura, Yang Cong, Wai-Ki Ching, Jean-Philippe Vert, Tatsuya Akutsu |
Analysis of the impact degree distribution in metabolic networks using branching process approximation  |
Analysis of the impact degree distribution in metabolic networks using branching process approximation  |
Analysis of the impact degree distribution in metabolic networks using branching process approximation  |
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 391, 1-2, 379-387 |
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 391, 1-2, 379-387 |
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 391, 1-2, 379-387 |
2012/01 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamura |
Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamura |
Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamura |
Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment |
Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment |
Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment |
PATTERN RECOGNITION IN BIOINFORMATICS, 7632, 233-242 |
PATTERN RECOGNITION IN BIOINFORMATICS, 7632, 233-242 |
PATTERN RECOGNITION IN BIOINFORMATICS, 7632, 233-242 |
2012 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Tatsuya Akutsu, Takeyuki Tamura |
Tatsuya Akutsu, Takeyuki Tamura |
T. Akutsu, T. Tamura |
A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree. |
A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree. |
A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree |
Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, 7464 LNCS, 76-87 |
Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, 7464 LNCS, 76-87 |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7464 LNCS, 76-87 |
2012 |
有 |
英語 |
|
公開 |
Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu |
Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu |
Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu |
Efficient exponential time algorithms for edit distance between unordered trees |
Efficient exponential time algorithms for edit distance between unordered trees |
Efficient exponential time algorithms for edit distance between unordered trees |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7354, 360-372 |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7354, 360-372 |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7354, 360-372 |
2012 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Natsu Nakajima, Takeyuki Tamura, Yoshihiro Yamanishi, Katsuhisa Horimoto, Tatsuya Akutsu |
Natsu Nakajima, Takeyuki Tamura, Yoshihiro Yamanishi, Katsuhisa Horimoto, Tatsuya Akutsu |
Natsu Nakajima, Takeyuki Tamura, Yoshihiro Yamanishi, Katsuhisa Horimoto, Tatsuya Akutsu |
Network Completion Using Dynamic Programming and Least-Squares Fitting  |
Network Completion Using Dynamic Programming and Least-Squares Fitting  |
Network Completion Using Dynamic Programming and Least-Squares Fitting  |
SCIENTIFIC WORLD JOURNAL, 2012, 957620 |
SCIENTIFIC WORLD JOURNAL, 2012, 957620 |
SCIENTIFIC WORLD JOURNAL, 2012, 957620 |
2012 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Takeyuki Tamura |
Tatsuya Akutsu, Takeyuki Tamura |
Tatsuya Akutsu, Takeyuki Tamura |
On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree |
On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree |
On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree |
ALGORITHMS AND COMPUTATION, ISAAC 2012, 7676, 146-155 |
ALGORITHMS AND COMPUTATION, ISAAC 2012, 7676, 146-155 |
ALGORITHMS AND COMPUTATION, ISAAC 2012, 7676, 146-155 |
2012 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura |
Singleton and 2-periodic attractors of sign-definite Boolean networks |
Singleton and 2-periodic attractors of sign-definite Boolean networks |
Singleton and 2-periodic attractors of sign-definite Boolean networks |
INFORMATION PROCESSING LETTERS, 112, 1-2, 35-38 |
INFORMATION PROCESSING LETTERS, 112, 1-2, 35-38 |
INFORMATION PROCESSING LETTERS, 112, 1-2, 35-38 |
2012/01 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Takeyuki Tamura, Yang Cong, Tatsuya Akutsu, Wai-Ki Ching |
Takeyuki Tamura, Yang Cong, Tatsuya Akutsu, Wai-Ki Ching |
Takeyuki Tamura, Yang Cong, Tatsuya Akutsu, Wai-Ki Ching |
An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles |
An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles |
An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 12, 2393-2399 |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 12, 2393-2399 |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 12, 2393-2399 |
2011/12 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto |
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions  |
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions  |
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions  |
JOURNAL OF COMPUTATIONAL BIOLOGY, 18, 10, 1275-1290 |
JOURNAL OF COMPUTATIONAL BIOLOGY, 18, 10, 1275-1290 |
JOURNAL OF COMPUTATIONAL BIOLOGY, 18, 10, 1275-1290 |
2011/10 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto |
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto |
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions  |
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions  |
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions  |
JOURNAL OF COMPUTATIONAL BIOLOGY, 18, 10, 1275-1290 |
JOURNAL OF COMPUTATIONAL BIOLOGY, 18, 10, 1275-1290 |
JOURNAL OF COMPUTATIONAL BIOLOGY, 18, 10, 1275-1290 |
2011/10 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu |
Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu |
Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu |
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures |
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures |
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures |
BMC BIOINFORMATICS, 12 |
BMC BIOINFORMATICS, 12 |
BMC BIOINFORMATICS, 12 |
2011/02 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu, Takeyuki Tamura |
Exact algorithms for computing the tree edit distance between unordered trees  |
Exact algorithms for computing the tree edit distance between unordered trees  |
Exact algorithms for computing the tree edit distance between unordered trees  |
THEORETICAL COMPUTER SCIENCE, 412, 4-5, 352-364 |
THEORETICAL COMPUTER SCIENCE, 412, 4-5, 352-364 |
THEORETICAL COMPUTER SCIENCE, 412, 4-5, 352-364 |
2011/02 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu, Takeyuki Tamura |
Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu, Takeyuki Tamura |
Exact algorithms for computing the tree edit distance between unordered trees  |
Exact algorithms for computing the tree edit distance between unordered trees  |
Exact algorithms for computing the tree edit distance between unordered trees  |
THEORETICAL COMPUTER SCIENCE, 412, 4-5, 352-364 |
THEORETICAL COMPUTER SCIENCE, 412, 4-5, 352-364 |
THEORETICAL COMPUTER SCIENCE, 412, 4-5, 352-364 |
2011/02 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu |
Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu |
Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu |
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures |
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures |
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures |
BMC BIOINFORMATICS, 12, S-1, S13 |
BMC BIOINFORMATICS, 12, S-1, S13 |
BMC BIOINFORMATICS, 12, S-1, S13 |
2011/02 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
J. B. Brown, Takashi Urata, Takeyuki Tamura, Midori A. Arai, Takeo Kawabata, Tatsuya Akutsu |
J. B. Brown, Takashi Urata, Takeyuki Tamura, Midori A. Arai, Takeo Kawabata, Tatsuya Akutsu |
J. B. Brown, Takashi Urata, Takeyuki Tamura, Midori A. Arai, Takeo Kawabata, Tatsuya Akutsu |
COMPOUND ANALYSIS VIA GRAPH KERNELS INCORPORATING CHIRALITY  |
COMPOUND ANALYSIS VIA GRAPH KERNELS INCORPORATING CHIRALITY  |
COMPOUND ANALYSIS VIA GRAPH KERNELS INCORPORATING CHIRALITY  |
JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 8, 63-81 |
JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 8, 63-81 |
JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 8, 63-81 |
2010/12 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks |
Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks |
Exact Algorithms for Finding a Minimum Reaction Cut under a Boolean Model of Metabolic Networks |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E93A, 8, 1497-1507 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E93A, 8, 1497-1507 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E93A, 8, 1497-1507 |
2010/08 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu |
Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu |
Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu |
Determining a singleton attractor of an AND/OR Boolean network in O(1.587(n)) time |
Determining a singleton attractor of an AND/OR Boolean network in O(1.587(n)) time |
Determining a singleton attractor of an AND/OR Boolean network in O(1.587(n)) time |
INFORMATION PROCESSING LETTERS, 110, 14-15, 565-569 |
INFORMATION PROCESSING LETTERS, 110, 14-15, 565-569 |
INFORMATION PROCESSING LETTERS, 110, 14-15, 565-569 |
2010/07 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu |
Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu |
Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu |
Determining a singleton attractor of an AND/OR Boolean network in O(1.587(n)) time |
Determining a singleton attractor of an AND/OR Boolean network in O(1.587(n)) time |
Determining a singleton attractor of an AND/OR Boolean network in O(1.587(n)) time |
INFORMATION PROCESSING LETTERS, 110, 14-15, 565-569 |
INFORMATION PROCESSING LETTERS, 110, 14-15, 565-569 |
INFORMATION PROCESSING LETTERS, 110, 14-15, 565-569 |
2010/07 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Takeyuki Tamura, Kazuhiro Takemoto, Tatsuya Akutsu |
Takeyuki Tamura, Kazuhiro Takemoto, Tatsuya Akutsu |
Takeyuki Tamura, Kazuhiro Takemoto, Tatsuya Akutsu |
Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets. |
Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets. |
Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets. |
IJKDB, 1, 1, 14-31 |
IJKDB, 1, 1, 14-31 |
IJKDB, 1, 1, 14-31 |
2010 |
有 |
|
|
公開 |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Exact algorithms for finding a minimum reaction cut under a Boolean model of metabolic networks |
Exact algorithms for finding a minimum reaction cut under a Boolean model of metabolic networks |
Exact algorithms for finding a minimum reaction cut under a Boolean model of metabolic networks |
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E93-A, 8, 1497-1507 |
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E93-A, 8, 1497-1507 |
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E93-A, 8, 1497-1507 |
2010 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
M. Hayashida, T. Tamura, T. Akutsu, W. -K. Ching, Y. Cong |
M. Hayashida, T. Tamura, T. Akutsu, W. -K. Ching, Y. Cong |
M. Hayashida, T. Tamura, T. Akutsu, W. -K. Ching, Y. Cong |
Distribution and enumeration of attractors in probabilistic Boolean networks |
Distribution and enumeration of attractors in probabilistic Boolean networks |
Distribution and enumeration of attractors in probabilistic Boolean networks |
IET SYSTEMS BIOLOGY, 3, 6, 465-474 |
IET SYSTEMS BIOLOGY, 3, 6, 465-474 |
IET SYSTEMS BIOLOGY, 3, 6, 465-474 |
2009/11 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Tatsuya Akutsu, Takeyuki Tamura |
Tatsuya Akutsu, Takeyuki Tamura |
Tatsuya Akutsu, Takeyuki Tamura |
On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2 |
On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2 |
On Finding a Fixed Point in a Boolean Network with Maximum Indegree 2 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A, 8, 1771-1778 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A, 8, 1771-1778 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A, 8, 1771-1778 |
2009/08 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks  |
Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks  |
Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks  |
Mathematics in Computer Science, 2, 3, 401-420 |
Mathematics in Computer Science, 2, 3, 401-420 |
Mathematics in Computer Science, 2, 3, 401-420 |
2009/03 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms |
Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms |
Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A, 2, 493-501 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A, 2, 493-501 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A, 2, 493-501 |
2009/02 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms |
Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms |
Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A, 2, 493-501 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A, 2, 493-501 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E92A, 2, 493-501 |
2009/02 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
T. Akutsu, T. Tamura, K. Horimoto |
T. Akutsu, T. Tamura, K. Horimoto |
T. Akutsu, T. Tamura, K. Horimoto |
Completing networks using observed data |
Completing networks using observed data |
Completing networks using observed data |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5809 LNAI, 126-140 |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5809 LNAI, 126-140 |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5809 LNAI, 126-140 |
2009 |
有 |
英語 |
|
公開 |
Takeyuki Tamura, Hiro Ito |
Takeyuki Tamura, Hiro Ito |
Takeyuki Tamura, Hiro Ito |
Inferring pedigree graphs from genetic distances  |
Inferring pedigree graphs from genetic distances  |
Inferring pedigree graphs from genetic distances  |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E91D, 2, 162-169 |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E91D, 2, 162-169 |
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E91D, 2, 162-169 |
2008/02 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
An improved algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes |
An improved algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes |
An improved algorithm for detecting a singleton attractor in a Boolean network consisting of AND/OR nodes |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5147, 216-229 |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5147, 216-229 |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5147, 216-229 |
2008 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamura |
Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamura |
Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamura |
Algorithms for inference, analysis and control of Boolean networks |
Algorithms for inference, analysis and control of Boolean networks |
Algorithms for inference, analysis and control of Boolean networks |
ALGEBRAIC BIOLOGY, PROCEEDINGS, 5147, 1-15 |
ALGEBRAIC BIOLOGY, PROCEEDINGS, 5147, 1-15 |
ALGEBRAIC BIOLOGY, PROCEEDINGS, 5147, 1-15 |
2008 |
有 |
英語 |
研究論文(国際会議プロシーディングス) |
公開 |
Takeyuki Tamura, Morihiro Hayashida, Tatsuya Akutsu, Shu-Qin Zhang, Wai-Ki Ching |
Takeyuki Tamura, Morihiro Hayashida, Tatsuya Akutsu, Shu-Qin Zhang, Wai-Ki Ching |
Takeyuki Tamura, Morihiro Hayashida, Tatsuya Akutsu, Shu-Qin Zhang, Wai-Ki Ching |
Algorithms and complexity analyses for control of singleton attractors in Boolean networks  |
Algorithms and complexity analyses for control of singleton attractors in Boolean networks  |
Algorithms and complexity analyses for control of singleton attractors in Boolean networks  |
Eurasip Journal on Bioinformatics and Systems Biology, 2008 |
Eurasip Journal on Bioinformatics and Systems Biology, 2008 |
Eurasip Journal on Bioinformatics and Systems Biology, 2008 |
2008 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Subcellular location prediction of proteins using support vector machines with alignment of block sequences utilizing amino acid composition  |
Subcellular location prediction of proteins using support vector machines with alignment of block sequences utilizing amino acid composition  |
Subcellular location prediction of proteins using support vector machines with alignment of block sequences utilizing amino acid composition  |
BMC BIOINFORMATICS, 8 |
BMC BIOINFORMATICS, 8 |
BMC BIOINFORMATICS, 8 |
2007/11 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Takeyuki Tamura, Tatsuya Akutsu |
Approximation algorithms for optimal RNA secondary structures common to multiple sequences |
Approximation algorithms for optimal RNA secondary structures common to multiple sequences |
Approximation algorithms for optimal RNA secondary structures common to multiple sequences |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 917-923 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 917-923 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 917-923 |
2007/05 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Hiro Ito, Kazuo Iwama, Tamura Takeyuki |
Hiro Ito, Kazuo Iwama, Tamura Takeyuki |
Hiro Ito, Kazuo Iwama, Tamura Takeyuki |
Efficient methods for determining DNA probe orders |
Efficient methods for determining DNA probe orders |
Efficient methods for determining DNA probe orders |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A, 5, 1292-1298 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A, 5, 1292-1298 |
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A, 5, 1292-1298 |
2006/05 |
有 |
英語 |
研究論文(学術雑誌) |
公開 |
Avraham Melkman, Takeyuki Tamura, Tatsuya Akutsu |
Avraham Melkman, Takeyuki Tamura, Tatsuya Akutsu |
Avraham Melkman, Takeyuki Tamura, Tatsuya Akutsu |
Determining a singleton attractor of an AND/OR Boolean network in O(1.587^n) time. Information Processing Letters, Vol. 110, pp. 565-569, 2010. |
Determining a singleton attractor of an AND/OR Boolean network in O(1.587^n) time. Information Processing Letters, Vol. 110, pp. 565-569, 2010. |
Determining a singleton attractor of an AND/OR Boolean network in O(1.587^n) time. Information Processing Letters, Vol. 110, pp. 565-569, 2010. |
, , |
, , |
, , |
|
有 |
英語 |
|
公開 |
Tatsuya Akutsu, Avraham. A. Melkman, Takeyuki Tamura, Masaki Yamamoto |
Tatsuya Akutsu, Avraham. A. Melkman, Takeyuki Tamura, Masaki Yamamoto |
Tatsuya Akutsu, Avraham. A. Melkman, Takeyuki Tamura, Masaki Yamamoto |
Journal of Computational Biology, Determining a singleton attractor of a Boolean network with nested canalyzing functions, Vol. 18(0), pp. 1--16, 2011. |
Journal of Computational Biology, Determining a singleton attractor of a Boolean network with nested canalyzing functions, Vol. 18(0), pp. 1--16, 2011. |
Journal of Computational Biology, Determining a singleton attractor of a Boolean network with nested canalyzing functions, Vol. 18(0), pp. 1--16, 2011. |
, , |
, , |
, , |
|
有 |
英語 |
|
公開 |
Takeyuki Tamura, Yang Cong, Tatsuya Akutsu, Wai-Ki Ching |
Takeyuki Tamura, Yang Cong, Tatsuya Akutsu, Wai-Ki Ching |
Takeyuki Tamura, Yang Cong, Tatsuya Akutsu, Wai-Ki Ching |
An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles, IEICE Transactions on Information and Systems, Vol.E94-D, No.12 pp.2393-2399, 2011. |
An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles, IEICE Transactions on Information and Systems, Vol.E94-D, No.12 pp.2393-2399, 2011. |
An Efficient Method of Computing Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles, IEICE Transactions on Information and Systems, Vol.E94-D, No.12 pp.2393-2399, 2011. |
, , |
, , |
, , |
|
有 |
英語 |
|
公開 |
Xi Chen, Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching |
Xi Chen, Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching |
Xi Chen, Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching |
Finding optimal control policy in probabilistic Boolean networks with hard constraints by using integer programming and dynamic programming(Preliminary version has appeared in BIBM 2010), International Journal of Data Mining and Bioinformatics, in press. |
Finding optimal control policy in probabilistic Boolean networks with hard constraints by using integer programming and dynamic programming(Preliminary version has appeared in BIBM 2010), International Journal of Data Mining and Bioinformatics, in press. |
Finding optimal control policy in probabilistic Boolean networks with hard constraints by using integer programming and dynamic programming(Preliminary version has appeared in BIBM 2010), International Journal of Data Mining and Bioinformatics, in press. |
, , |
, , |
, , |
|
有 |
英語 |
|
公開 |
Morihiro Hayashida, Takeyuki Tamura, Tatsuya Akutsu, Wai-Ki Ching, Yang Cong |
Morihiro Hayashida, Takeyuki Tamura, Tatsuya Akutsu, Wai-Ki Ching, Yang Cong |
Morihiro Hayashida, Takeyuki Tamura, Tatsuya Akutsu, Wai-Ki Ching, Yang Cong |
On Distribution and Enumeration of Attractors in Probabilistic Boolean Networks,IET Systems Biology, Vol. 3, pp. 465-474, (Preliminary version has appeared in OSB 2008) 2009. |
On Distribution and Enumeration of Attractors in Probabilistic Boolean Networks,IET Systems Biology, Vol. 3, pp. 465-474, (Preliminary version has appeared in OSB 2008) 2009. |
On Distribution and Enumeration of Attractors in Probabilistic Boolean Networks,IET Systems Biology, Vol. 3, pp. 465-474, (Preliminary version has appeared in OSB 2008) 2009. |
, , |
, , |
, , |
|
有 |
英語 |
|
公開 |
Takeyuki Tamura, Kazuhiro Takemoto, Tatsuya Akutsu |
Takeyuki Tamura, Kazuhiro Takemoto, Tatsuya Akutsu |
Takeyuki Tamura, Kazuhiro Takemoto, Tatsuya Akutsu |
Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets.International Journal of Knowledge Discovery in Bioinformatics, Vol 1, pp. 14-31, (Preliminary version has appeared in IIBM2009)20 |
Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets.International Journal of Knowledge Discovery in Bioinformatics, Vol 1, pp. 14-31, (Preliminary version has appeared in IIBM2009)20 |
Finding Minimum Reaction Cuts of Metabolic Networks Under a Boolean Model Using Integer Programming and Feedback Vertex Sets.International Journal of Knowledge Discovery in Bioinformatics, Vol 1, pp. 14-31, (Preliminary version has appeared in IIBM2009)20 |
, , |
, , |
, , |
|
有 |
英語 |
|
公開 |
田村 武幸 |
田村 武幸 |
TAMURA Takeyuki |
Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree |
Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree |
International Journal of Foundations of Computer Science |
International Journal of Foundations of Computer Science |
International Journal of Foundations of Computer Science |
International Journal of Foundations of Computer Science |
|
有 |
英語 |
研究論文(学術雑誌) |
公開 |