کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
428753 686904 2008 4 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Faster algorithms for guided tree edit distance
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Faster algorithms for guided tree edit distance
چکیده انگلیسی

The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F′ and G′ such that a third input forest H is included in F′ (and G′). The edit operations are relabeling a vertex and deleting a vertex. We show efficient algorithms for this problem that are faster than the previous algorithm for this problem of Peng and Ting [Z. Peng, H. Ting, Guided forest edit distance: Better structure comparisons by using domain-knowledge, in: Proc. 18th Symposium on Combinatorial Pattern Matching (CPM), 2007, pp. 28–39].

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 108, Issue 4, 31 October 2008, Pages 251-254