Computing the Variations of Edit Distance for Rooted Labaled Caterpillars

Manami Hagihara, Takuya Yoshino, Kouich Hirata

2022

Abstract

In this paper, we pay our attention to top-down distance, LCA-preserving distance and bottom-up distance for rooted labeled caterpillars (caterpillars, for short), as the variations of the edit distance. Here, the top-down distance is the edit distance that the deletion and the insertion are allowed to just leaves, the LCA-preserving distance is one to just either leaves or vertices with one child and the bottom-up distance is one to just the root. Then, we show that the top-down and the bottom-up distances for caterpillars can be computed in O(n) time and the LCA-preserving distance for caterpillars in O(n2) time. Furthermore, we give experimental results of computing these variations for caterpillars in real data.

Paper Citation

in Harvard Style

Hagihara M., Yoshino T. and Hirata K. (2022). Computing the Variations of Edit Distance for Rooted Labaled Caterpillars. In Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-549-4, pages 272-279. DOI: 10.5220/0010826100003122

in Bibtex Style

@conference{icpram22,
author={Manami Hagihara and Takuya Yoshino and Kouich Hirata},
title={Computing the Variations of Edit Distance for Rooted Labaled Caterpillars},
booktitle={Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2022},
pages={272-279},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010826100003122},
isbn={978-989-758-549-4},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - Computing the Variations of Edit Distance for Rooted Labaled Caterpillars
SN - 978-989-758-549-4
AU - Hagihara M.
AU - Yoshino T.
AU - Hirata K.
PY - 2022
SP - 272
EP - 279
DO - 10.5220/0010826100003122