| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2012-06-21 11:00 |
Hokkaido | Hokkaido University | Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees Tatsuya Akutsu, Takeyuki Tamura (Kyoto Univ.), Daiji Fukagawa (Doshisha Univ.), Atsuhiro Takasu (NII)  COMP2012-15 |
This report presents efficient exponential time algorithms for the unordered tree edit distance problem, which is known ... [more] | COMP2012-15 pp.25-31 |
| COMP | 2009-10-16 14:50 |
Miyagi | Tohoku University | Algorithm for Finding Minimum Reaction Cut of Metabolic Network Takeyuki Tamura (Kyoto Univ.), Kazuhiro Takemoto (Univ. of Tokyo.), Tatsuya Akutsu (Kyoto Univ.) COMP2009-36 |
In this article, we study two problems ReactionCut and MD-ReactionCut for calculating minimum reaction cuts of a metabo... [more] |
COMP2009-36 pp.27-34 |
| MSS | 2009-08-07 10:20 |
Tokyo | JAIST Tokyo Campus | Analyzing Boolean Networks by Using Integer Programming Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamura (Kyoto Univ.) CST2009-17 |
The Boolean network (BN) model is known as a mathematical model of genetic networks and many studies have been done on B... [more] | CST2009-17 pp.31-36 |
| NLP | 2009-08-03 14:00 |
Kochi | A model of bipartite graphs for protein domain networks Tomoshiro Ochiai (Toyama Prefectural Univ.), Jose Nacher (Future Univ-Hakodate), Morihiro Hayashida, Tatsuya Akutsu (Kyoto Univ.) NLP2009-50 |
[more] | NLP2009-50 pp.33-35 |
|
| COMP | 2009-06-29 14:05 |
Hokkaido | Hokkaido University | Approximating Edit Distance of Unordered Trees of Bounded Height Daiji Fukagawa (NII), Tatsuya Akutsu (Kyoto Univ.), Atsuhiro Takasu (NII) COMP2009-22 |
The edit distance problem on two unordered trees is known to be MAX SNP-hard. In this paper, we present an approximation... [more] | COMP2009-22 pp.31-36 |
| COMP | 2008-05-13 15:20 |
Fukuoka | Kyushu Sangyo University | Improved approximation of the Largest common Sub-tree of Two Unordered Trees of Bounded Height Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII) COMP2008-13 |
Finding similarities in tree structured data is important for such areas as computational biology, XML databases and ima... [more] | COMP2008-13 pp.37-42 |
| IT | 2007-11-27 14:50 |
Mie | Kashikojima Hojoen (Shima) | [Invited Talk]
RNA Secondary Structure Prediction Based on Formal Grammars Yuki Kato (Kyoto Univ.), Hiroyuki Seki (NAIST), Tatsuya Akutsu (Kyoto Univ.) IT2007-21 |
Recently, much attention has been paid to RNA secondary structure prediction that applies parsing techniques in formal g... [more] | IT2007-21 pp.7-16 |
| COMP | 2007-05-25 13:20 |
Fukuoka | Kyushu University | An O(1.787^n)-time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes Takeyuki Tamura, Tatsuya Akutsu (Kyoto Univ.) COMP2007-13 |
The Boolean network (BN) is a mathematical model of genetic networks. It is known that detecting a singleton attractor i... [more] | COMP2007-13 pp.13-18 |
| COMP | 2006-05-24 13:00 |
Fukuoka | Kyushu Institute of Technology | Approximating Tree Edit Distance Through String Edit Distance Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII) |
We present a method to transform an ordered and rooted tree of bounded degree into a string, where it is done by computi... [more] | COMP2006-12 pp.17-24 |
| COMP | 2005-04-18 15:15 |
Hyogo | Kwansei Gakuin Univ. | On the Complexity of Inferring a Graph from Path Frequency Tatsuya Akutsu, Daiji Fukagawa (Kyoto Univ.) |
We consider the problem of inferring a graph (and a sequence) from the numbers of occurrences of vertex-labeled paths, w... [more] | COMP2005-7 pp.49-55 |
| MBE | 2004-12-10 15:20 |
Aichi | Nagoya University | Gene expression dynamics and stochastic processes with Markov porperty Tomoshiro Ochiai, Jose Carlos Nacher Diez, Tatsuya Akutsu (Kyoto Univ.) |
[more] | MBE2004-72 pp.21-22 |
| COMP | 2004-09-17 13:45 |
Hokkaido | Hokkaido University | Fast Algorithms for Comparison of Similar Unordered Trees Daiji Fukagawa, Tatsuya Akutsu (Kyoto Univ.) |
We present fast algorithms for computing the largest common subtree (LCST) and for computing optimal alignment when two ... [more] | COMP2004-30 pp.33-40 |
| NLP, CAS | 2004-09-13 13:00 |
Kyoto | Kyoto Univ. | Markov Property on Gene Expression Dynamics Tomoshiro Ochiai, Jose Carlos Nacher Diez, Tatsuya Akutsu (Kyoto Univ.) |
[more] | CAS2004-20 NLP2004-32 pp.1-2 |
[Return to Top Page]