Segmental mapping and distance for rooted labeled ordered trees

DOI10.1007/978-3-642-35261-4_51MaRDI QIDQ4909565zbMATH OpenOpenAlexFDO

Authors Tomohiro Kan, Shoichi Higuchi, Kouichi Hirata

Publication date 21 March 2013

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35261-4_51

zbMATH Keywords

algorithmquadratic timesegmental distancesegmental mapping between treesTai mapping between trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Segmental mapping and distance for rooted labeled ordered trees
• Tai mapping hierarchy for rooted labeled trees through common subforest
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• scientific article; zbMATH DE number 1305084
• scientific article; zbMATH DE number 1796978

Cited in

(3)

• Segmental mapping and distance for rooted labeled ordered trees
• A new matching algorithm between trees of shapes and its application to brain tumor segmentation
• Tai mapping hierarchy for rooted labeled trees through common subforest

This page was built for publication: Segmental mapping and distance for rooted labeled ordered trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909565)