Por favor, use este identificador para citar o enlazar este ítem:
https://hdl.handle.net/10495/15148| Título : | Parallel algorithm for suffix array construction |
| Autor : | Quintero Gómez, Juan David |
| metadata.dc.subject.*: | Algoritmo Algorithms Genética humana Human genetics Tecnología Technology ADN DNA Genes http://aims.fao.org/aos/agrovoc/c_2347 http://aims.fao.org/aos/agrovoc/c_3214 http://vocabularies.unesco.org/thesaurus/concept2024 http://vocabularies.unesco.org/thesaurus/concept10457 http://vocabularies.unesco.org/thesaurus/concept116 |
| Fecha de publicación : | 2019 |
| Resumen : | ABSTRACT: Due to the advances of the so-called Next Generation Sequencing technologies (NGS), the amount of genetic information has been significantly increased and it is expected to continue growing, so there is a need to efficiently storing this type of information and an alternative to solve it, is the compression. In many phases of this process, suffix array is a fundamental part and their construction needs a lot of time. In this degree thesis, an algorithm was designed for the construction of suffix arrays on DNA sequences that combine different techniques and levels of parallelization and contribute to improving the performance in the compression process of this type of data. |
| Aparece en las colecciones: | Ingeniería Electrónica |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| QuinteroJuan_2019_ParallelAlgorithmSuffix.pdf | Trabajo de grado de pregrado | 673.2 kB | Adobe PDF | Visualizar/Abrir |
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons
