Files

149101.pdf (824.77 KB)

Document type

Bachelor thesis

Publication date

2019-06-19

Publication license

cc-by-nc-nd (c) Marc Jordà Mascaró, 2019
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/149101

Dynamic programming and DNA sequence alignment algorithms

Journal Title

Authors

Director/Tutor

Journal ISSN

Volume Title

Related resource

Abstract

[en] The goal of this work is to present dynamic programming, which is a mathematical field that solves optimisation problems based on multistage decisionmaking processes. First, its mathematical foundations are gradually built up based on the theorem of optimality, the functional equation and the principle of optimality. Next, the basic elements of the computational procedure are presented, including its most remarkable advantages and drawbacks in comparison to other more exhaustive computational methods. Finally, several up-to-date problems in bioinformatics are introduced in order to compare DNA and protein sequences, which is useful to find out unknown gene functions and compare the genome of different species. Computer algorithms to solve these problems have been written and attached to this work.

Description

Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Miquel Bosch Gual

Subject

Programació dinàmica, Treballs de fi de grau, ADN, Seqüència d'aminoàcids, Algorismes computacionals

Subject (English)

Dynamic programming, Bachelor's theses, DNA, Amino acid sequence, Computer algorithms

Citation

Collections

Treballs Finals de Grau (TFG) - Matemàtiques

Citation

JORDÀ MASCARÓ, Marc. Dynamic programming and DNA sequence alignment algorithms. [consulted: 8 of June of 2026]. Available at: https://hdl.handle.net/2445/149101

Export metadata

JSON - METS

Share record