# Dualities in Tree Representations

1 BONSAI - Bioinformatics and Sequence Analysis
Université de Lille, Sciences et Technologies, Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189, CNRS - Centre National de la Recherche Scientifique
Abstract : A characterization of the tree $T^*$ such that $\mathrm{BP}(T^*)=\overleftrightarrow{\mathrm{DFUDS}(T)}$, the reversal of $\mathrm{DFUDS}(T)$ is given. An immediate consequence is a rigorous characterization of the tree $\hat{T}$ such that $\mathrm{BP}(\hat{T})=\mathrm{DFUDS}(T)$. In summary, $\mathrm{BP}$ and $\mathrm{DFUDS}$ are unified within an encompassing framework, which might have the potential to imply future simplifications with regard to queries in $\mathrm{BP}$ and/or $\mathrm{DFUDS}$. Immediate benefits displayed here are to identify so far unnoted commonalities in most recent work on the Range Minimum Query problem, and to provide improvements for the Minimum Length Interval Query problem.
Keywords :
Type de document :
Pré-publication, Document de travail
CPM 2018, extended version. 2018
Domaine :

https://hal.archives-ouvertes.fr/hal-01935566
Contributeur : Rayan Chikhi <>
Soumis le : lundi 26 novembre 2018 - 18:01:16
Dernière modification le : lundi 24 décembre 2018 - 01:15:40

### Identifiants

• HAL Id : hal-01935566, version 1
• ARXIV : 1804.04263

### Citation

Rayan Chikhi, Alexander Schönhuth. Dualities in Tree Representations. CPM 2018, extended version. 2018. 〈hal-01935566〉

### Métriques

Consultations de la notice