Tecnológico de Costa Rica
  • How to publish in Repositorio TEC?
  • Policies
  • Educational Resources
  • Contact us
    • español
    • English
  • English 
    • español
    • English
  • Login
View Item 
  •   Repository Home
  • Trabajos de Graduación
  • Biblioteca José Figueres Ferrer
  • Escuela de Ingeniería en Computación
  • Maestría en Computación
  • View Item
  •   Repository Home
  • Trabajos de Graduación
  • Biblioteca José Figueres Ferrer
  • Escuela de Ingeniería en Computación
  • Maestría en Computación
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesKeywordEducational Resource TypeIntended UserThis CollectionBy Issue DateAuthorsTitlesKeywordEducational Resource TypeIntended User

My Account

LoginRegister

Statistics

View Usage Statistics

Mejoras a los algoritmos de bioinformática Needleman-Wunsch y K-Band mediante la mejora de la matriz de similitud

Thumbnail
View/Open
mejora_algoritmos_bioinformatica.pdf (1.444Mb)
Date
2015
Author
Saborio-Arce, Alonso
Metadata
Show full item record
Abstract
Bioinformatics algorithms are limited by memory and disc management processes due to their large amount of data manipulation, like sequence alignment methods. For example, NeedlemanWunsch algorithm aligns two sequences optimally; it creates a matrix of N rows and M columns, where N and M are the amount of characters each sequence had. Based on the final size of the matrix these problems become restrictive. This thesis’s objective is to set and prove a Needleman-Wunsch algorithm improvement in order to enhance its efficiency. With the fusion of two dynamic programming algorithms and the minimization on the similarity matrix usage the amount of disc and / or memory used by the algorithm will be reduced. The implemented solution is a modification of the K-Band algorithm, which gets the optimal solution parsing the matrix once, differing from its original version that parses it many times. The main feature of the new algorithm is how the band is expanded when the alignment cannot be optimal, that will happen when the parsing is in the border of the band. Some experiments were developed and ran in order to validate the solution created. With the results obtained, it was proved that the proposed improvement of the Needleman-Wunsch algorithm uses the similarity matrix less and improves the memory and disc performance on big sequences
Description
Proyecto de Graduación (Maestría en Computación) Instituto Tecnológico de Costa Rica, Escuela de Ingeniería en Computación, 2015.
URI
https://hdl.handle.net/2238/6707
Share
       
Metrics
Collections
  • Maestría en Computación [108]

|Contact us

Repositorio Institucional del Tecnológico de Costa Rica

Sistema de Bibliotecas del TEC | SIBITEC

© DERECHOS RESERVADOS. Un sitio soportado por DSpace(v. 6.3)

RT-1

 

 


|Contact us

Repositorio Institucional del Tecnológico de Costa Rica

Sistema de Bibliotecas del TEC | SIBITEC

© DERECHOS RESERVADOS. Un sitio soportado por DSpace(v. 6.3)

RT-1