Scalable inference of transcriptional kinetic parameters from MS2 time series data

2020 
AO_SCPLOWBSTRACTC_SCPLOWO_ST_ABSMotivationC_ST_ABSThe MS2-McP (MS2 coat protein) live imaging system allows for visualisation of transcription dynamics through the introduction of hairpin stem-loop sequences into a gene. A fluorescent signal at the site of nascent transcription in the nucleus quantifies mRNA production. computational modelling can be used to infer the promoter states along with the kinetic parameters governing transcription, such as promoter switching frequency and polymerase loading rate. However, modelling of the fluorescent trace presents a challenge due its persistence; the observed fluorescence at a given time point depends on both current and previous promoter states. A memory-adjusted Hidden Markov Model (mHMM) was recently introduced to allow inference of promoter activity from MS2-McP data. However, the computational time for inference scales exponentially with gene length and the mHMM is therefore not currently practical for application to many eukaryotic genes. ResultsWe present a scalable implementation of the mHMM for fast inference of promoter activity and transcriptional kinetic parameters. This new method can model genes of arbitrary length through the use of a time-adaptive truncated compound state space. The truncated state space provides a good approximation to the full state space by retaining the most likely set of states at each time during the forward pass of the algorithm. Testing on MS2-MCP fluorescent data collected from early Drosophila melanogaster embryos indicates that the method provides accurate inference of kinetic parameters within a computationally feasible timeframe. The inferred promoter traces generated by the model can also be used to infer single-cell transcriptional parameters. AvailabilityPython implementation available at https://github.com/ManchesterBioinference/burstInfer, along with code to reproduce the examples presented here.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    32
    References
    2
    Citations
    NaN
    KQI
    []