Optimal mappings with minimum number of connected components in tree-to-tree comparison problems

DOI10.1016/S0196-6774(03)00079-8zbMATH Open1091.68556OpenAlexW1996428577MaRDI QIDQ4458886FDOQ4458886

Authors: Pascal Ferraro, Christophe Godin 

Publication date: 14 March 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(03)00079-8

Recommendations

• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• New algorithm for ordered tree-to-tree correction problem
• Comparing similar ordered trees in linear-time
• Alignment of trees -- an alternative to tree edit
• scientific article; zbMATH DE number 1305084

zbMATH Keywords

minimum cost mapping

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (4)

• A dynamic programming algorithm for the tree mapping problem
• Tai mapping hierarchy for rooted labeled trees through common subforest
• Comparison methods for branching and axillary flowering sequences
• Compactness-preserving mapping on trees

This page was built for publication: Optimal mappings with minimum number of connected components in tree-to-tree comparison problems

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