| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2008-05-13 15:20 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 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | Finding similarities in tree structured data is important for such areas as computational biology, XML databases and image analysis and extensive studies have been done based on the concept of tree edit operations. In this article, we present a polynomial time $1.5h$-approximation algorithm for the problem of finding the largest common sub-tree between two rooted, labeled, and unordered trees of height at most $h$, where a tree $S$ is called a sub-tree of a tree $T$ if $S$ is obtained from $T$ by deletion of some nodes in $T$. This result improves a previous $2h$-approximation algorithm. | |
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | approximation algorithms / edit distance / unordered trees / common subtrees / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 108, no. 29, COMP2008-13, pp. 37-42, May 2008. | |
| Paper # | COMP2008-13 | |
| Date of Issue | 2008-05-06 (COMP) | |
| ISSN | Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 | |
| 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) | |
| Download PDF | COMP2008-13 |
|
| Conference Information | |
| Committee | COMP |
| Conference Date | 2008-05-13 - 2008-05-13 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kyushu Sangyo University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Paper Information | |
| Registration To | COMP |
| Conference Code | 2008-05-COMP |
| Language | English |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Improved approximation of the Largest common Sub-tree of Two Unordered Trees of Bounded Height |
| Sub Title (in English) | |
| Keyword(1) | approximation algorithms |
| Keyword(2) | edit distance |
| Keyword(3) | unordered trees |
| Keyword(4) | common subtrees |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Tatsuya Akutsu |
| 1st Author's Affiliation | Kyoto University (Kyoto Univ.) |
| 2nd Author's Name | Daiji Fukagawa |
| 2nd Author's Affiliation | National Institute of Informatics (NII) |
| 3rd Author's Name | Atsuhiro Takasu |
| 3rd Author's Affiliation | National Institute of Informatics (NII) |
| 4th Author's Name | |
| 4th Author's Affiliation | () |
| 5th Author's Name | |
| 5th Author's Affiliation | () |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2008-05-13 15:20:00 |
| Presentation Time | 35 minutes |
| Registration for | COMP |
| Paper # | COMP2008-13 |
| Volume (vol) | vol.108 |
| Number (no) | no.29 |
| Page | pp.37-42 |
| #Pages | 6 |
| Date of Issue | 2008-05-06 (COMP) |
[Return to Top Page]