Carregant...
Fitxers
Tipus de document
Treball de fi de grauData de publicació
Llicència de publicació
Si us plau utilitzeu sempre aquest identificador per citar o enllaçar aquest document: https://hdl.handle.net/2445/149101
Dynamic programming and DNA sequence alignment algorithms
Títol de la revista
Autors
Director/Tutor
ISSN de la revista
Títol del volum
Recurs relacionat
Resum
[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.
Descripció
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Miquel Bosch Gual
Matèries (anglès)
Citació
Col·leccions
Citació
JORDÀ MASCARÓ, Marc. Dynamic programming and DNA sequence alignment algorithms. [consulta: 23 de gener de 2026]. [Disponible a: https://hdl.handle.net/2445/149101]