Thesis IMPLEMENTACIÓN DE ÁRBOLES CARDINALES COMPACTOS
Loading...
Date
2017
Authors
GONZÁLEZ GÓMEZ, NICOLÁS ANDRÉS
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Esta memoria aborda el área de las estructuras de datos compactas, teniendo como objetivo principal construir un árbol cardinal compacto. Para ello se utilizan secuencias generales que soportan operaciones rank y select.Las estructuras que se estudiarán, con el fin de construir un árbol cardinal compacto son: Golynski, Alphabet Partitioning, Wavelet Tree, Hu_man Shaped Wavelet Tree. Además de estas estructuras, se utilizarán algoritmos de búsqueda como búsqueda lineal y búsqueda binaria. De esta manera se pretende determinar lamejor manera de construir arboles cardinales compactos.
This work is related to succint data structures, having as principal goal to build a cardinal succint tree. To make this posible, are used general sequences, that support operations like rank and select.The structures that are will be study, with the goal to build a cardinal succint tree are: Golynski, Alphabet Partitioning, Wavelet Tree, Human Shaped Wavelet Tree. Besides this structures, are will be used search algorithms like linear search and binary search. In this way, it is intended to determine the best way to build a cardinal succint tree.
This work is related to succint data structures, having as principal goal to build a cardinal succint tree. To make this posible, are used general sequences, that support operations like rank and select.The structures that are will be study, with the goal to build a cardinal succint tree are: Golynski, Alphabet Partitioning, Wavelet Tree, Human Shaped Wavelet Tree. Besides this structures, are will be used search algorithms like linear search and binary search. In this way, it is intended to determine the best way to build a cardinal succint tree.
Description
Catalogado desde la version PDF de la tesis.
Keywords
ARBOLES CARDINALES COMPACTOS , COMPRENSION DE DATOS , ESTRUCTURAS DE DATOS