| Presentation | 2004-09-17 Fast Algorithms for Comparison of Similar Unordered Trees Daiji FUKAGAWA, Tatsuya AKUTSU, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We present fast algorithms for computing the largest common subtree (LOST) and for computing optimal alignment when two similar unordered trees are given. We present an O(4^Kn) time algorithm for the LCST problem for rooted trees, where n is the maximum size of two input trees and K is the minimum number of edit operations to obtain LCST. We extend this algorithm to unrooted trees and obtain an O(K4^Kn) time algorithm. We also show that the alignment problem in rooted and unordered trees of bounded degree can be solved in linear time if K is bounded by a constant. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | graph algorithm / largest common subtree / tree alignment / edit distance |
| Paper # | COMP2004-30 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2004/9/10(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Fast Algorithms for Comparison of Similar Unordered Trees |
| Sub Title (in English) | |
| Keyword(1) | graph algorithm |
| Keyword(2) | largest common subtree |
| Keyword(3) | tree alignment |
| Keyword(4) | edit distance |
| 1st Author's Name | Daiji FUKAGAWA |
| 1st Author's Affiliation | Graduate School of Informatics, Kyoto University() |
| 2nd Author's Name | Tatsuya AKUTSU |
| 2nd Author's Affiliation | Bioinformatics Center, Institute for Chemical Research, Kyoto University |
| Date | 2004-09-17 |
| Paper # | COMP2004-30 |
| Volume (vol) | vol.104 |
| Number (no) | 317 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |