Volume 17 Supplement 1
Selected articles from the Fourteenth Asia Pacific Bioinformatics Conference (APBC 2016): Genomics
A maximum-likelihood approach for building cell-type trees by lifting
- Nishanth Ulhas Nair^{1},
- Laura Hunter^{2},
- Mingfu Shao^{1},
- Paulina Grnarova^{1},
- Yu Lin^{3},
- Philipp Bucher†^{4, 5} and
- Bernard M. E. Moret†^{1, 5}Email author
Published: 11 January 2016
Abstract
Background
In cell differentiation, a less specialized cell differentiates into a more specialized one, even though all cells in one organism have (almost) the same genome. Epigenetic factors such as histone modifications are known to play a significant role in cell differentiation. We previously introduce cell-type trees to represent the differentiation of cells into more specialized types, a representation that partakes of both ontogeny and phylogeny.
Results
We propose a maximum-likelihood (ML) approach to build cell-type trees and show that this ML approach outperforms our earlier distance-based and parsimony-based approaches. We then study the reconstruction of ancestral cell types; since both ancestral and derived cell types can coexist in adult organisms, we propose a lifting algorithm to infer internal nodes. We present results on our lifting algorithm obtained both through simulations and on real datasets.
Conclusions
We show that our ML-based approach outperforms previously proposed techniques such as distance-based and parsimony-based methods. We show our lifting-based approach works well on both simulated and real data.
Keywords
Cell-type trees Histone modifications Epigenomics Phylogeny Evolution Cell-differentiationBackground
Cell differentiation is the process by which a less specialized cell becomes a more specialized one; it often proceeds in a hierarchical manner, with totipotent cells sequentially committing to fates of more restricted developmental potential [1, 2]. Epigenetic and transcription factors play a significant role in cell differentiation [3–5], therefore motivating a study of epigenetic changes across different cell types.
Arendt [6] proposed a sister-cell-type model for the hierarchical relationship between cell types. In this model [6], “novel cell types arise in pairs (sister cell types) from an ancestral cell type through sub-specialization” [2]. Under this model [6], the evolutionary relatedness of cell types is expected to be congruent with the ontogenetic hierarchy of cellular differentiation, because the “development of the sister cell types is the same up to the last stages of differentiation” [2]. The authors claim that multifunctionality has been a general feature of ancient cell types and that, with “increasing specialization during evolution, these multiple functions were then distributed in a complementary manner to sister cell types” [6].
Evolution and cell differentiation share a number of attributes. First, as mentioned before, we know that cell differentiation transforms less specialized cell types into more specialized ones. Since this transformation is unidirectional, the paths of differentiation can be represented as a tree structure, much as is done with the phylogenetic trees used to represent evolutionary histories [7]. The similarity between the two extends further: cell types themselves have evolved into larger collections from more restricted collections in early ancestors: there are phylogenetic relationships among the various types of cells. Second, observed changes in the epigenetic state are inheritable, again much as mutations in the genome are (although, of course, through very different mechanisms and at very different scales); and finally, epigenetic traits are subject to stochastic changes. One major difference between evolution and cell differentiation is that functional changes in cell differentiation are primarily driven by programmed mutational events rather than by selection. However, the program of mutational events is itself the result of evolution, so that, as observed by [6], the cell differentiation tree often recapitulates the phylogeny of cell types.
We focus here on one important epigenetic mark—histone modification. Histones are proteins that package the DNA into nucleosomes [8]. These proteins are subjected to various types of chemical modifications, called histone modifications, such as methylation, acetylation, phosphorylation, ubiquitination, etc. These modifications alter their interactions with the DNA and thereby influence transcription and genomic function. Histone modifications have been found to vary across cell types and to play an important role in gene regulation [9]. Since histones are present in every 200 bp length of DNA, we need genome-wide high-throughput technologies to study the modifications of these proteins. ChIP-Seq is such a technology [10, 11]. The study of ChIP-Seq histone modification data can help us understand the role of histone modifications in developmental biology and cell differentiation [12].
The term “cell-type tree” was defined by our group to refer to a tree relationship between various cell types [13]. The nodes of this tree represent cell types while the edges represent directed differentiation/evolution events from one cell type to another. We know that the genome is consistent across cell types of the same individual and that it is also highly similar between individuals of the same species, but that epigenomic states of various regions of the genome differ across various cell types. These epigenomic states are believed to affect cell differentiation process through a complex interplay between histone modifications, DNA methylation, transcription factors, etc.
Kin et al. [2] recently constructed a cell-type tree using RNA-Seq data and a parsimony-based approach under assumptions very similar to ours, using the same term of “cell-type tree” to denote the “hypothetical tree-like relationship of cell types in ontogeny and phylogeny”. Liang et al. [14] recently developed a statistical model for cell differentiation and applied it to ENCODE and FANTOM RNA-Seq data. As in Kin et al. work [2], they found that the RNA-Seq data contain significant tree structures. In earlier work [7], we also calculated a statistical measure to show that the distances we computed are in fact representative of a tree. Thus multiple studies on different kinds of datasets—ChIP-Seq in our case, RNA-seq in the other two papers—support the tree-like relationship of cell types and underscore the usefulness of the cell-type tree (as noted in [2]). Prior to these genome-wide computational approaches, hierarchical developmental relationships among cell types were elucidated through a series of laborious experiments involving in vitro differentiation of cell types from various stem cells [15–17].
In cell differentiation, both ancestral and derived cell types can coexist within the body. Therefore, it becomes important to be able to infer which cell types should be treated as the ancestor, or parent, of another. Our earlier work [7, 13] focused on the use of distance-based and parsimony-based phylogenetic methods to infer the tree, not the ancestors. Here we propose an ML approach to the inference of cell-type trees on histone modification data and proceed to derive a new algorithm to infer the internal nodes by a process known as lifting. (Since both ancestral and derived cell types can coexist in the body, some of the node labels should be simply “lifted”—copied—into the parent node). To our knowledge, this is the first lifting approach used in the study of cell differentiation. We also provide simulations and tests on real data, indicating that our ML approach to the inference of cell-type trees outperforms distance-based and parsimony-based building approaches and that our lifting algorithm not only works well on simulations, but also gives biologically meaningful results.
Methods
A histone-modification ChIP-Seq library contains ChIP-Seq data for one ChIP-Seq experiment. In our case, each library typically contains data for one histone modification for one replicate of a cell type.
Model of differentiation for histone marks
We use the model of [7], in which histone marks can be independently gained or lost in regions of the genome as cells differentiate from a less specialized type to a more specialized one. This independence assumption is consistent with practice in phylogenetic inference and enormously simplifies computations.
Data preprocessing and data representation
ChIP-Seq data are converted into peak data using a peak-finder. The presence of a peak signifies the presence of a histone mark in that genomic region. We have used publicly available peak lists (from the ENCODE database) for our study.
- 1.
Windowing representation: The genome is divided into bins of fixed size; if the bin contains at least one peak, we code it 1, otherwise we code it 0. The coding of each library is thus independent of that of any other library (a ChIP-Seq dataset and its representation are both called libraries). We used bins of 200 bp because 147 bp of DNA wrap around the histone and two histones are connected by linker DNA of about 50 bp; thus each bin approximates the presence or absence of just one histone modification.
- 2.
Overlap representation: This representation takes into account all libraries at once. The aim is to find interesting regions in the genome based on peaks. Denote the i ^{ t h } peak in library n as \({P^{n}_{i}}=\left [P^{n}_{\textit {iL}},P^{n}_{\textit {iR}}\right ]\), where \(P^{n}_{\textit {iL}}\) and \(P^{n}_{\textit {iR}}\) are the left and right endpoints (as basepair indices). Consider each peak as an interval on the genome (or on the line of real numbers) and build the interval graph defined by all peaks in all libraries. An interval graph has one vertex for each interval and an edge between two vertices whenever the two corresponding intervals overlap [13]. We simply want the connected components of the interval graph. We define an interval in the genome is an interesting region if and only if it corresponds to a connected component of the interval graph. More details on the overlap representation and an algorithm to identify interesting regions in linear time appear in [7].
The output of either the windowing representation or overlap representation is a string of ones and zeros to represent each data library. Both representations gave fairly similar results in earlier work [7], so in this study we chose the overlap representation, for its compactness.
ML-based phylogenetic analysis
We use an ML-based approach to build cell-type trees on the overlap data representation, carrying out the inference with the RAxML tool [18]. We run RAxML on the binary data obtained using the overlap representation and obtain a cell-type tree. For our experiments, we used the GAMMA model of rate heterogeneity (BINGAMMA) and turned on the rapid bootstrapping option (set to 100).
Inferring ancestral/internal nodes through lifting
We now describe an algorithm for inferring ancestral/internal nodes using a process called lifting, to establish a parent-child relationship between the various cell types (at the leaves). Lifting techniques have been used in the context of tree alignment problems [19]. We first infer a tree using RAxML; we then root the tree using prior biological knowledge. (One could root the tree by placing a root between two nodes of an unrooted tree connected by an edge). Denote by T the resulting rooted binary tree. We now run the lifting procedure on this tree T, so that they obey path constraints. The basic idea of the lifting procedure is to compute the likelihood of the tree after the lifting each possible leaf node (if its sibling is also a leaf) and subtract it from the likelihood of the unlifted tree, and then to actually lift the leaf with the highest probability if this difference is greater than some threshold. The old tree is now updated with the lifted tree and this procedure is continued till the lifting stops. The pseudocode for the lifting algorithm is given below.
Algorithm for lifting
- 1.
Set R=T.
- 2.
If number of leaves in R is less than or equal to 4, go to step 7.
- 3.Let \(\mathbb {L}\) be the set of leaves whose sibling is also a leaf. For each leaf node \(L \in \mathbb {L}\) we compute the likelihood/probability P(L) of lifting L using the following procedure.
- (a)Divide the tree R into two smaller trees according to L, \({R_{L}^{1}}\) and \({R_{L}^{2}}\) (see example in Fig. 2). \({R_{L}^{1}}\) is built by first lifting L to its parent and then removing L and its sibling (from R). \({R_{L}^{2}}\) is a small tree of 2 nodes, the earlier leaf node L which is connected to its sibling node (parent is L).
- (b)
Estimate the probabilities of \({R_{L}^{1}}\) and \({R_{L}^{2}}\) (branch lengths estimated using RAxML and probabilities calculated using built in methods in R software packages like phangorn [20]). The total probability is the product of these two probabilities.
- (a)
- 4.
Compute the best lift \(L^{*} = \arg \max _{L \in \mathbb {L}} P(L)\).
- 5.
Let W=l o g(P(L ^{∗}))+α l o g(K)−l o g(P(R)), where K is the length of the data representation sequence, α a user-defined, real-valued constant, P(R) is the likelihood of tree R. W plays a role similar to a BIC criterion [21].
- 6.
If W>0, we lift, update the tree \(R = R_{L^{*}}^{1}\), and mark the corresponding edge (parent of L ^{∗} and L ^{∗}) in T as lifted; we then return to step 2.
- 7.
Output T and stop.
The output tree T is the desired cell-type tree with labelled ancestral nodes. We terminate the algorithm when the number of leaves is four or less since we use RAxML.
Results and discussion
We show the results on both real and simulated data.
Using real data
Cell types, short description, and general group for H3K4me3 data. For details see the ENCODE website [23]
Cell name | Short description | Group |
---|---|---|
AG04449 | fetal buttock/thigh fibroblast | Fibroblast |
AG04450 | fetal lung fibroblast | Fibroblast |
AG09319 | gum tissue fibroblasts | Fibroblast |
AoAF | aortic adventitial fibroblast cells | Fibroblast |
BJ | skin fibroblast | Fibroblast |
CD14 | Monocytes-CD14+ from human leukapheresis production | Blood |
CD20 | B cells replicate | Blood |
hESC | undifferentiated embryonic stem cells | hESC |
HAc | astrocytes-cerebellar | Astrocytes |
HAsp | astrocytes spinal cord | Astrocytes |
HBMEC | brain microvascular endothelial cells | Endothelial |
HCFaa | cardiac fibroblasts- adult atrial | Fibroblast |
HCF | cardiac fibroblasts | Fibroblast |
HCM | cardiac myocytes | Myocytes |
HCPEpiC | choroid plexus epithelial cells | Epithelial |
HEEpiC | esophageal epithelial cells | Epithelial |
HFF | foreskin fibroblast | Fibroblast |
HFF MyC | foreskin fibroblast cells expressing canine cMyc | Fibroblast |
HMEC | mammary epithelial cells | Epithelial |
HPAF | pulmonary artery fibroblasts | Fibroblast |
HPF | pulmonary fibroblasts isolated from lung tissue | Fibroblast |
HRE | renal epithelial cells | Epithelial |
HRPEpiC | retinal pigment epithelial cells | Epithelial |
HUVEC | umbilical vein endothelial cells | Endothelial |
HVMF | villous mesenchymal fibroblast cells | Fibroblast |
NHDF Neo | neonatal dermal fibroblasts | Fibroblast |
NHEK | epidermal keratinocytes | Epithelial |
NHLF | lung fibroblasts | Fibroblast |
RPTEC | renal proximal tubule epithelial cells | Epithelial |
SAEC | small airway epithelial cells | Epithelial |
SKMC | skeletal muscle cells | Skeletal muscle |
WI 38 | embryonic lung fibroblast cells | Fibroblast |
Groupings for cell-type trees on H3K4me3 data
hESC | Epithelial | Fibroblast | Blood | Astrocytes | Myocytes | Endothelial | Skeletal Muscle | |
---|---|---|---|---|---|---|---|---|
(5) | (8) | (16) | (2) | (2) | (1) | (2) | (1) | |
D | 5,0 | 4,1 | 6,3 | 2,0 | 2,0 | 1,0 | 1,1 | 1,0 |
P | 5,0 | 4,2 | 6,4 | 2,0 | 1,1 | 1,0 | 1,1 | 1,0 |
ML | 5,0 | 6,1 | 15,1 | 2,0 | 2,0 | 1,0 | 1,1 | 1,0 |
We repeated these experiments by picking a random number of columns from the overlap representation (sampling without replacement) and we found that our results are quite consistent, if we choose 50,000 or even only 10,000 columns (out of a total of 200,152 columns).
Using simulated data
In this paper, we use simulated studies to compare the quality of our maximum-likelihood approach and lifting algorithm. We randomly generate a set of rooted binary trees with a fixed number of leaves — containing either 12, 50, and 100 leaf nodes (random trees created using “ape” library in R [27]). Ten trees for each kind of tree (12, 50, or 100 leaf tree) are generated. Each of these trees then had their edges marked (randomly) as lifted (signifying lift from child to parent in that edge) with some probability. This is the true tree. Data representation length (K) of 1000 bits (1 or 0) for each leaf node was then simulated using each tree (used phangorn library in R).
- (1)
True positive rate \(TPR = \frac {TP}{TP+FN}\).
- (2)
False positive rate \(FPR = \frac {FP}{FP+TN}\).
- (3)
F-score or F _{1}-score \(F = \frac {2TP}{2TP + FP + FN}\)
- (4)
Accuracy \(ACC = \frac {TP+TN}{TP+TN+FP+FN}\)
We also compute the Robinson-Foulds metric or RF distance [29] which computes the distance between the true tree and the unlifted tree we get after applying RAxML.
Statistics for trees with fixed number of leaf nodes
12-leaf | 50-leaf | 100-leaf | |
---|---|---|---|
TPR | 0.750 | 0.736 | 0.789 |
FPR | 0.070 | 0.064 | 0.036 |
F | 0.677 | 0.629 | 0.748 |
ACC | 0.906 | 0.917 | 0.946 |
RF | 1.3 | 5.900 | 12.20 |
Statistics for trees with different length of data representations
K=500 | K=1000 | K=5000 | |
---|---|---|---|
TPR | 0.783 | 0.750 | 0.880 |
FPR | 0.088 | 0.070 | 0.067 |
F | 0.621 | 0.677 | 0.733 |
ACC | 0.899 | 0.906 | 0.927 |
RF | 0.700 | 1.300 | 0.400 |
Statistics for trees with different values of α
α=0.1 | α=1 | α=2 | |
---|---|---|---|
TPR | 0.750 | 0.750 | 0.871 |
FPR | 0.070 | 0.063 | 0.141 |
F | 0.677 | 0.667 | 0.643 |
ACC | 0.906 | 0.916 | 0.861 |
Conclusions
We proposed a maximum-likelihood based approach to estimate cell-type trees from histone modification data. We showed that our maximum-likelihood based approach outperforms previous approaches such as distance-based or parsimony-based methods, on H3K4me3 histone modification data. We also proposed the first lifting-based approach to infer internal nodes in cell-type trees and showed the usefulness of this technique in both real and simulated data. The lifting approach is important since in cell differentiation, ancestral cell types can coexist with derived cell types in adult organisms. Our approach is easy to use and is probably the only current approach to build cell-type trees with ancestral inference. Hence we feel that our approach will be an effective way to help biologists and bioinformaticians to study the cell differentiation process. The lifting process we developed may also have many other applications, be in the study of cancer genetic data where normal cells differentiate into cancerous cells, and in other diverse fields like the evolution of languages.
Availability of supporting data
The code for this work can be downloaded from http://lcbb.epfl.ch/software.html.
Notes
Declarations
Acknowledgements
NUN’s project was funded by Swiss National Science Foundation, project subside number: 200021_121710/1. The publication costs for this article was funded by École Polytechnique Fédérale de Lausanne (EPFL).
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver(http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
Authors’ Affiliations
References
- Graf T, Enver T. Forcing cells to change lineages. Nature. 2009; 462(7273):587–94.PubMedView ArticleGoogle Scholar
- Kin K, Nnamani MC, Lynch VJ, Michaelides E, Wagner GP. Cell-type phylogenetics and the origin of endometrial stromal cells. Cell Rep. 2015; 10(8):1398–1409.PubMedView ArticleGoogle Scholar
- Lee JH, Hart SR, Skalnik DG. Histone deacetylase activity is required for embryonic stem cell differentiation. Genesis. 2004; 38(1):32–8.PubMedView ArticleGoogle Scholar
- Lister R, Pelizzola M, Kida YS, Hawkins RD, Nery JR, Hon G, et al. Hotspots of aberrant epigenomic reprogramming in human induced pluripotent stem cells. Nature. 2011; 471(7336):68–73.PubMedPubMed CentralView ArticleGoogle Scholar
- Lobe CG. Transcription factors and mammalian development. Curr Top Dev Biol. 1992; 27:351–1.PubMedView ArticleGoogle Scholar
- Arendt D. The evolution of cell types in animals: emerging principles from molecular studies. Nat Rev Genet. 2008; 9(11):868–82.PubMedView ArticleGoogle Scholar
- Nair NU, Lin Y, Manasovska A, Antic J, Grnarova P, Sahu AD, et al. Study of cell differentiation by phylogenetic analysis using histone modification data. BMC Bioinforma. 2014; 15(1):269.View ArticleGoogle Scholar
- Nelson DL, Lehninger AL, Cox MM. Lehninger Principles of Biochemistry, 5th ed. London, England: Macmillan; 2008.Google Scholar
- Berger SL. Histone modifications in transcriptional regulation. Curr Opin Genet Dev. 2002; 12(2):142–8.PubMedView ArticleGoogle Scholar
- Barski A, Cuddapah S, Cui K, Roh TY, Schones DE, Wang Z, et al. High-resolution profiling of histone methylations in the human genome. Cell. 2007; 129(4):823–37.PubMedView ArticleGoogle Scholar
- Mardis ER. ChIP-seq: welcome to the new frontier. Nat Methods. 2007; 4(8):613–3.PubMedView ArticleGoogle Scholar
- Martin C, Zhang Y. Mechanisms of epigenetic inheritance. Curr Opin Cell Biol. 2007; 19(3):266–72.PubMedView ArticleGoogle Scholar
- Nair NU, Lin Y, Bucher P, Moret BM. Phylogenetic Analysis of Cell Types using Histone Modifications. In: Proc. 13th Workshop on Algorithms in Bioinformatics (WABI), Sophia Antipolis, France, in Lecture Notes in Computer Science 8126. Berlin: Springer-Verlag: 2013. p. 326–337.Google Scholar
- Liang C, Forrest AR, Wagner GP, FANTOM Consortium. The statistical geometry of transcriptome divergence in cell-type evolution and cancer. Nat Commun. 2015; 6:1–6.Google Scholar
- Bryder D, Rossi DJ, Weissman IL. Hematopoietic stem cells: the paradigmatic tissue-specific stem cell. Am J Pathol. 2006; 169(2):338–46.PubMedPubMed CentralView ArticleGoogle Scholar
- Pronk CJ, Rossi DJ, Månsson R, Attema JL, Norddahl GL, Chan CK, et al. Elucidation of the phenotypic, functional, and molecular topography of a myeloerythroid progenitor cell hierarchy. Cell Stem Cell. 2007; 1(4):428–42.PubMedView ArticleGoogle Scholar
- Villadsen R, Fridriksdottir AJ, Rønnov-Jessen L, Gudjonsson T, Rank F, LaBarge MA, et al. Evidence for a stem cell hierarchy in the adult human breast. J Cell Biol. 2007; 177(1):87–101.PubMedPubMed CentralView ArticleGoogle Scholar
- Stamatakis A. RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics. 2014; 30(9):1312–1313.PubMedPubMed CentralView ArticleGoogle Scholar
- Wang L, Jiang T, Lawler EL. Approximation algorithms for tree alignment with a given phylogeny. Algorithmica. 1996; 16(3):302–15.View ArticleGoogle Scholar
- Schliep KP. phangorn: Phylogenetic analysis in R. Bioinformatics. 2011; 27(4):592–3.PubMedPubMed CentralView ArticleGoogle Scholar
- Schwarz G. Estimating the dimension of a model. Ann Stat. 1978; 6(2):461–4.View ArticleGoogle Scholar
- ENCODE Project Consortium. A user’s guide to the encyclopedia of DNA elements (ENCODE). PLoS Biol. 2011; 9(4):1001046.View ArticleGoogle Scholar
- Rosenbloom KR, Sloan CA, Malladi VS, Dreszer TR, Learned K, Kirkup VM, et al. ENCODE Data in the UCSC Genome Browser: year 5 update. Nucleic Acids Res. 2013; 41(D1):56–63.View ArticleGoogle Scholar
- Mikkelsen TS, Ku M, Jaffe DB, Issac B, Lieberman E, Giannoukos G, et al. Genome-wide maps of chromatin state in pluripotent and lineage-committed cells. Nature. 2007; 448(7153):553–60.PubMedPubMed CentralView ArticleGoogle Scholar
- Saitou N, Nei M. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol. 1987; 4(4):406–25.PubMedGoogle Scholar
- Goloboff PA. Analyzing large data sets in reasonable times: solutions for composite optima. Cladistics. 1999; 15(4):415–28.View ArticleGoogle Scholar
- Paradis E, Claude J, Strimmer K. APE: analyses of phylogenetics and evolution in R language. Bioinformatics. 2004; 20(2):289–90.PubMedView ArticleGoogle Scholar
- Fawcett T. An introduction to ROC analysis. Pattern Recogn Lett. 2006; 27(8):861–74.View ArticleGoogle Scholar
- Robinson D, Foulds LR. Comparison of phylogenetic trees. Math Biosci. 1981; 53(1):131–47.View ArticleGoogle Scholar