Heavy Caterpillar Distances for Rooted Labeled Unordered Trees

Nozomi Abe, Takuya Yoshino, Kouich Hirata

Abstract

In this paper, we introduce two heavy caterpillar distances between rooted labeled unordered trees (trees, for short) based on the edit distance between the heavy caterpillars obtained from the heavy paths in trees. Then, we show that the heavy caterpillar distances provide the upper bound of the edit distance for trees, can be computed in quadratic time under the unit cost function and are incomparable with other variations of the edit distance.

Download


Paper Citation


in Harvard Style

Abe N., Yoshino T. and Hirata K. (2020). Heavy Caterpillar Distances for Rooted Labeled Unordered Trees.In Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-397-1, pages 198-204. DOI: 10.5220/0009095801980204


in Bibtex Style

@conference{icpram20,
author={Nozomi Abe and Takuya Yoshino and Kouich Hirata},
title={Heavy Caterpillar Distances for Rooted Labeled Unordered Trees},
booktitle={Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2020},
pages={198-204},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009095801980204},
isbn={978-989-758-397-1},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - Heavy Caterpillar Distances for Rooted Labeled Unordered Trees
SN - 978-989-758-397-1
AU - Abe N.
AU - Yoshino T.
AU - Hirata K.
PY - 2020
SP - 198
EP - 204
DO - 10.5220/0009095801980204