Markov chain Monte Carlo for the reconstruction of lineage trees from single-cell DNA data
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/175073
Tipus de documentTreball Final de Grau
Data2019-07
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
The purpose of this study is to infer evolutionary trees through the Markov chain Monte Carlo algorithm (MCMC) based on whole genome single-cell DNA sequencing data.
By using MCMC we obtain likely tree structure samples according to the cells' somatic point mutations in our data. This probabilistic framework takes into consideration the errors caused by the current technology such as amplification errors, sequencing errors and allelic dropouts.
We investigated whether using this technique is reasonable given this biological scope. Most of the results give interesting conclusions that improve the previous results on the same Site Pair Model and therefore we conclude that using MCMC is reasonable. Though, since the model is based on probabilities and the algorithm randomizes decisions the best results are not always guaranteed. One needs to be aware that a decent amount of data in the data set is an important requisite to predict accurate tree structures. Furthermore, the computational time for this process is significantly high and can not be computed on regular laptops for large and realistic data sets. This is acceptable since for this type of research speed is not a strict requi
TitulacióGRAU EN ENGINYERIA INFORMÀTICA/GRAU EN MATEMÀTIQUES
Localització
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
TFG_IrisBalc_zarCastell.pdf | 1,391Mb | Visualitza/Obre |