haku: @supervisor Aurell, Erik / yhteensä: 13
viite: 6 / 13
Tekijä: | Paul, Debdas |
Työn nimi: | Efficient Parameter Inference for Stochastic Chemical Kinetics |
Julkaisutyyppi: | Diplomityö |
Julkaisuvuosi: | 2014 |
Sivut: | 34 Kieli: eng |
Koulu/Laitos/Osasto: | Perustieteiden korkeakoulu |
Oppiaine: | Computational Systems Biology (IL3013) |
Valvoja: | Lähdesmäki, Harri ; Aurell, Erik |
Ohjaaja: | Engblom, Stefan |
Elektroninen julkaisu: | http://urn.fi/URN:NBN:fi:aalto-201410042708 |
OEVS: | Sähköinen arkistokappale on luettavissa Aalto Thesis Databasen kautta.
Ohje Digitaalisten opinnäytteiden lukeminen Aalto-yliopiston Harald Herlin -oppimiskeskuksen suljetussa verkossaOppimiskeskuksen suljetussa verkossa voi lukea sellaisia digitaalisia ja digitoituja opinnäytteitä, joille ei ole saatu julkaisulupaa avoimessa verkossa. Oppimiskeskuksen yhteystiedot ja aukioloajat: https://learningcentre.aalto.fi/fi/harald-herlin-oppimiskeskus/ Opinnäytteitä voi lukea Oppimiskeskuksen asiakaskoneilla, joita löytyy kaikista kerroksista.
Kirjautuminen asiakaskoneille
Opinnäytteen avaaminen
Opinnäytteen lukeminen
Opinnäytteen tulostus
|
Sijainti: | P1 Ark Aalto 1729 | Arkisto |
Avainsanat: | stochastic chemical kinetics systems biology parameter inference Markov Chain Monte Carlo Chemical Master Equation |
Tiivistelmä (eng): | Parameter inference for stochastic systems is considered as one of the fundamental classical problems in the domain of computational systems biology. The problem becomes challenging and often analytically intractable with the large number of uncertain parameters. In this scenario, Markov Chain Monte Carlo (MCMC) algorithms have been proved to be highly effective. For a stochastic system, the most accurate description of the kinetics is given by the Chemical Master Equation (CME). Unfortunately, analytical solution of CME is often intractable even for considerably small amount of chemically reacting species due to its super exponential state space complexity. As a solution, Stochastic Simulation Algorithm (SSA) using Monte Carlo approach was introduced to simulate the chemical process defined by the CME. SSA is an exact stochastic method to simulate CME but it also suffers from high time complexity due to simulation of every reaction. Therefore computation of likelihood function (based on exact CME) and hence the rejection step (in an acceptance-rejection based MCMC like Metropolis-Hastings) becomes expensive. In this generic work, we introduce different approximations of CME as a pre-conditioning step to the full MCMC in order to make rejection cheaper. The goal is to avoid expensive computation of exact CME as far as possible. We show that, with effective pre-conditioning scheme, one can save a considerable amount of exact CME computations maintaining similar convergence characteristics. Additionally, we investigate three different sampling techniques (dense sampling of the same process, longer time sampling of the same process and i.i.d sampling of different processes) under which convergence of MCMC using exact CME for parameter inference can be analyzed. We find that under i.i.d sampling, better convergence can be achieved than that of other two techniques (atleast for the processes, we have investigated). We verify our theoretical findings for two different fundamental processes: linear birth-death and dimerization. Although, we succeed in saving a considerable amount of CME computations for two simple one-dimesional processes, challenges remain in extending it for higher dimensions which is a non-trivial problem. |
ED: | 2014-10-05 |
INSSI tietueen numero: 49769
+ lisää koriin
INSSI