This file is indexed.

/usr/include/Bpp/Phyl/Model/Protein/JCprot.h is in libbpp-phyl-dev 2.2.0-1+b1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
//
// File: JCprot.h
// Created by: Julien Dutheil
// Created on: Tue May 25 16:04:36 2003
//

/*
  Copyright or © or Copr. Bio++ Development Team, (November 16, 2004)

  This software is a computer program whose purpose is to provide classes
  for phylogenetic data analysis.

  This software is governed by the CeCILL  license under French law and
  abiding by the rules of distribution of free software.  You can  use, 
  modify and/ or redistribute the software under the terms of the CeCILL
  license as circulated by CEA, CNRS and INRIA at the following URL
  "http://www.cecill.info". 

  As a counterpart to the access to the source code and  rights to copy,
  modify and redistribute granted by the license, users are provided only
  with a limited warranty  and the software's author,  the holder of the
  economic rights,  and the successive licensors  have only  limited
  liability. 

  In this respect, the user's attention is drawn to the risks associated
  with loading,  using,  modifying and/or developing or reproducing the
  software by the user in light of its specific status of free software,
  that may mean  that it is complicated to manipulate,  and  that  also
  therefore means  that it is reserved for developers  and  experienced
  professionals having in-depth computer knowledge. Users are therefore
  encouraged to load and test the software's suitability as regards their
  requirements in conditions enabling the security of their systems and/or 
  data to be ensured and,  more generally, to use and operate it in the 
  same conditions as regards security. 

  The fact that you are presently reading this means that you have had
  knowledge of the CeCILL license and that you accept its terms.
*/

#ifndef _JCPROT_H_
#define _JCPROT_H_

#include <Bpp/Seq/Alphabet/ProteicAlphabet.h>
#include "ProteinSubstitutionModel.h"
#include "../AbstractSubstitutionModel.h"
#include "../FrequenciesSet/ProteinFrequenciesSet.h"

namespace bpp
{

  /**
   * @brief The Jukes-Cantor substitution model for proteins.
   *
   * All rates equal:
   * \f[
   * \begin{pmatrix}
   * \ddots & r      & \ldots & r \\ 
   * r      & \ddots & \ddots & \vdots \\ 
   * \vdots & \ddots & \ddots & r \\
   * r      & \ldots & r      & \ddots \\ 
   * \end{pmatrix}
   * \f]
   * \f[
   * \pi = diag\left(\frac{1}{20}, \ldots, \frac{1}{20}\right)
   * \f]
   * Normalization: \f$r\f$ is set so that \f$\sum_i Q_{i,i}\pi_i = -1\f$:
   * \f[
   * S = \begin{pmatrix}
   * -20           & \frac{20}{19} & \ldots        & \frac{20}{19} \\ 
   * \frac{20}{19} &           -20 & \ddots        & \vdots \\ 
   * \vdots        & \ddots        & \ddots        & \frac{20}{19} \\
   * \frac{20}{19} & \ldots        & \frac{20}{19} & -20 \\ 
   * \end{pmatrix}
   * \f]
   * The normalized generator is obtained by taking the dot product of \f$S\f$ and \f$pi\f$:
   * \f[
   * Q = S . \pi = \begin{pmatrix}
   * -1 & \frac{1}{19}     & \ldots & \frac{1}{19} \\ 
   * \frac{1}{19} & -1     & \ddots & \vdots \\ 
   * \vdots       & \ddots & \ddots & \frac{1}{19} \\ 
   * \frac{1}{19} & \ldots & \frac{1}{19} & -1 \\ 
   * \end{pmatrix}
   * \f]
   *
   * The eigen values are \f$\left(0, -\frac{20}{19}, \ldots, -\frac{20}{19}\right)\f$, 
   * the left eigen vectors are, by row:
   * \f[
   * U = \begin{pmatrix}
   *   \frac{1}{20} &        \ldots &  \frac{1}{20} &   \frac{1}{20} &  \frac{1}{20} \\
   *  -\frac{1}{20} &        \ldots & -\frac{1}{20} &  \frac{19}{20} & -\frac{1}{20} \\
   *         \vdots &        \ddots & \frac{19}{20} & -\frac{1}{20}  & -\frac{1}{20} \\
   *  -\frac{1}{20} &        \ddots &        \ddots &         \vdots &        \vdots \\
   *  \frac{19}{20} & -\frac{1}{20} &        \ldots &  -\frac{1}{20} & -\frac{1}{20} \\
   * \end{pmatrix}
   * \f]
   * and the right eigen vectors are, by column:
   * \f[
   * U^-1 = \begin{pmatrix}
   *      1 &      0 &  \ldots &      0 &  1 \\
   * \vdots & \vdots &  \ddots & \ddots &  0 \\
   *      1 &      0 &       1 & \ddots & \vdots \\
   *      1 &      1 &       0 & \ldots &  0 \\
   *      1 &     -1 &      -1 & \ldots & -1 \\
   * \end{pmatrix}
   * \f]
   *
   * In addition, a rate_ factor defines the mean rate of the model.
   *
   * The probabilities of changes are computed analytically using the formulas:
   * \f[
   * P_{i,j}(t) = \begin{cases}
   * \frac{1}{20} + \frac{19}{20}e^{- rate\_ * \frac{20}{19}t}& \text{if $i=j$}, \\
   * \frac{1}{20} - \frac{1}{20}e^{- rate\_ * \frac{20}{19}t} & \text{otherwise}.
   * \end{cases}
   * \f]
   *
   * First and second order derivatives are also computed analytically using the formulas:
   * \f[
   * \frac{\partial P_{i,j}(t)}{\partial t} = rate\_ * \begin{cases}
   * -e^{- rate\_ * \frac{20}{19}t}           & \text{if $i=j$}, \\
   * \frac{1}{19}e^{- rate\_ * \frac{20}{19}t} & \text{otherwise}.
   * \end{cases}
   * \f]
   * \f[
   * \frac{\partial^2 P_{i,j}(t)}{\partial t^2} =  rate\_^2 * \begin{cases}
   * \frac{20}{19}e^{- rate\_ * \frac{20}{19}t}  & \text{if $i=j$}, \\
   * -\frac{20}{361}e^{- rate\_ * \frac{20}{19}t} & \text{otherwise}.
   * \end{cases}
   * \f]
   *
   * Reference:
   * - Jukes TH and Cantor CR (1969), Evolution_ of proteins molecules_, 121-123, in Mammalian_ protein metabolism_. 
   */
  class JCprot:
    public virtual ProteinSubstitutionModel,
    public AbstractReversibleSubstitutionModel
  {
  private:
    mutable double exp_;
    mutable RowMatrix<double> p_;
    ProteinFrequenciesSet* freqSet_;

  public:
    /**
     * @brief Build a simple JC69 model, with original equilibrium frequencies.
     *
     * @param alpha A proteic alphabet.
     */
    JCprot(const ProteicAlphabet* alpha);

    /**
     * @brief Build a JC69 model with special equilibrium frequencies.
     *
     * @param alpha A proteic alphabet.
     * @param freqSet A pointer toward a protein frequencies set, which will be owned by this instance.
     * @param initFreqs Tell if the frequency set should be initialized with the original JTT92 values.
     * Otherwise, the values of the set will be used.
     */
    JCprot(const ProteicAlphabet* alpha, ProteinFrequenciesSet* freqSet, bool initFreqs = false);

    JCprot(const JCprot& model) :
      AbstractParameterAliasable(model),
      //AbstractSubstitutionModel(model),
      AbstractReversibleSubstitutionModel(model),
      exp_(model.exp_),
      p_(model.p_),
      freqSet_(dynamic_cast<ProteinFrequenciesSet*>(model.freqSet_->clone()))
    {}

    JCprot& operator=(const JCprot& model)
    {
      AbstractParameterAliasable::operator=(model);
      AbstractSubstitutionModel::operator=(model);
      AbstractReversibleSubstitutionModel::operator=(model);
      exp_ = model.exp_;
      p_   = model.p_;
      if (freqSet_) delete freqSet_;
      freqSet_ = dynamic_cast<ProteinFrequenciesSet*>(model.freqSet_->clone());
      return *this;
    }

    virtual ~JCprot() { delete freqSet_; }
	
#ifndef NO_VIRTUAL_COV
    JCprot*
#else
    Clonable*
#endif
    clone() const { return new JCprot(*this); }

  public:
    double Pij_t    (size_t i, size_t j, double d) const;
    double dPij_dt  (size_t i, size_t j, double d) const;
    double d2Pij_dt2(size_t i, size_t j, double d) const;
    const Matrix<double>& getPij_t    (double d) const;
    const Matrix<double>& getdPij_dt  (double d) const;
    const Matrix<double>& getd2Pij_dt2(double d) const;

    std::string getName() const 
    { 
      if (freqSet_->getNamespace().find("+F.")!=std::string::npos)
        return "JC69+F"; 
      else 
        return "JC69"; 
    }
	
    void fireParameterChanged(const ParameterList& parameters)
    {
      freqSet_->matchParametersValues(parameters);
      freq_ = freqSet_->getFrequencies();
      AbstractReversibleSubstitutionModel::fireParameterChanged(parameters);
    }

    void setFrequenciesSet(const ProteinFrequenciesSet& freqSet)
    {
      delete freqSet_;
      freqSet_ = dynamic_cast<ProteinFrequenciesSet*>(freqSet.clone());
      resetParameters_();
      addParameters_(freqSet_->getParameters());
    }

    const FrequenciesSet* getFrequenciesSet() const { return freqSet_; }

    void setFreqFromData(const SequenceContainer& data, double pseudoCount = 0);

  protected:
    /**
     * In the case of the model of Jukes & Cantor, this method is useless since
     * the generator is fixed! No matrice can be changed... This method is only
     * used in the constructor of the class.
     */
    void updateMatrices();

    
  };

} //end of namespace bpp.

#endif	//_JCPROT_H_