Semi-parametric Markov Tree for cell lineage analysis
Abstract
An enlarged family of hidden Markov out-tree models is introduced. Unlike state-of-the-art hidden Markov out-tree models, in these models child vertices are not independent given their parent vertex, and the number of children per parent is random. The upward-downward smoothing algorithm, which in particular is used to implement efficiently the E-step in the EM algorithm, and the dynamic programming algorithm which is used to restore of the most probable state tree, are derived for this family of models. The advantage of such models is illustrated on cell lineages in floral meristems where non-parametric generation distributions are coupled with parametric observation models in order to define semi-parametric hidden Markov out-tree models.
| Format | Figure, Image |
|---|---|
| Origin | Files produced by the author(s) |