|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
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 |
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 |
2005-01-28 11:20 |
Aichi |
Nagoya University |
Inferring Pedigrees from Genetic Distances Takeyuki Tamura, Hiro Ito, Kazuo Iwama (Kyoto Univ.) |
A phylogenetic tree is a tree data structure which shows
evolutionary interrelationships among species
which are belie... [more] |
COMP2004-64 pp.33-39 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|