Abstract
In this paper, authors are interested in the problem of lossless compression of unlabeled semi-ordered trees. Semi-ordered trees are a class of trees that present an order between some sibling while some other sibling are unordered. They offer a wide possibility of applications especially for the representation of plants architecture. Authors show that these trees present remarkable compression properties covering those of ordered and unordered trees. To illustrate this approach, authors apply these notions to a particular class of semi-ordered trees which is the most studied branching structure particularly for a botanical motivation, namely axial trees.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Applied Research in Bioinformatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
