Efficient exponential-time algorithms for edit distance between unordered trees-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Efficient exponential-time algorithms for edit distance between unordered trees

Published:2014-03 Issue: Volume:25 Page:79-93
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Akutsu Tatsuya,Tamura Takeyuki,Fukagawa Daiji,Takasu Atsuhiro

Funder

National Institute for Informatics and Institute for Chemical Research, Kyoto University

JSPS

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference17 articles.

1. Improved approximation of the largest common subtree of two unordered trees of bounded height;Akutsu;Inf. Process. Lett.,2008

2. Exact algorithms for computing the tree edit distance between unordered trees;Akutsu;Theor. Comput. Sci.,2011

3. Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees;Akutsu;Theor. Comput. Sci.,2013

4. A survey on tree edit distance and related problem;Bille;Theor. Comput. Sci.,2005

5. On tree-constrained matchings and generalizations;Canzar,2011

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New and improved algorithms for unordered tree inclusion;Theoretical Computer Science;2021-09

2. Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming;Combinatorial Optimization and Applications;2017

3. Conversion cost and specification on interfaces of key-value stores;Computer Standards & Interfaces;2016-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP