Algorithmic height compression of unordered trees

DOI10.1016/J.JTBI.2015.10.030zbMATH Open1343.92287OpenAlexW2100296510WikidataQ47348530 ScholiaQ47348530MaRDI QIDQ304776FDOQ304776

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

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.

zbMATH Keywords

branching structuresheight redundancyplants modelingquasi-isomorphismself-nestedness

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximating Maximum Clique by Removing Subgraphs
• Superfractals
• Solving the maximum clique problem using a tabu search approach
• Self-similarity in plants: integrating mathematical and biological perspectives.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reactive local search for the maximum clique problem

Cited In (3)

• Approximation of trees by self-nested trees
• Lossless Compression of Binary Trees With Correlated Vertex Names
• Compressing branch-and-bound 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)