Parallel algorithm for suffix array construction

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.

• Autores: Quintero Gómez, Juan David
• Tipo de recurso: Trabajo de grado de pregrado
• Fecha de publicación: 2019
• Institución: Universidad de Antioquia
• Repositorio: Repositorio UdeA
• Idioma: eng
• OAI Identifier: oai:bibliotecadigital.udea.edu.co:10495/15148
• Acceso en línea: http://hdl.handle.net/10495/15148
• Palabra clave: 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
• Rights: openAccess
• License: https://creativecommons.org/licenses/by-nc-nd/4.0/