Algorithmic height compression of unordered trees

DOI10.1016/J.JTBI.2015.10.030MaRDI QIDQ304776zbMATHOpenAlexWikidataFDO

Authors Farah Ben-Naoum, Christophe Godin

Publication date 26 August 2016

Published in Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jtbi.2015.10.030

zbMATH Keywords

branching structuresheight redundancyplants modelingquasi-isomorphismself-nestedness

Mathematics Subject Classification ID

Applications of graph theory (05C90) Plant biology (92C80)

Recommendations

• Tree compression with top trees
• Tree compression with top trees
• TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
• A bisection algorithm for grammar-based compression of ordered trees
• An effective grammar-based compression algorithm for tree structured data.

Cites work

• scientific article; zbMATH DE number 6118217 (Why is no real title available?)
• scientific article; zbMATH DE number 3770441 (Why is no real title available?)
• scientific article; zbMATH DE number 48028 (Why is no real title available?)
• scientific article; zbMATH DE number 194082 (Why is no real title available?)
• scientific article; zbMATH DE number 3550202 (Why is no real title available?)
• scientific article; zbMATH DE number 3436590 (Why is no real title available?)
• Approximating Maximum Clique by Removing Subgraphs
• Reactive local search for the maximum clique problem
• Self-similarity in plants: integrating mathematical and biological perspectives.
• Solving the maximum clique problem using a tabu search approach
• Superfractals

Cited in

(3)

• Lossless Compression of Binary Trees With Correlated Vertex Names
• Compressing branch-and-bound trees
• Approximation of trees by self-nested trees

This page was built for publication: Algorithmic height compression of unordered trees

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