MOTIVATION: Recent imaging technologies allow for high-throughput tracking of cells as they migrate, divide, express fluorescent markers and change their morphology. The interpretation of these data requires unbiased, efficient statistical methods that model the dynamics of cell phenotypes. RESULTS: We introduce treeHFM, a probabilistic model which generalizes the theory of hidden Markov models to tree structured data. While accounting for the entire genealogy of a cell, treeHFM categorizes cells according to their primary phenotypic features. It models all relevant events in a cell's life, including cell division, and thereby enables the analysis of event order and cell fate heterogeneity. Simulations show higher accuracy in predicting correct state labels when modeling the more complex, tree-shaped dependency of samples over standard HMM modeling. Applying treeHFM to time lapse images of hematopoietic progenitor cell differentiation, we demonstrate that progenitor cells undergo a well-ordered sequence of differentiation events. AVAILABILITY AND IMPLEMENTATION: The treeHFM is implemented in C++. We provide wrapper functions for the programming languages R (CRAN package, https://CRAN.R-project.org/package=treeHFM) and Matlab (available at Mathworks Central, http://se.mathworks.com/matlabcentral/fileexchange/57575-treehfml). SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

MOTIVATION: For biological pathways, it is common to measure a gene expression time series after various knockdowns of genes that are putatively involved in the process of interest. These interventional time-resolved data are most suitable for the elucidation of dynamic causal relationships in signaling networks. Even with this kind of data it is still a major and largely unsolved challenge to infer the topology and interaction logic of the underlying regulatory network. RESULTS: In this work, we present a novel model-based approach involving Boolean networks to reconstruct small to medium-sized regulatory networks. In particular, we solve the problem of exact likelihood computation in Boolean networks with probabilistic exponential time delays. Simulations demonstrate the high accuracy of our approach. We apply our method to data of Ivanova et al. (2006), where RNA interference knockdown experiments were used to build a network of the key regulatory genes governing mouse stem cell maintenance and differentiation. In contrast to previous analyses of that data set, our method can identify feedback loops and provides new insights into the interplay of some master regulators in embryonic stem cell development. AVAILABILITY AND IMPLEMENTATION: The algorithm is implemented in the statistical language R. Code and documentation are available at Bioinformatics online. CONTACT: [email protected] or [email protected] SUPPLEMENTARY INFORMATION: Supplementary Materials are available at Bioinfomatics online.

Abstract Summary: Standard transcriptomics measures total cellular RNA levels. Our understanding of gene regulation would be greatly improved if we could measure RNA synthesis and decay rates on a genome-wide level. To that end, the Dynamic Transcriptome Analysis (DTA) method has been developed. DTA combines metabolic RNA labeling with standard transcriptomics to measure RNA synthesis and decay rates in a precise and non-perturbing manner. Here, we present the open source R/Bioconductor software package DTA. It implements all required bioinformatics steps that allow the accurate absolute quantification and comparison of RNA turnover. Availability: DTA is part of R/Bioconductor. To download and install DTA refer to http://bioconductor.org/packages/2.10/bioc/html/DTA.html Contact: [email protected]