Accès chercheur

EEDIS Laboratory

Evolutionary Engineering

and

Distributed Information Systems

Réseaux et Communication

Sécurité et Multimédia

Ingénierie des Connaissances

Data Mining & Web Intelligent

Interopérabilité des Systèmes d’information
& Bases de données

Développement Orienté Service

Lossless Compression of Semi-Ordered Trees


Auteurs:	» Salaheddine HABIBECHE » BEN-NAOUM Farah
Type :	Revue Internationale
Nom du journal :	International Journal of Applied Research in Bioinformatics (IJARB) ISSN: 2640-0324
Volume : 12	Issue: 1	Pages: article 8
Lien : » https://www.igi-global.com/article/lossless-compression-semi-ordered-trees/290341
Publié le :	21-01-2022

In this paper, the authors are interested in the problem of lossless compression of unlabeled semiordered

trees. Semi-ordered trees are a class of trees that present an order between some sibling

while some other siblings are unordered. They offer a wide possibility of applications especially

for the representation of plants architecture. The authors show that these trees present remarkable

compression properties covering those of ordered and unordered trees. To illustrate this approach,

the 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.