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 2009-06-29 14:05
Approximating Edit Distance of Unordered Trees of Bounded Height
Daiji Fukagawa (NII), Tatsuya Akutsu (Kyoto Univ.), Atsuhiro Takasu (NII) COMP2009-22
Abstract (in Japanese) (See Japanese page) 
(in English) The edit distance problem on two unordered trees is known to be MAX SNP-hard. In this paper, we present an approximation algorithm whose approximation ratio is 2h+2 where h is the maximum height of the two input trees. The algorithm is based on an embedding of tree edit distance into L1 distance, which is well-known in the literature. We also present an efficient implementation of the algorithm using randomized dimension reduction.
Keyword (in Japanese) (See Japanese page) 
(in English) tree edit distance / unordered tree / approximation algorithms / embedding / Karp-Rabin fingerprint / / /  
Reference Info. IEICE Tech. Rep., vol. 109, no. 108, COMP2009-22, pp. 31-36, June 2009.
Paper # COMP2009-22 
Date of Issue 2009-06-22 (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 COMP2009-22

Conference Information
Committee COMP  
Conference Date 2009-06-29 - 2009-06-29 
Place (in Japanese) (See Japanese page) 
Place (in English) Hokkaido University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2009-06-COMP 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Approximating Edit Distance of Unordered Trees of Bounded Height 
Sub Title (in English)  
Keyword(1) tree edit distance  
Keyword(2) unordered tree  
Keyword(3) approximation algorithms  
Keyword(4) embedding  
Keyword(5) Karp-Rabin fingerprint  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Daiji Fukagawa  
1st Author's Affiliation National Institute of Informatics (NII)
2nd Author's Name Tatsuya Akutsu  
2nd Author's Affiliation Kyoto University (Kyoto Univ.)
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 ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2009-06-29 14:05:00 
Presentation Time 35 minutes 
Registration for COMP 
Paper # COMP2009-22 
Volume (vol) vol.109 
Number (no) no.108 
Page pp.31-36 
#Pages
Date of Issue 2009-06-22 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan