2
// File: RHomogeneousMixedTreeLikelihood.h
3
// Created by: David Fournier, Laurent Gueguen
7
Copyright or Ā© or Copr. CNRS, (November 16, 2004)
9
This software is a computer program whose purpose is to provide classes
10
for phylogenetic data analysis.
12
This software is governed by the CeCILL license under French law and
13
abiding by the rules of distribution of free software. You can use,
14
modify and/ or redistribute the software under the terms of the CeCILL
15
license as circulated by CEA, CNRS and INRIA at the following URL
16
"http://www.cecill.info".
18
As a counterpart to the access to the source code and rights to copy,
19
modify and redistribute granted by the license, users are provided only
20
with a limited warranty and the software's author, the holder of the
21
economic rights, and the successive licensors have only limited
24
In this respect, the user's attention is drawn to the risks associated
25
with loading, using, modifying and/or developing or reproducing the
26
software by the user in light of its specific status of free software,
27
that may mean that it is complicated to manipulate, and that also
28
therefore means that it is reserved for developers and experienced
29
professionals having in-depth computer knowledge. Users are therefore
30
encouraged to load and test the software's suitability as regards their
31
requirements in conditions enabling the security of their systems and/or
32
data to be ensured and, more generally, to use and operate it in the
33
same conditions as regards security.
35
The fact that you are presently reading this means that you have had
36
knowledge of the CeCILL license and that you accept its terms.
39
#include "RHomogeneousMixedTreeLikelihood.h"
46
#include "../PatternTools.h"
48
#include <Bpp/Numeric/VectorTools.h>
49
#include <Bpp/App/ApplicationTools.h>
54
RHomogeneousMixedTreeLikelihood::RHomogeneousMixedTreeLikelihood(
56
SubstitutionModel* model,
57
DiscreteDistribution* rDist,
60
bool usePatterns) throw (Exception) :
61
RHomogeneousTreeLikelihood(tree, model, rDist, checkRooted, verbose, usePatterns),
62
treeLikelihoodsContainer_(),
65
MixedSubstitutionModel* mixedmodel;
66
if ((mixedmodel = dynamic_cast<MixedSubstitutionModel*>(model_)) == 0)
67
throw Exception("Bad model: RHomogeneousMixedTreeLikelihood needs a MixedSubstitutionModel.");
68
unsigned int s = mixedmodel->getNumberOfModels();
69
for (unsigned int i = 0; i < s; i++)
71
treeLikelihoodsContainer_.push_back(
72
new RHomogeneousTreeLikelihood(tree, mixedmodel->getNModel(i), rDist, checkRooted, false, usePatterns));
73
probas_.push_back(mixedmodel->getNProbability(i));
77
RHomogeneousMixedTreeLikelihood::RHomogeneousMixedTreeLikelihood(
79
const SiteContainer& data,
80
SubstitutionModel* model,
81
DiscreteDistribution* rDist,
84
bool usePatterns) throw (Exception) :
85
RHomogeneousTreeLikelihood(tree, model, rDist, checkRooted, verbose, usePatterns),
86
treeLikelihoodsContainer_(),
89
MixedSubstitutionModel* mixedmodel;
91
if ((mixedmodel = dynamic_cast<MixedSubstitutionModel*>(model_)) == 0)
92
throw Exception("Bad model: RHomogeneousMixedTreeLikelihood needs a MixedSubstitutionModel.");
94
unsigned int s = mixedmodel->getNumberOfModels();
96
for (unsigned int i = 0; i < s; i++)
98
treeLikelihoodsContainer_.push_back(
99
new RHomogeneousTreeLikelihood(tree, mixedmodel->getNModel(i), rDist, checkRooted, false, usePatterns));
100
probas_.push_back(mixedmodel->getNProbability(i));
105
RHomogeneousMixedTreeLikelihood& RHomogeneousMixedTreeLikelihood::operator=(const RHomogeneousMixedTreeLikelihood& lik)
107
RHomogeneousTreeLikelihood::operator=(lik);
109
treeLikelihoodsContainer_.clear();
112
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
114
treeLikelihoodsContainer_.push_back(lik.treeLikelihoodsContainer_[i]->clone());
115
probas_.push_back(lik.probas_[i]);
122
RHomogeneousMixedTreeLikelihood::RHomogeneousMixedTreeLikelihood(const RHomogeneousMixedTreeLikelihood& lik) :
123
RHomogeneousTreeLikelihood(lik),
124
treeLikelihoodsContainer_(lik.treeLikelihoodsContainer_.size()),
125
probas_(lik.probas_.size())
127
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
129
treeLikelihoodsContainer_[i] = lik.treeLikelihoodsContainer_[i]->clone();
130
probas_.push_back(lik.probas_[i]);
134
RHomogeneousMixedTreeLikelihood::~RHomogeneousMixedTreeLikelihood()
136
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
138
delete treeLikelihoodsContainer_[i];
143
void RHomogeneousMixedTreeLikelihood::initialize() throw (Exception)
145
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
147
treeLikelihoodsContainer_[i]->initialize();
149
RHomogeneousTreeLikelihood::initialize();
152
void RHomogeneousMixedTreeLikelihood::setData(const SiteContainer& sites) throw (Exception)
154
RHomogeneousTreeLikelihood::setData(sites);
156
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
158
treeLikelihoodsContainer_[i]->setData(sites);
163
void RHomogeneousMixedTreeLikelihood::fireParameterChanged(const ParameterList& params)
167
MixedSubstitutionModel* mixedmodel = dynamic_cast<MixedSubstitutionModel*>(model_);
169
unsigned int s = mixedmodel->getNumberOfModels();
171
const SubstitutionModel* pm;
172
for (unsigned int i = 0; i < s; i++)
175
pm = mixedmodel->getNModel(i);
176
pl.addParameters(pm->getParameters());
177
pl.includeParameters(getParameters());
178
treeLikelihoodsContainer_[i]->matchParametersValues(pl);
180
probas_ = mixedmodel->getProbabilities();
182
minusLogLik_ = -getLogLikelihood();
185
void RHomogeneousMixedTreeLikelihood::computeTreeLikelihood()
187
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
189
treeLikelihoodsContainer_[i]->computeTreeLikelihood();
193
/******************************************************************************
195
******************************************************************************/
196
double RHomogeneousMixedTreeLikelihood::getLikelihoodForASiteForARateClass(unsigned int site, unsigned int rateClass) const
200
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
202
res += treeLikelihoodsContainer_[i]->getLikelihoodForASiteForARateClass(site, rateClass) * probas_[i];
208
double RHomogeneousMixedTreeLikelihood::getLogLikelihoodForASiteForARateClass(unsigned int site, unsigned int rateClass) const
210
double x = getLikelihoodForASiteForARateClass(site, rateClass);
216
double RHomogeneousMixedTreeLikelihood::getLikelihoodForASiteForARateClassForAState(unsigned int site, unsigned int rateClass, int state) const
220
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
222
res += treeLikelihoodsContainer_[i]->getLikelihoodForASiteForARateClassForAState(site, rateClass, state) * probas_[i];
228
double RHomogeneousMixedTreeLikelihood::getLogLikelihoodForASiteForARateClassForAState(unsigned int site, unsigned int rateClass, int state) const
230
double x = getLikelihoodForASiteForARateClassForAState(site, rateClass, state);
237
/******************************************************************************
238
* First Order Derivatives *
239
******************************************************************************/
240
double RHomogeneousMixedTreeLikelihood::getDLikelihoodForASiteForARateClass(unsigned int site, unsigned int rateClass) const
244
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
246
res += treeLikelihoodsContainer_[i]->getDLikelihoodForASiteForARateClass(site, rateClass) * probas_[i];
252
void RHomogeneousMixedTreeLikelihood::computeTreeDLikelihood(const string& variable)
254
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
256
treeLikelihoodsContainer_[i]->computeTreeDLikelihood(variable);
260
/******************************************************************************
261
* Second Order Derivatives *
262
******************************************************************************/
263
double RHomogeneousMixedTreeLikelihood::getD2LikelihoodForASiteForARateClass(unsigned int site, unsigned int rateClass) const
267
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
269
res += treeLikelihoodsContainer_[i]->getD2LikelihoodForASiteForARateClass(site, rateClass) * probas_[i];
276
void RHomogeneousMixedTreeLikelihood::computeTreeD2Likelihood(const string& variable)
278
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
280
treeLikelihoodsContainer_[i]->computeTreeD2Likelihood(variable);
284
void RHomogeneousMixedTreeLikelihood::computeSubtreeLikelihood(const Node* node)
286
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
288
treeLikelihoodsContainer_[i]->computeSubtreeLikelihood(node);
292
void RHomogeneousMixedTreeLikelihood::computeDownSubtreeDLikelihood(const Node* node)
294
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
296
treeLikelihoodsContainer_[i]->computeDownSubtreeDLikelihood(node);
300
void RHomogeneousMixedTreeLikelihood::computeDownSubtreeD2Likelihood(const Node* node)
302
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
304
treeLikelihoodsContainer_[i]->computeDownSubtreeD2Likelihood(node);
309
void RHomogeneousMixedTreeLikelihood::computeAllTransitionProbabilities()
311
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
313
treeLikelihoodsContainer_[i]->computeAllTransitionProbabilities();
318
void RHomogeneousMixedTreeLikelihood::computeTransitionProbabilitiesForNode(const Node* node)
320
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
322
treeLikelihoodsContainer_[i]->computeTransitionProbabilitiesForNode(node);
327
void RHomogeneousMixedTreeLikelihood::displayLikelihood(const Node* node)
329
for (unsigned int i = 0; i < treeLikelihoodsContainer_.size(); i++)
331
treeLikelihoodsContainer_[i]->displayLikelihood(node);