|
using | bpp::SpeciationForward = CWiseMul< MatrixLik, ReductionOf< MatrixLik > > |
|
using | bpp::MixtureForward = CWiseAdd< MatrixLik, ReductionOf< MatrixLik > > |
|
using | bpp::ForwardTransition = MatrixProduct< MatrixLik, Eigen::MatrixXd, MatrixLik > |
| forwardLikelihood = f(transitionMatrix, conditionalLikelihood). More...
|
|
using | bpp::ForwardTransitionFunction = CWiseApply< MatrixLik, MatrixLik, TransitionFunction > |
|
using | bpp::ForwardProportion = CWiseMul< MatrixLik, std::tuple< double, MatrixLik > > |
| forwardLikelihood = f(transitionMatrix, proportion). More...
|
|
using | bpp::ConditionalLikelihoodForward = Value< MatrixLik > |
| Interface LikelihoodTree data structure. More...
|
|
using | bpp::ConditionalLikelihoodForwardRef = ValueRef< MatrixLik > |
|
using | bpp::ForwardLikelihoodBelow = Value< MatrixLik > |
|
using | bpp::ForwardLikelihoodBelowRef = ValueRef< MatrixLik > |
|
using | bpp::DAGindexes = std::vector< uint > |
| Helper: create a map with mutable dataflow nodes for each branch of the tree. The map is indexed by branch ids. More...
|
|
using | bpp::Speciesindex = uint |
|
using | bpp::Proba = Value< double > |
| DAG with the same shape as ForwardLikelihoodTree with computations of probabilities of nodes & branches. More...
|
|
using | bpp::ProbaRef = std::shared_ptr< Value< double > > |
|
using | bpp::DAProb = AssociationDAGlobalGraphObserver< Proba, Proba > |
|
using | bpp::ProbaMul = CWiseMul< double, std::tuple< double, double > > |
|
using | bpp::ProbaSum = CWiseAdd< double, ReductionOf< double > > |
|