bpp-phyl  2.3.0
bpp::SubstitutionModel Class Referenceabstract

Interface for all substitution models. More...

#include <Bpp/Phyl/Model/SubstitutionModel.h>

+ Inheritance diagram for bpp::SubstitutionModel:
+ Collaboration diagram for bpp::SubstitutionModel:

Public Member Functions

 SubstitutionModel ()
virtual ~SubstitutionModel ()
SubstitutionModelclone () const =0
virtual double Qij (size_t i, size_t j) const =0
virtual const Matrix< double > & getGenerator () const =0
virtual const Matrix< double > & getExchangeabilityMatrix () const =0
virtual double Sij (size_t i, size_t j) const =0
virtual void enableEigenDecomposition (bool yn)=0
 Set if eigenValues and Vectors must be computed. More...
virtual bool enableEigenDecomposition ()=0
 Tell if eigenValues and Vectors must be computed. More...
virtual const VdoublegetEigenValues () const =0
virtual const VdoublegetIEigenValues () const =0
virtual bool isDiagonalizable () const =0
virtual bool isNonSingular () const =0
virtual const Matrix< double > & getRowLeftEigenVectors () const =0
virtual const Matrix< double > & getColumnRightEigenVectors () const =0
virtual void setScalable (bool scalable)=0
 sets if model is scalable, ie scale can be changed. Default : true, set to false to avoid normalization for example. More...
virtual bool isScalable () const =0
 returns if model is scalable More...
virtual double getScale () const =0
 Get the scalar product of diagonal elements of the generator and the frequencies vector. If the generator is normalized, then scale=1. Otherwise each element must be multiplied by 1/scale. More...
virtual void setScale (double scale)=0
 Multiplies the current generator by the given scale. More...
virtual void normalize ()=0
 Normalize the generator. More...
virtual double getRate () const =0
 Get the rate. More...
virtual void setRate (double rate)=0
 Set the rate of the model (must be positive). More...
virtual void addRateParameter ()=0
virtual std::string getName () const =0
 Get the name of the model. More...
virtual const std::vector< int > & getAlphabetStates () const =0
virtual const StateMapgetStateMap () const =0
virtual std::vector< size_t > getModelStates (int code) const =0
 Get the state in the model corresponding to a particular state in the alphabet. More...
virtual std::vector< size_t > getModelStates (const std::string &code) const =0
 Get the state in the model corresponding to a particular state in the alphabet. More...
virtual int getAlphabetStateAsInt (size_t index) const =0
virtual std::string getAlphabetStateAsChar (size_t index) const =0
virtual double freq (size_t i) const =0
virtual double Pij_t (size_t i, size_t j, double t) const =0
virtual double dPij_dt (size_t i, size_t j, double t) const =0
virtual double d2Pij_dt2 (size_t i, size_t j, double t) const =0
virtual const VdoublegetFrequencies () const =0
virtual const Matrix< double > & getPij_t (double t) const =0
virtual const Matrix< double > & getdPij_dt (double t) const =0
virtual const Matrix< double > & getd2Pij_dt2 (double t) const =0
virtual const AlphabetgetAlphabet () const =0
virtual size_t getNumberOfStates () const =0
 Get the number of states. More...
virtual double getInitValue (size_t i, int state) const =0 throw (IndexOutOfBoundsException, BadIntException)
virtual void setFreqFromData (const SequenceContainer &data, double pseudoCount=0)=0
 Set equilibrium frequencies equal to the frequencies estimated from the data. More...
virtual void setFreq (std::map< int, double > &frequencies)=0
 Set equilibrium frequencies. More...
virtual const FrequenciesSetgetFrequenciesSet () const
 If the model owns a FrequenciesSet, returns a pointer to it, otherwise return 0. More...
virtual size_t getNumberOfIndependentParameters () const =0
virtual void aliasParameters (const std::string &p1, const std::string &p2)=0
virtual void aliasParameters (std::map< std::string, std::string > &unparsedParams, bool verbose)=0
virtual void unaliasParameters (const std::string &p1, const std::string &p2)=0
virtual const ParameterListgetIndependentParameters () const =0
virtual std::vector< std::string > getAlias (const std::string &name) const =0
virtual std::map< std::string, std::string > getAliases () const =0
virtual bool hasParameter (const std::string &name) const =0
virtual const ParameterListgetParameters () const =0
virtual const ParametergetParameter (const std::string &name) const =0
virtual double getParameterValue (const std::string &name) const =0
virtual void setAllParametersValues (const ParameterList &parameters)=0
virtual void setParameterValue (const std::string &name, double value)=0
virtual void setParametersValues (const ParameterList &parameters)=0
virtual bool matchParametersValues (const ParameterList &parameters)=0
virtual size_t getNumberOfParameters () const =0
virtual void setNamespace (const std::string &prefix)=0
virtual std::string getNamespace () const =0
virtual std::string getParameterNameWithoutNamespace (const std::string &name) const =0

Detailed Description

Interface for all substitution models.

A substitution model is based on a Markov generator $Q$, the size of which depends on the alphabet used (4 for nucleotides, 20 for proteins, etc.). Each SubstitutionModel object hence includes a pointer toward an alphabet, and provides a method to retrieve the alphabet used (getAlphabet() method).

What we want from a substitution model is to compute the probabilities of state j at time t geven state j at time 0 ( $P_{i,j}(t)$). Typically, this is computed using the formula

\[ P(t) = e^{r \times t \times Q}, \]

where $P(t)$ is the matrix with all probabilities $P_{i,j}(t)$, and $ r $ the rate. For some models, the $P_{i,j}(t)$'s can be computed analytically.

For more complex models, we need to use a eigen-decomposition of $Q$:

\[ Q = U^{-1} . D . U, \]

where $D = diag(\lambda_i)$ is a diagonal matrix. Hence

\[ P(t) = e^{r \times t \times Q} = U^{-1} . e^{r \times D \times t} . U, \]

where $e^{r \times D \times t} = diag\left(e^{r \times \lambda_i \times t}\right)$ is a diagonal matrix with all terms equal to exp the terms in $D$ multiplied per $ r \times t $. $U$ is the matrix of left eigen vectors (by row), and $U^{-1}$ is the matrix of right eigen vectors (by column). The values in $D$ are the eigen values of $Q$. All $Q,U,U^{-1}$ and $D$ (its diagonal) may be retrieved from the class (getEigenValues(), getRowRightEigenVectors() and getColumnLeftEigenVectors() functions).

First and second order derivatives of $P(t)$ with respect to $t$ can also be retrieved. These methods may be useful for optimization processes. Derivatives may be computed analytically, or using the general formulas:

\[ \frac{\partial P(t)}{\partial t} = U^{-1} . diag\left(r \times \lambda_i \times e^{r \times \lambda_i \times t}\right) . U \]


\[ \frac{\partial^2 P(t)}{\partial t^2} = U^{-1} . diag\left(r^2 \times \lambda_i^2 \times e^{r \times \lambda_i \times t}\right) . U \]

If Q is not symmetric, then the eigenvalue matrix D is block diagonal with the real eigenvalues in 1-by-1 blocks and any complex eigenvalues, a + i*b, in 2-by-2 blocks, [a, b; -b, a]. That is, if the complex eigenvalues look like

          a + ib   .        .    .
          .        a - ib   .    .
          .        .        x    .
          .        .        .    y

then D looks like

          a          b      .    .
         -b          a      .    .
          .          .      x    .
          .          .      .    y

and exp(tD) equals

          exp(ta)cos(tb)   exp(ta)sin(tb)  .        .
         -exp(ta)sin(tb)   exp(ta)cos(tb)  .        . 
          .                .               exp(tx)  .
          .                .               .        exp(ty)

If U is singular, it cannot be inverted. In this case exp(tQ) is approximated using Taylor decomposition:

\[ P(t) = Id + tQ + \frac{(tQ)^2}{2!} + ... + \frac{(tQ)^n}{n!} + ... \]

To prevent approximation issues, if \f$ max(tQ) \f$ is too high (currently above 0.5), \f$ t \f$ is divided in an ad hoc way (e.g. by \f$ N \f$), and we compute \f$ P(t) = (P(t/N))^N \f$ with a Taylor decomposition for \f$ P(t/N) \f$.

In this case, derivatives according to \f$ t \f$ are computed analytically too.

Definition at line 402 of file SubstitutionModel.h.

Constructor & Destructor Documentation

bpp::SubstitutionModel::SubstitutionModel ( )

Definition at line 406 of file SubstitutionModel.h.

virtual bpp::SubstitutionModel::~SubstitutionModel ( )

Definition at line 407 of file SubstitutionModel.h.

Member Function Documentation

SubstitutionModel* bpp::SubstitutionModel::clone ( ) const
pure virtual

Implements bpp::TransitionModel.

Implemented in bpp::ReversibleSubstitutionModel, bpp::AbstractReversibleSubstitutionModel, bpp::RE08Codon, bpp::YpR_Gen, bpp::RE08Protein, bpp::AbstractSubstitutionModel, bpp::RE08Nucleotide, bpp::YpR_Sym, bpp::HKY85, bpp::F84, bpp::KroneckerCodonDistanceFrequenciesSubstitutionModel, bpp::JCprot, bpp::MarkovModulatedSubstitutionModel, bpp::AbstractKroneckerCodonSubstitutionModel, bpp::T92, bpp::KroneckerCodonDistanceSubstitutionModel, bpp::K80, bpp::MixtureOfSubstitutionModels, bpp::GTR, bpp::RE08, bpp::RN95, bpp::TN93, bpp::AbstractCodonSubstitutionModel, bpp::CodonDistanceFrequenciesSubstitutionModel, bpp::JCnuc, bpp::RN95s, bpp::BinarySubstitutionModel, bpp::KroneckerWordSubstitutionModel, bpp::AbstractReversibleNucleotideSubstitutionModel, bpp::AbstractReversibleProteinSubstitutionModel, bpp::CodonDistancePhaseFrequenciesSubstitutionModel, bpp::MixtureOfASubstitutionModel, bpp::UserProteinSubstitutionModel, bpp::CodonDistanceCpGSubstitutionModel, bpp::SSR, bpp::LLG08_EX3, bpp::LLG08_EHO, bpp::LLG08_UL3, bpp::CodonDistanceSubstitutionModel, bpp::WAG01, bpp::G2001, bpp::L95, bpp::AbstractMixedSubstitutionModel, bpp::LG10_EX_EHO, bpp::LGL08_CAT, bpp::LLG08_EX2, bpp::LLG08_UL2, bpp::CodonRateFrequenciesSubstitutionModel, bpp::DSO78, bpp::JTT92, bpp::WordSubstitutionModel, bpp::GY94, bpp::LG08, bpp::YN98, bpp::AbstractNucleotideSubstitutionModel, bpp::gBGC, bpp::KCM, bpp::SENCA, bpp::AbstractProteinSubstitutionModel, bpp::TS98, bpp::TripletSubstitutionModel, bpp::YNGP_M1, bpp::YNGP_M10, bpp::YNGP_M9, bpp::CodonRateSubstitutionModel, bpp::YNGP_M8, bpp::YNGP_M7, bpp::YNGP_M3, bpp::MG94, bpp::YNGP_M2, bpp::LLG08_EX3::EmbeddedModel, bpp::CodonReversibleSubstitutionModel, bpp::LLG08_EHO::EmbeddedModel, bpp::LLG08_UL3::EmbeddedModel, bpp::Coala, bpp::LG10_EX_EHO::EmbeddedModel, bpp::LGL08_CAT::EmbeddedModel, bpp::LLG08_EX2::EmbeddedModel, bpp::LLG08_UL2::EmbeddedModel, bpp::FromMixtureSubstitutionModel, bpp::NucleotideReversibleSubstitutionModel, bpp::ProteinReversibleSubstitutionModel, bpp::AbstractBiblioSubstitutionModel, bpp::MixedSubstitutionModel, bpp::AbstractBiblioMixedSubstitutionModel, bpp::CodonSubstitutionModel, bpp::NucleotideSubstitutionModel, and bpp::ProteinSubstitutionModel.

Referenced by bpp::FromMixtureSubstitutionModel::FromMixtureSubstitutionModel(), and bpp::YpR::operator=().

virtual double bpp::TransitionModel::d2Pij_dt2 ( size_t  i,
size_t  j,
double  t 
) const
pure virtualinherited
virtual double bpp::TransitionModel::dPij_dt ( size_t  i,
size_t  j,
double  t 
) const
pure virtualinherited
virtual bool bpp::SubstitutionModel::enableEigenDecomposition ( )
pure virtual
virtual const Alphabet* bpp::TransitionModel::getAlphabet ( ) const
pure virtualinherited
Get the alphabet associated to this model.

Implemented in bpp::RE08Protein, bpp::AbstractSubstitutionModel, bpp::RE08Nucleotide, bpp::MarkovModulatedSubstitutionModel, bpp::FromMixtureSubstitutionModel, bpp::AbstractBiblioSubstitutionModel, bpp::AbstractReversibleNucleotideSubstitutionModel, bpp::AbstractReversibleProteinSubstitutionModel, bpp::AbstractFromSubstitutionModelTransitionModel, bpp::AbstractNucleotideSubstitutionModel, bpp::AbstractProteinSubstitutionModel, bpp::NucleotideSubstitutionModel, and bpp::ProteinSubstitutionModel.

Referenced by bpp::AAExteriorSubstitutionRegister::AAExteriorSubstitutionRegister(), bpp::AAInteriorSubstitutionRegister::AAInteriorSubstitutionRegister(), bpp::SubstitutionModelSet::addModel(), bpp::DecompositionReward::alphabetIndexHasChanged(), bpp::ComprehensiveSubstitutionRegister::ComprehensiveSubstitutionRegister(), bpp::DecompositionReward::DecompositionReward(), bpp::DecompositionSubstitutionCount::DecompositionSubstitutionCount(), bpp::AbstractMutationProcess::detailedEvolve(), bpp::LaplaceSubstitutionCount::getAllNumbersOfSubstitutions(), bpp::AbstractFromSubstitutionModelTransitionModel::getAlphabet(), bpp::AbstractSubstitutionRegister::getAlphabet(), bpp::AbstractBiblioSubstitutionModel::getAlphabet(), bpp::FromMixtureSubstitutionModel::getAlphabet(), bpp::MarkovModulatedSubstitutionModel::getAlphabet(), bpp::MarkovModulatedSubstitutionModel::getInitValue(), bpp::SubstitutionMappingTools::getNormalizationsPerBranch(), bpp::SENCA::setFreq(), bpp::LaplaceSubstitutionCount::setSubstitutionModel(), bpp::UniformizationSubstitutionCount::setSubstitutionModel(), bpp::DecompositionSubstitutionCount::setSubstitutionModel(), bpp::DecompositionReward::setSubstitutionModel(), bpp::UniformizationSubstitutionCount::substitutionRegisterHasChanged(), bpp::DecompositionSubstitutionCount::substitutionRegisterHasChanged(), bpp::UniformizationSubstitutionCount::UniformizationSubstitutionCount(), bpp::YpR::updateMatrices(), and bpp::BppOSubstitutionModelFormat::writeMixed_().

virtual const Matrix<double>& bpp::SubstitutionModel::getExchangeabilityMatrix ( ) const
pure virtual
The matrix of exchangeability terms. It is recommended that exchangeability matrix be normalized so that the normalized generator be obtained directly by the dot product $S . \pi$.

Implemented in bpp::AbstractSubstitutionModel, bpp::MarkovModulatedSubstitutionModel, bpp::AbstractBiblioSubstitutionModel, and bpp::FromMixtureSubstitutionModel.

Referenced by bpp::Coala::Coala(), bpp::FromMixtureSubstitutionModel::getExchangeabilityMatrix(), bpp::AbstractBiblioSubstitutionModel::getExchangeabilityMatrix(), and bpp::MarkovModulatedSubstitutionModel::updateMatrices().

virtual const Matrix<double>& bpp::SubstitutionModel::getGenerator ( ) const
pure virtual
The normalized Markov generator matrix, i.e. all normalized rates of changes from state i to state j. The generator is normalized so that (i) $ \forall i; \sum_j Q_{i,j} = 0 $, meaning that $ $ \forall i; Q_{i,i} = -\sum_{j \neq i}Q_{i,j}$, and (ii) $ \sum_i Q_{i,i} \times \pi_i = -1$. This means that, under normalization, the mean rate of replacement at equilibrium is 1 and that time $t$ are measured in units of expected number of changes per site. Additionnaly, the rate_ attibute provides the possibility to increase or decrease this mean rate.

See Kosiol and Goldman (2005), Molecular Biology And Evolution 22(2) 193-9.

See also

Implemented in bpp::AbstractSubstitutionModel, bpp::MarkovModulatedSubstitutionModel, bpp::AbstractBiblioSubstitutionModel, and bpp::FromMixtureSubstitutionModel.

Referenced by bpp::LaplaceSubstitutionCount::computeCounts(), bpp::UniformizationSubstitutionCount::computeCounts_(), bpp::FromMixtureSubstitutionModel::getGenerator(), bpp::AbstractBiblioSubstitutionModel::getGenerator(), bpp::SimpleMutationProcess::SimpleMutationProcess(), and bpp::MarkovModulatedSubstitutionModel::updateMatrices().

virtual const Vdouble& bpp::SubstitutionModel::getIEigenValues ( ) const
pure virtual
virtual double bpp::TransitionModel::getInitValue ( size_t  i,
int  state 
) const
throw (IndexOutOfBoundsException,
pure virtualinherited

This method is used to initialize likelihoods in reccursions. It typically sends 1 if i = state, 0 otherwise, where i is one of the possible states of the alphabet allowed in the model and state is the observed state in the considered sequence/site.

ithe index of the state in the model.
stateAn observed state in the sequence/site.
1 or 0 depending if the two states are compatible.
IndexOutOfBoundsExceptionif array position is out of range.
BadIntExceptionif states are not allowed in the associated alphabet.
See also

Implemented in bpp::AbstractSubstitutionModel, bpp::MarkovModulatedSubstitutionModel, bpp::RE08, bpp::FromMixtureSubstitutionModel, bpp::AbstractBiblioSubstitutionModel, and bpp::AbstractFromSubstitutionModelTransitionModel.

Referenced by bpp::AbstractFromSubstitutionModelTransitionModel::getInitValue(), bpp::AbstractBiblioSubstitutionModel::getInitValue(), bpp::FromMixtureSubstitutionModel::getInitValue(), and bpp::TwoTreeLikelihood::initTreeLikelihoods().

virtual std::vector<size_t> bpp::TransitionModel::getModelStates ( const std::string &  code) const
pure virtualinherited

Get the state in the model corresponding to a particular state in the alphabet.

codeThe alphabet state to check.
A vector of indices of model states.

Implemented in bpp::AbstractSubstitutionModel, bpp::MarkovModulatedSubstitutionModel, bpp::AbstractFromSubstitutionModelTransitionModel, bpp::AbstractBiblioSubstitutionModel, and bpp::FromMixtureSubstitutionModel.

virtual std::string bpp::TransitionModel::getName ( ) const
pure virtualinherited

Get the name of the model.

The name of this model.

Implemented in bpp::YpR_Gen, bpp::YpR_Sym, bpp::FromMixtureSubstitutionModel, bpp::HKY85, bpp::F84, bpp::KroneckerCodonDistanceFrequenciesSubstitutionModel, bpp::AbstractFromSubstitutionModelTransitionModel, bpp::JCprot, bpp::T92, bpp::KroneckerCodonDistanceSubstitutionModel, bpp::K80, bpp::RE08, bpp::RN95, bpp::MixtureOfSubstitutionModels, bpp::GTR, bpp::TN93, bpp::JCnuc, bpp::CodonDistanceFrequenciesSubstitutionModel, bpp::KroneckerWordSubstitutionModel, bpp::RN95s, bpp::BinarySubstitutionModel, bpp::CodonDistancePhaseFrequenciesSubstitutionModel, bpp::MixtureOfASubstitutionModel, bpp::WordSubstitutionModel, bpp::CodonDistanceCpGSubstitutionModel, bpp::LLG08_EX3, bpp::UserProteinSubstitutionModel, bpp::LLG08_EHO, bpp::LLG08_UL3, bpp::CodonDistanceSubstitutionModel, bpp::LG10_EX_EHO, bpp::LGL08_CAT, bpp::LLG08_EX2, bpp::LLG08_UL2, bpp::SSR, bpp::WAG01, bpp::YNGP_M1, bpp::YNGP_M10, bpp::YNGP_M9, bpp::G2001, bpp::L95, bpp::CodonRateFrequenciesSubstitutionModel, bpp::YNGP_M8, bpp::DSO78, bpp::JTT92, bpp::GY94, bpp::SENCA, bpp::YNGP_M7, bpp::YNGP_M3, bpp::gBGC, bpp::LG08, bpp::YN98, bpp::YNGP_M2, bpp::KCM, bpp::TS98, bpp::TripletSubstitutionModel, bpp::CodonRateSubstitutionModel, bpp::MG94, bpp::Coala, bpp::LLG08_EX3::EmbeddedModel, bpp::LLG08_EHO::EmbeddedModel, bpp::LLG08_UL3::EmbeddedModel, bpp::LG10_EX_EHO::EmbeddedModel, bpp::LGL08_CAT::EmbeddedModel, bpp::LLG08_EX2::EmbeddedModel, and bpp::LLG08_UL2::EmbeddedModel.

Referenced by bpp::AbstractCodonFitnessSubstitutionModel::AbstractCodonFitnessSubstitutionModel(), bpp::AbstractFromSubstitutionModelTransitionModel::getName(), bpp::FromMixtureSubstitutionModel::getName(), bpp::MixtureOfSubstitutionModels::getSubmodelNumbers(), bpp::BppOSubstitutionModelFormat::read(), bpp::BppOSubstitutionModelFormat::readMixed_(), bpp::AbstractBiblioSubstitutionModel::updateMatrices(), and bpp::BppOSubstitutionModelFormat::write().

virtual size_t bpp::TransitionModel::getNumberOfStates ( ) const
pure virtualinherited

Get the number of states.

For most models, this equals the size of the alphabet.

See also
getAlphabetChars for the list of supported states.
The number of different states in the model.

Implemented in bpp::RE08Codon, bpp::RE08Protein, bpp::RE08Nucleotide, bpp::AbstractWordSubstitutionModel, bpp::AbstractMixedSubstitutionModel, bpp::RE08, bpp::MarkovModulatedSubstitutionModel, bpp::YpR, bpp::FromMixtureSubstitutionModel, bpp::AbstractBiblioSubstitutionModel, bpp::BinarySubstitutionModel, bpp::AbstractFromSubstitutionModelTransitionModel, bpp::gBGC, bpp::NucleotideSubstitutionModel, and bpp::ProteinSubstitutionModel.

Referenced by bpp::SubstitutionModelSet::addModel(), bpp::OneJumpSubstitutionCount::getAllNumbersOfSubstitutions(), bpp::AbstractFromSubstitutionModelTransitionModel::getNumberOfStates(), bpp::TwoTreeLikelihood::getNumberOfStates(), bpp::AbstractHomogeneousTreeLikelihood::getNumberOfStates(), bpp::AbstractBiblioSubstitutionModel::getNumberOfStates(), bpp::FromMixtureSubstitutionModel::getNumberOfStates(), bpp::BranchLikelihood::initModel(), bpp::RE08::RE08(), bpp::CategorySubstitutionRegister::setModelCategories(), bpp::UniformizationSubstitutionCount::setSubstitutionModel(), bpp::DecompositionSubstitutionCount::setSubstitutionModel(), bpp::DecompositionReward::setSubstitutionModel(), bpp::AbstractHomogeneousTreeLikelihood::setSubstitutionModel(), bpp::SimpleMutationProcess::SimpleMutationProcess(), and bpp::MarkovModulatedSubstitutionModel::updateMatrices().

virtual const Matrix<double>& bpp::SubstitutionModel::getRowLeftEigenVectors ( ) const
pure virtual
virtual double bpp::SubstitutionModel::getScale ( ) const
pure virtual

Get the scalar product of diagonal elements of the generator and the frequencies vector. If the generator is normalized, then scale=1. Otherwise each element must be multiplied by 1/scale.

Minus the scalar product of diagonal elements and the frequencies vector.

Implemented in bpp::AbstractSubstitutionModel, bpp::MarkovModulatedSubstitutionModel, bpp::AbstractBiblioSubstitutionModel, and bpp::FromMixtureSubstitutionModel.

Referenced by bpp::FromMixtureSubstitutionModel::getScale(), and bpp::AbstractBiblioSubstitutionModel::getScale().

virtual bool bpp::SubstitutionModel::isDiagonalizable ( ) const
pure virtual
virtual bool bpp::SubstitutionModel::isNonSingular ( ) const
pure virtual
virtual void bpp::TransitionModel::setFreqFromData ( const SequenceContainer data,
double  pseudoCount = 0 
pure virtualinherited
virtual void bpp::SubstitutionModel::setScalable ( bool  scalable)
pure virtual
virtual void bpp::SubstitutionModel::setScale ( double  scale)
pure virtual
virtual double bpp::SubstitutionModel::Sij ( size_t  i,
size_t  j 
) const
pure virtual

The documentation for this class was generated from the following file: