Takeyuki Tamura

Co-authors (15)

Conferences (7)

AB

2
CISIS

2
ALT

1
CIKM

1
IFIP TCS

1

Journals (7)

Keywords (81)

Embed

Subscribe

Academic

Takeyuki Tamura

Takeyuki Tamura (田村武幸)

Kyoto University

Publications: 23 | Citations: 34 | G-Index: 4 | H-Index: 4

Interests: Bioinformatics & Computational Biology, Networks & Communications, Algorithms & Theory

Collaborated with 15 co-authors from 2004 to 2011; Cited by 77 authors

Bing

Cumulative Annual

Order by:

Publications (23)

BibTeX | RIS | RefWorks Download

Exact algorithms for computing the tree edit distance between unordered trees (Citations: 2)

Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu, Takeyuki Tamura

Journal: Theoretical Computer Science - TCS , vol. 412, no. 4-5, pp. 352-364, 2011
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures (Citations: 1)

Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu

Journal: BMC Bioinformatics , vol. 12, no. Suppl 1, pp. S13-9, 2011
An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures

Tatsuya Akutsu, Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita

Conference: International Conference on Complex, Intelligent and Software Intensive Systems - CISIS , 2011
Finding optimal control policy in Probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming (Citations: 1)

Xi Chen, Tatsuya Akutsu, Takeyuki Tamura, Wai-Ki Ching

Conference: IEEE International Conference on Bioinformatics and Biomedicine - BIBM , pp. 240-246, 2010
Determining a singleton attractor of an AND/OR Boolean network in O(1.587

Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu

Journal: Information Processing Letters - IPL , vol. 110, no. 14-15, pp. 565-569, 2010

Order by:

Citations (34 times by 26 publications)

MIPLIB 2010 (Citations: 1)

Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans Mittelmannhttp://academic.research.microsoft.com/io.ashx?type=5&id=48797514&selfId1=3519507&selfId2=0&maxNumber=12&query=

Published in 2011.
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures (Citations: 1)

Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu

Journal: BMC Bioinformatics , vol. 12, no. Suppl 1, pp. S13-9, 2011
A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks (Citations: 1)

Elena Dubrova, Maxim Teslenko

Journal: IEEE/ACM Transactions on Computational Biology and Bioinformatics - TCBB , vol. 8, no. 5, pp. 1393-1399, 2011
An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures

Tatsuya Akutsu, Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita

Conference: International Conference on Complex, Intelligent and Software Intensive Systems - CISIS , 2011
SnapShot: Hair Follicle Stem Cells

Wei-Meng Woo, Anthony E. Oro

Journal: Cell , vol. 146, no. 2, pp. 334-334.e2, 2011

Comments