Caterpillar Inclusion: Inclusion Problem for Rooted Labeled Caterpillars

Tomoya Miyazaki, Manami Hagihara, Kouich Hirata

2022

Abstract

In this paper, we investigate an inclusion problem for rooted labeled caterpillars (resp., caterpillars, for short), which we call a caterpillar inclusion. The caterpillar inclusion is to determine whether or not a text caterpillar T achieves to a pattern caterpillar P by deleting vertices in T. Then, we design the algorithm of the caterpillar inclusion for P and T in O((h + H)σ ) time, where h is the height of P, H is the height of T and σ is the number of labels occurring in P and T. Also we give experimental results for the algorithm by using real data for caterpillars.

Paper Citation

in Harvard Style

Miyazaki T., Hagihara M. and Hirata K. (2022). Caterpillar Inclusion: Inclusion Problem for Rooted Labeled Caterpillars. In Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-549-4, pages 280-287. DOI: 10.5220/0010826300003122

in Bibtex Style

@conference{icpram22,
author={Tomoya Miyazaki and Manami Hagihara and Kouich Hirata},
title={Caterpillar Inclusion: Inclusion Problem for Rooted Labeled Caterpillars},
booktitle={Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2022},
pages={280-287},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010826300003122},
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 - Caterpillar Inclusion: Inclusion Problem for Rooted Labeled Caterpillars
SN - 978-989-758-549-4
AU - Miyazaki T.
AU - Hagihara M.
AU - Hirata K.
PY - 2022
SP - 280
EP - 287
DO - 10.5220/0010826300003122