|
bpp-phyl3 3.0.0
|
The SingleProcessSubstitutionMapping class: substitution mapping linked with a SingleProcessPhyloLikelihood. More...
#include <Bpp/Phyl/Mapping/PhyloMappings/SingleProcessSubstitutionMapping.h>
Inheritance diagram for bpp::SingleProcessSubstitutionMapping:
Collaboration diagram for bpp::SingleProcessSubstitutionMapping:Public Types | |
| typedef AssociationTreeGlobalGraphObserver< uint, ModelBranch > | modelTree |
| typedef AssociationGraphObserver< N, E >::NodeIndex | NodeIndex |
| typedef AssociationGraphObserver< N, E >::EdgeIndex | EdgeIndex |
| typedef Graph::NodeId | NodeGraphid |
| typedef Graph::EdgeId | EdgeGraphid |
| typedef AssociationGraphObserver< N, E >::NodeIterator | NodeIterator |
| typedef AssociationGraphObserver< N, E >::EdgeIterator | EdgeIterator |
| typedef std::shared_ptr< E > | Eref |
| typedef std::shared_ptr< N > | Nref |
Public Member Functions | |
| SingleProcessSubstitutionMapping (std::shared_ptr< SingleProcessPhyloLikelihood > spp, std::shared_ptr< SubstitutionRegisterInterface > reg, std::shared_ptr< const AlphabetIndex2 > weights, std::shared_ptr< const AlphabetIndex2 > distances, double threshold=-1, bool verbose=true) | |
| SingleProcessSubstitutionMapping (const SingleProcessSubstitutionMapping &sppm) | |
| SingleProcessSubstitutionMapping & | operator= (const SingleProcessSubstitutionMapping &sppm) |
| virtual | ~SingleProcessSubstitutionMapping () |
| SingleProcessSubstitutionMapping * | clone () const |
| void | computeCounts (short unresolvedOption=SubstitutionMappingTools::UNRESOLVED_ZERO, double threshold=-1, bool verbose=true) |
| ComputeCounts. More... | |
| void | computeNormalizations (const ParameterList &nullParams, short unresolvedOption=SubstitutionMappingTools::UNRESOLVED_ZERO, bool verbose=true) |
| compute Normalizations More... | |
| size_t | getNumberOfModels () const |
| std::vector< size_t > | getModelNumbers () const |
| LikelihoodCalculationSingleProcess & | getLikelihoodCalculationSingleProcess () |
| const LikelihoodCalculationSingleProcess & | getLikelihoodCalculationSingleProcess () const |
| virtual std::shared_ptr< const TransitionModelInterface > | getModelForBranch (unsigned int branchId) const =0 |
| Get the model associated to a particular branch id. More... | |
| virtual std::shared_ptr< TransitionModelInterface > | getModelForBranch (unsigned int branchId)=0 |
| bool | isValid () const |
| std::shared_ptr< E > | getEdgeToFather (const std::shared_ptr< N > nodeObject) const |
| std::shared_ptr< E > | getEdgeToFather (const NodeIndex index) const |
| void | rootAt (const std::shared_ptr< N > root) |
| bool | isRooted () const |
| std::shared_ptr< N > | getFatherOfNode (const std::shared_ptr< N > nodeObject) const |
| bool | hasFather (const std::shared_ptr< N > nodeObject) const |
| bool | hasFather (const NodeIndex index) const |
| std::vector< std::shared_ptr< N > > | getSons (const std::shared_ptr< N > node) const |
| std::vector< NodeIndex > | getSons (const NodeIndex node) const |
| std::vector< std::shared_ptr< E > > | getBranches (const std::shared_ptr< N > node) const |
| std::vector< EdgeIndex > | getBranches (const NodeIndex node) const |
| std::shared_ptr< N > | getSon (const std::shared_ptr< E > edge) const |
| NodeIndex | getSon (const EdgeIndex edge) const |
| std::shared_ptr< N > | getFatherOfEdge (const std::shared_ptr< E > edge) const |
| NodeIndex | getFatherOfEdge (const EdgeIndex edge) const |
| size_t | getNumberOfSons (const std::shared_ptr< N > node) const |
| std::vector< std::shared_ptr< N > > | getLeavesUnderNode (std::shared_ptr< N > node) const |
| std::vector< NodeIndex > | getLeavesUnderNode (NodeIndex node) const |
| std::vector< std::shared_ptr< N > > | removeSons (const std::shared_ptr< N > node) |
| void | removeSon (const std::shared_ptr< N > node, const std::shared_ptr< N > son) |
| void | setFather (const std::shared_ptr< N > nodeObject, const std::shared_ptr< N > fatherNodeObject, const std::shared_ptr< E > edgeObject=0) |
| void | addSon (const std::shared_ptr< N > nodeObject, const std::shared_ptr< N > sonNodeObject, const std::shared_ptr< E > edgeObject=0) |
| std::unique_ptr< typename AssociationTreeGraphObserver< N, E >::NodeIterator > | sonsIterator (std::shared_ptr< N > node) |
| std::unique_ptr< typename AssociationTreeGraphObserver< N, E >::NodeIterator > | sonsIterator (std::shared_ptr< N > node) const |
| std::unique_ptr< typename AssociationTreeGraphObserver< N, E >::EdgeIterator > | branchesIterator (std::shared_ptr< N > node) |
| std::unique_ptr< typename AssociationTreeGraphObserver< N, E >::EdgeIterator > | branchesIterator (std::shared_ptr< N > node) const |
| std::vector< std::shared_ptr< N > > | getNodePathBetweenTwoNodes (const std::shared_ptr< N > nodeA, const std::shared_ptr< N > nodeB, bool includeAncestor=true) const |
| std::vector< NodeIndex > | getNodePathBetweenTwoNodes (const NodeIndex nodeA, const NodeIndex nodeB, bool includeAncestor=true) const |
| std::vector< std::shared_ptr< E > > | getEdgePathBetweenTwoNodes (const std::shared_ptr< N > nodeA, const std::shared_ptr< N > nodeB) const |
| std::vector< EdgeIndex > | getEdgePathBetweenTwoNodes (const NodeIndex nodeA, const NodeIndex nodeB, bool includeAncestor=true) const |
| std::vector< std::shared_ptr< N > > | getSubtreeNodes (const std::shared_ptr< N > localRoot) const |
| std::vector< NodeIndex > | getSubtreeNodes (const NodeIndex localRoot) const |
| std::vector< std::shared_ptr< E > > | getSubtreeEdges (const std::shared_ptr< N > localRoot) const |
| std::vector< EdgeIndex > | getSubtreeEdges (const NodeIndex localRoot) const |
| std::shared_ptr< N > | MRCA (const std::vector< std::shared_ptr< N > > vNodeObject) const |
| virtual void | createNode (std::shared_ptr< N > newNodeObject)=0 |
| virtual void | createNode (std::shared_ptr< N > objectOriginNode, std::shared_ptr< N > newNodeObject, std::shared_ptr< E > newEdgeObject=00)=0 |
| void | createNode (Nref nodeObject) |
| void | createNode (Nref objectOriginNode, Nref newNodeObject, Eref newEdgeObject=00) |
| virtual void | createNode (std::shared_ptr< N > newNodeObject)=0 |
| virtual void | createNode (std::shared_ptr< N > objectOriginNode, std::shared_ptr< N > newNodeObject, std::shared_ptr< E > newEdgeObject=00)=0 |
| void | createNode (Nref nodeObject) |
| void | createNode (Nref objectOriginNode, Nref newNodeObject, Eref newEdgeObject=00) |
| virtual void | link (std::shared_ptr< N > nodeObjectA, std::shared_ptr< N > nodeObjectB, std::shared_ptr< E > edgeObject=00)=0 |
| void | link (Nref nodeObjectA, Nref nodeObjectB, Eref edgeObject=00) |
| virtual void | link (std::shared_ptr< N > nodeObjectA, std::shared_ptr< N > nodeObjectB, std::shared_ptr< E > edgeObject=00)=0 |
| void | link (Nref nodeObjectA, Nref nodeObjectB, Eref edgeObject=00) |
| virtual void | unlink (std::shared_ptr< N > nodeObjectA, std::shared_ptr< N > nodeObjectB)=0 |
| void | unlink (Nref nodeObjectA, Nref nodeObjectB) |
| virtual void | unlink (std::shared_ptr< N > nodeObjectA, std::shared_ptr< N > nodeObjectB)=0 |
| void | unlink (Nref nodeObjectA, Nref nodeObjectB) |
| virtual void | deleteNode (std::shared_ptr< N > nodeObject)=0 |
| void | deleteNode (Nref nodeObject) |
| virtual void | deleteNode (std::shared_ptr< N > nodeObject)=0 |
| void | deleteNode (Nref nodeObject) |
| virtual void | associateNode (std::shared_ptr< N > nodeObject, NodeGraphid node)=0 |
| void | associateNode (Nref nodeObject, NodeGraphid graphNode) |
| virtual void | associateNode (std::shared_ptr< N > nodeObject, NodeGraphid node)=0 |
| void | associateNode (Nref nodeObject, NodeGraphid graphNode) |
| virtual void | associateEdge (std::shared_ptr< E > edgeObject, EdgeGraphid edge)=0 |
| void | associateEdge (Eref edgeObject, EdgeGraphid graphEdge) |
| virtual void | associateEdge (std::shared_ptr< E > edgeObject, EdgeGraphid edge)=0 |
| void | associateEdge (Eref edgeObject, EdgeGraphid graphEdge) |
| virtual void | dissociateNode (std::shared_ptr< N > nodeObject)=0 |
| void | dissociateNode (Nref nodeObject) |
| virtual void | dissociateNode (std::shared_ptr< N > nodeObject)=0 |
| void | dissociateNode (Nref nodeObject) |
| virtual void | dissociateEdge (std::shared_ptr< E > edgeObject)=0 |
| void | dissociateEdge (Eref edgeObject) |
| virtual void | dissociateEdge (std::shared_ptr< E > edgeObject)=0 |
| void | dissociateEdge (Eref edgeObject) |
| virtual NodeGraphid | getNodeGraphid (const std::shared_ptr< N > nodeObject) const=0 |
| NodeGraphid | getNodeGraphid (const Nref nodeObject) const |
| virtual NodeGraphid | getNodeGraphid (const std::shared_ptr< N > nodeObject) const=0 |
| NodeGraphid | getNodeGraphid (const Nref nodeObject) const |
| virtual EdgeGraphid | getEdgeGraphid (const std::shared_ptr< E > edgeObject) const=0 |
| EdgeGraphid | getEdgeGraphid (const Eref edgeObject) const |
| virtual EdgeGraphid | getEdgeGraphid (const std::shared_ptr< E > edgeObject) const=0 |
| EdgeGraphid | getEdgeGraphid (const Eref edgeObject) const |
| virtual const std::shared_ptr< N > | getNodeFromGraphid (NodeGraphid) const=0 |
| virtual std::shared_ptr< N > | getNodeFromGraphid (NodeGraphid)=0 |
| Nref | getNodeFromGraphid (NodeGraphid node) |
| const Nref | getNodeFromGraphid (NodeGraphid node) const |
| virtual const std::shared_ptr< N > | getNodeFromGraphid (NodeGraphid) const=0 |
| virtual std::shared_ptr< N > | getNodeFromGraphid (NodeGraphid)=0 |
| Nref | getNodeFromGraphid (NodeGraphid node) |
| const Nref | getNodeFromGraphid (NodeGraphid node) const |
| virtual std::vector< std::shared_ptr< N > > | getNodesFromGraphid (std::vector< NodeGraphid >) const=0 |
| std::vector< Nref > | getNodesFromGraphid (std::vector< NodeGraphid > nodes) const |
| virtual std::vector< std::shared_ptr< N > > | getNodesFromGraphid (std::vector< NodeGraphid >) const=0 |
| std::vector< Nref > | getNodesFromGraphid (std::vector< NodeGraphid > nodes) const |
| virtual std::shared_ptr< E > | getEdgeFromGraphid (EdgeGraphid)=0 |
| virtual const std::shared_ptr< E > | getEdgeFromGraphid (EdgeGraphid) const=0 |
| Eref | getEdgeFromGraphid (EdgeGraphid edge) |
| const Eref | getEdgeFromGraphid (EdgeGraphid edge) const |
| virtual std::shared_ptr< E > | getEdgeFromGraphid (EdgeGraphid)=0 |
| virtual const std::shared_ptr< E > | getEdgeFromGraphid (EdgeGraphid) const=0 |
| Eref | getEdgeFromGraphid (EdgeGraphid edge) |
| const Eref | getEdgeFromGraphid (EdgeGraphid edge) const |
| virtual std::vector< std::shared_ptr< E > > | getEdgesFromGraphid (std::vector< EdgeGraphid >) const=0 |
| std::vector< Eref > | getEdgesFromGraphid (std::vector< EdgeGraphid > edges) const |
| virtual std::vector< std::shared_ptr< E > > | getEdgesFromGraphid (std::vector< EdgeGraphid >) const=0 |
| std::vector< Eref > | getEdgesFromGraphid (std::vector< EdgeGraphid > edges) const |
| virtual std::shared_ptr< N > | getRoot () const=0 |
| Nref | getRoot () const |
| virtual std::shared_ptr< N > | getRoot () const=0 |
| Nref | getRoot () const |
| virtual NodeIndex | getRootIndex () const=0 |
| NodeIndex | getRootIndex () const |
| virtual NodeIndex | getRootIndex () const=0 |
| NodeIndex | getRootIndex () const |
| virtual bool | hasNodeIndex (const std::shared_ptr< N > nodeObject) const=0 |
| bool | hasNodeIndex (const Nref nodeObject) const |
| virtual bool | hasNodeIndex (const std::shared_ptr< N > nodeObject) const=0 |
| bool | hasNodeIndex (const Nref nodeObject) const |
| virtual bool | hasEdgeIndex (const std::shared_ptr< E > edgeObject) const=0 |
| bool | hasEdgeIndex (const Eref edgeObject) const |
| virtual bool | hasEdgeIndex (const std::shared_ptr< E > edgeObject) const=0 |
| bool | hasEdgeIndex (const Eref edgeObject) const |
| virtual NodeIndex | getNodeIndex (const std::shared_ptr< N > nodeObject) const=0 |
| NodeIndex | getNodeIndex (const Nref nodeObject) const |
| virtual NodeIndex | getNodeIndex (const std::shared_ptr< N > nodeObject) const=0 |
| NodeIndex | getNodeIndex (const Nref nodeObject) const |
| virtual std::vector< NodeIndex > | getNodeIndexes (std::vector< std::shared_ptr< N > > nodeObjects) const=0 |
| std::vector< NodeIndex > | getNodeIndexes (std::vector< Nref > nodes) const |
| virtual std::vector< NodeIndex > | getNodeIndexes (std::vector< std::shared_ptr< N > > nodeObjects) const=0 |
| std::vector< NodeIndex > | getNodeIndexes (std::vector< Nref > nodes) const |
| virtual EdgeIndex | getEdgeIndex (const std::shared_ptr< E > edgeObject) const=0 |
| EdgeIndex | getEdgeIndex (const Eref edgeObject) const |
| virtual EdgeIndex | getEdgeIndex (const std::shared_ptr< E > edgeObject) const=0 |
| EdgeIndex | getEdgeIndex (const Eref edgeObject) const |
| virtual std::vector< EdgeIndex > | getEdgeIndexes (std::vector< std::shared_ptr< E > > edgeObjects) const=0 |
| std::vector< EdgeIndex > | getEdgeIndexes (std::vector< Eref > edges) const |
| virtual std::vector< EdgeIndex > | getEdgeIndexes (std::vector< std::shared_ptr< E > > edgeObjects) const=0 |
| std::vector< EdgeIndex > | getEdgeIndexes (std::vector< Eref > edges) const |
| virtual NodeIndex | setNodeIndex (const std::shared_ptr< N > nodeObject, NodeIndex index)=0 |
| NodeIndex | setNodeIndex (const Nref nodeObject, NodeIndex index) |
| virtual NodeIndex | setNodeIndex (const std::shared_ptr< N > nodeObject, NodeIndex index)=0 |
| NodeIndex | setNodeIndex (const Nref nodeObject, NodeIndex index) |
| NodeIndex | setNodeIndex (const Nref nodeObject, NodeIndex index) |
| virtual EdgeIndex | setEdgeIndex (const std::shared_ptr< E > edgeObject, EdgeIndex index)=0 |
| EdgeIndex | setEdgeIndex (const Eref edgeObject, EdgeIndex index) |
| virtual EdgeIndex | setEdgeIndex (const std::shared_ptr< E > edgeObject, EdgeIndex index)=0 |
| EdgeIndex | setEdgeIndex (const Eref edgeObject, EdgeIndex index) |
| EdgeIndex | setEdgeIndex (const Eref edgeObject, EdgeIndex index) |
| virtual bool | hasNode (NodeIndex nodeIndex) const=0 |
| bool | hasNode (NodeIndex node) const |
| virtual bool | hasNode (NodeIndex nodeIndex) const=0 |
| bool | hasNode (Nref nodeObject) const |
| bool | hasNode (NodeIndex node) const |
| bool | hasNode (NodeIndex node) const |
| virtual bool | hasEdge (EdgeIndex edgeIndex) const=0 |
| bool | hasEdge (EdgeIndex edge) const |
| virtual bool | hasEdge (EdgeIndex edgeIndex) const=0 |
| bool | hasEdge (Eref edgeObject) const |
| bool | hasEdge (EdgeIndex edge) const |
| bool | hasEdge (EdgeIndex edge) const |
| virtual std::shared_ptr< N > | getNode (NodeIndex nodeIndex) const=0 |
| Nref | getNode (NodeIndex node) const |
| virtual std::shared_ptr< N > | getNode (NodeIndex nodeIndex) const=0 |
| Nref | getNode (NodeIndex node) const |
| Nref | getNode (NodeIndex node) const |
| virtual std::shared_ptr< E > | getEdge (EdgeIndex edgeIndex) const=0 |
| Eref | getEdge (EdgeIndex edge) const |
| virtual std::shared_ptr< E > | getEdge (EdgeIndex edgeIndex) const=0 |
| Eref | getEdge (EdgeIndex edge) const |
| Eref | getEdge (EdgeIndex edge) const |
| virtual std::unique_ptr< NodeIterator > | allNodesIterator ()=0 |
| virtual std::unique_ptr< NodeIterator > | allNodesIterator () const=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | allNodesIterator () |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | allNodesIterator () const |
| virtual std::unique_ptr< NodeIterator > | allNodesIterator ()=0 |
| virtual std::unique_ptr< NodeIterator > | allNodesIterator () const=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | allNodesIterator () |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | allNodesIterator () const |
| virtual std::unique_ptr< NodeIterator > | outgoingNeighborNodesIterator (std::shared_ptr< N > node)=0 |
| virtual std::unique_ptr< NodeIterator > | outgoingNeighborNodesIterator (std::shared_ptr< N > node) const=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | outgoingNeighborNodesIterator (Nref node) |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | outgoingNeighborNodesIterator (Nref node) const |
| virtual std::unique_ptr< NodeIterator > | outgoingNeighborNodesIterator (std::shared_ptr< N > node)=0 |
| virtual std::unique_ptr< NodeIterator > | outgoingNeighborNodesIterator (std::shared_ptr< N > node) const=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | outgoingNeighborNodesIterator (Nref node) |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | outgoingNeighborNodesIterator (Nref node) const |
| virtual std::unique_ptr< NodeIterator > | incomingNeighborNodesIterator (std::shared_ptr< N > node)=0 |
| virtual std::unique_ptr< NodeIterator > | incomingNeighborNodesIterator (std::shared_ptr< N > node) const=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | incomingNeighborNodesIterator (Nref node) |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | incomingNeighborNodesIterator (Nref node) const |
| virtual std::unique_ptr< NodeIterator > | incomingNeighborNodesIterator (std::shared_ptr< N > node)=0 |
| virtual std::unique_ptr< NodeIterator > | incomingNeighborNodesIterator (std::shared_ptr< N > node) const=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | incomingNeighborNodesIterator (Nref node) |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIterator > | incomingNeighborNodesIterator (Nref node) const |
| virtual std::vector< std::shared_ptr< N > > | getNeighbors (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< NodeIndex > | getNeighbors (NodeIndex node) const=0 |
| std::vector< Nref > | getNeighbors (const Nref node) const |
| std::vector< NodeIndex > | getNeighbors (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< N > > | getNeighbors (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< NodeIndex > | getNeighbors (NodeIndex node) const=0 |
| std::vector< Nref > | getNeighbors (const Nref node) const |
| std::vector< NodeIndex > | getNeighbors (NodeIndex node) const |
| std::vector< NodeIndex > | getNeighbors (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< E > > | getEdges (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< EdgeIndex > | getEdges (NodeIndex node) const=0 |
| std::vector< Eref > | getEdges (const Nref node) const |
| std::vector< EdgeIndex > | getEdges (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< E > > | getEdges (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< EdgeIndex > | getEdges (NodeIndex node) const=0 |
| std::vector< Eref > | getEdges (const Nref node) const |
| std::vector< EdgeIndex > | getEdges (NodeIndex node) const |
| std::vector< EdgeIndex > | getEdges (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< N > > | getOutgoingNeighbors (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< NodeIndex > | getOutgoingNeighbors (NodeIndex node) const=0 |
| std::vector< Nref > | getOutgoingNeighbors (const Nref node) const |
| std::vector< NodeIndex > | getOutgoingNeighbors (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< N > > | getOutgoingNeighbors (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< NodeIndex > | getOutgoingNeighbors (NodeIndex node) const=0 |
| std::vector< Nref > | getOutgoingNeighbors (const Nref node) const |
| std::vector< NodeIndex > | getOutgoingNeighbors (NodeIndex node) const |
| std::vector< NodeIndex > | getOutgoingNeighbors (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< E > > | getOutgoingEdges (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< EdgeIndex > | getOutgoingEdges (NodeIndex node) const=0 |
| std::vector< Eref > | getOutgoingEdges (const Nref node) const |
| std::vector< EdgeIndex > | getOutgoingEdges (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< E > > | getOutgoingEdges (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< EdgeIndex > | getOutgoingEdges (NodeIndex node) const=0 |
| std::vector< Eref > | getOutgoingEdges (const Nref node) const |
| std::vector< EdgeIndex > | getOutgoingEdges (NodeIndex node) const |
| std::vector< EdgeIndex > | getOutgoingEdges (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< N > > | getIncomingNeighbors (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< NodeIndex > | getIncomingNeighbors (NodeIndex node) const=0 |
| std::vector< Nref > | getIncomingNeighbors (const Nref node) const |
| std::vector< NodeIndex > | getIncomingNeighbors (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< N > > | getIncomingNeighbors (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< NodeIndex > | getIncomingNeighbors (NodeIndex node) const=0 |
| std::vector< Nref > | getIncomingNeighbors (const Nref node) const |
| std::vector< NodeIndex > | getIncomingNeighbors (NodeIndex node) const |
| std::vector< NodeIndex > | getIncomingNeighbors (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< E > > | getIncomingEdges (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< EdgeIndex > | getIncomingEdges (NodeIndex node) const=0 |
| std::vector< Eref > | getIncomingEdges (const Nref node) const |
| std::vector< EdgeIndex > | getIncomingEdges (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< E > > | getIncomingEdges (const std::shared_ptr< N > node) const=0 |
| virtual std::vector< EdgeIndex > | getIncomingEdges (NodeIndex node) const=0 |
| std::vector< Eref > | getIncomingEdges (const Nref node) const |
| std::vector< EdgeIndex > | getIncomingEdges (NodeIndex node) const |
| std::vector< EdgeIndex > | getIncomingEdges (NodeIndex node) const |
| virtual std::vector< std::shared_ptr< N > > | getLeavesFromNode (std::shared_ptr< N > node, unsigned int maxDepth) const=0 |
| std::vector< Nref > | getLeavesFromNode (Nref node, unsigned int maxDepth) const |
| virtual std::vector< std::shared_ptr< N > > | getLeavesFromNode (std::shared_ptr< N > node, unsigned int maxDepth) const=0 |
| std::vector< Nref > | getLeavesFromNode (Nref node, unsigned int maxDepth) const |
| virtual std::vector< std::shared_ptr< N > > | getAllLeaves () const=0 |
| std::vector< Nref > | getAllLeaves () const |
| virtual std::vector< std::shared_ptr< N > > | getAllLeaves () const=0 |
| std::vector< Nref > | getAllLeaves () const |
| virtual std::vector< NodeIndex > | getAllLeavesIndexes () const=0 |
| std::vector< NodeIndex > | getAllLeavesIndexes () const |
| virtual std::vector< NodeIndex > | getAllLeavesIndexes () const=0 |
| std::vector< NodeIndex > | getAllLeavesIndexes () const |
| virtual std::vector< std::shared_ptr< N > > | getAllInnerNodes () const=0 |
| std::vector< Nref > | getAllInnerNodes () const |
| virtual std::vector< std::shared_ptr< N > > | getAllInnerNodes () const=0 |
| std::vector< Nref > | getAllInnerNodes () const |
| virtual std::vector< NodeIndex > | getAllInnerNodesIndexes () const=0 |
| std::vector< NodeIndex > | getAllInnerNodesIndexes () const |
| virtual std::vector< NodeIndex > | getAllInnerNodesIndexes () const=0 |
| std::vector< NodeIndex > | getAllInnerNodesIndexes () const |
| virtual std::vector< std::shared_ptr< N > > | getAllNodes () const=0 |
| std::vector< Nref > | getAllNodes () const |
| virtual std::vector< std::shared_ptr< N > > | getAllNodes () const=0 |
| std::vector< Nref > | getAllNodes () const |
| virtual std::vector< NodeIndex > | getAllNodesIndexes () const=0 |
| std::vector< NodeIndex > | getAllNodesIndexes () const |
| virtual std::vector< NodeIndex > | getAllNodesIndexes () const=0 |
| std::vector< NodeIndex > | getAllNodesIndexes () const |
| virtual std::unique_ptr< EdgeIterator > | allEdgesIterator ()=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | allEdgesIterator () |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | allEdgesIterator () const |
| virtual std::unique_ptr< EdgeIterator > | allEdgesIterator ()=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | allEdgesIterator () |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | allEdgesIterator () const |
| virtual std::unique_ptr< EdgeIterator > | outgoingEdgesIterator (std::shared_ptr< N > node)=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | outgoingEdgesIterator (Nref node) |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | outgoingEdgesIterator (Nref node) const |
| virtual std::unique_ptr< EdgeIterator > | outgoingEdgesIterator (std::shared_ptr< N > node)=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | outgoingEdgesIterator (Nref node) |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | outgoingEdgesIterator (Nref node) const |
| virtual std::unique_ptr< EdgeIterator > | incomingEdgesIterator (std::shared_ptr< N > node)=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | incomingEdgesIterator (Nref node) |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | incomingEdgesIterator (Nref node) const |
| virtual std::unique_ptr< EdgeIterator > | incomingEdgesIterator (std::shared_ptr< N > node)=0 |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | incomingEdgesIterator (Nref node) |
| std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIterator > | incomingEdgesIterator (Nref node) const |
| virtual std::vector< std::shared_ptr< E > > | getAllEdges () const=0 |
| std::vector< Eref > | getAllEdges () const |
| virtual std::vector< std::shared_ptr< E > > | getAllEdges () const=0 |
| std::vector< Eref > | getAllEdges () const |
| virtual std::vector< EdgeIndex > | getAllEdgesIndexes () const=0 |
| std::vector< EdgeIndex > | getAllEdgesIndexes () const |
| virtual std::vector< EdgeIndex > | getAllEdgesIndexes () const=0 |
| std::vector< EdgeIndex > | getAllEdgesIndexes () const |
| virtual std::shared_ptr< E > | getEdgeLinking (std::shared_ptr< N > nodeA, std::shared_ptr< N > nodeB) const=0 |
| Eref | getEdgeLinking (Nref nodeA, Nref nodeB) const |
| virtual std::shared_ptr< E > | getEdgeLinking (std::shared_ptr< N > nodeA, std::shared_ptr< N > nodeB) const=0 |
| Eref | getEdgeLinking (Nref nodeA, Nref nodeB) const |
| virtual void | setEdgeLinking (std::shared_ptr< N > nodeA, std::shared_ptr< N > nodeB, std::shared_ptr< E > edge)=0 |
| void | setEdgeLinking (Nref nodeA, Nref nodeB, Eref edge) |
| virtual void | setEdgeLinking (std::shared_ptr< N > nodeA, std::shared_ptr< N > nodeB, std::shared_ptr< E > edge)=0 |
| void | setEdgeLinking (Nref nodeA, Nref nodeB, Eref edge) |
| virtual void | deletedEdgesUpdate (const std::vector< unsigned int > &edgesToDelete)=0 |
| void | deletedEdgesUpdate (const std::vector< unsigned int > &edgesToDelete) |
| virtual void | deletedEdgesUpdate (const std::vector< unsigned int > &edgesToDelete)=0 |
| void | deletedEdgesUpdate (const std::vector< unsigned int > &edgesToDelete) |
| virtual void | deletedNodesUpdate (const std::vector< unsigned int > &nodesToDelete)=0 |
| void | deletedNodesUpdate (const std::vector< unsigned int > &nodesToDelete) |
| virtual void | deletedNodesUpdate (const std::vector< unsigned int > &nodesToDelete)=0 |
| void | deletedNodesUpdate (const std::vector< unsigned int > &nodesToDelete) |
| NodeIndex | addNodeIndex (const Nref nodeObject) |
| NodeIndex | addNodeIndex (const Nref nodeObject) |
| EdgeIndex | addEdgeIndex (const Eref edgeObject) |
| EdgeIndex | addEdgeIndex (const Eref edgeObject) |
| void | setRoot (const Nref newRoot) |
| void | setRoot (const Nref newRoot) |
| void | outputToDot (const std::string &fname, const std::string &name) const |
| void | outputToDot (std::ostream &out, const std::string &name) const |
| void | outputToDot (const std::string &fname, const std::string &name) const |
| void | outputToDot (std::ostream &out, const std::string &name) const |
| bool | isLeaf (const Nref node) const |
| bool | isLeaf (const NodeIndex nodeid) const |
| bool | isLeaf (const Nref node) const |
| bool | isLeaf (const NodeIndex nodeid) const |
| bool | isLeaf (const NodeIndex nodeid) const |
| std::pair< Nref, Nref > | getNodes (Eref edge) const |
| std::pair< Nref, Nref > | getNodes (Eref edge) const |
| size_t | getNumberOfNodes () const |
| size_t | getNumberOfNodes () const |
| size_t | getNumberOfEdges () const |
| size_t | getNumberOfEdges () const |
| size_t | getNumberOfLeaves () const |
| size_t | getNumberOfLeaves () const |
| size_t | getDegree (const Nref node) const |
| size_t | getDegree (const Nref node) const |
| const std::shared_ptr< TreeGraphImpl > | getGraph () const |
| std::shared_ptr< TreeGraphImpl > | getGraph () |
| std::string | nodeToString (const Nref nodeObject) const |
| std::string | edgeToString (const Eref edgeObject) const |
| std::shared_ptr< TransitionModelInterface > | getModelForBranch (uint branchId) override |
| From BranchedModelSet. More... | |
| std::shared_ptr< const TransitionModelInterface > | getModelForBranch (uint branchId) const override |
| std::shared_ptr< const TransitionModelInterface > | getModel (unsigned int branchId, size_t classIndex) const override |
| Get the substitution model corresponding to a certain branch and model class. More... | |
| std::shared_ptr< TransitionModelInterface > | getModel (size_t index) |
| std::shared_ptr< const TransitionModelInterface > | getModel (size_t index) const override |
| Get the model with a ginev index. More... | |
| std::vector< uint > | getBranchesWithModel (size_t index) const override |
| Get a list of branches id for which the given model is associated. More... | |
| bool | normalizationsPerformed () const override |
| From PhyloSubstitutionMapping. More... | |
| ProbabilisticSubstitutionMapping & | normalizations () override |
| Return the tree of factors. More... | |
| const ProbabilisticSubstitutionMapping & | normalizations () const override |
| bool | countsPerformed () const override |
| return if counts have been performed. More... | |
| ProbabilisticSubstitutionMapping & | counts () override |
| Return the tree of counts. More... | |
| const ProbabilisticSubstitutionMapping & | counts () const override |
| void | setSubstitutionRegister (std::shared_ptr< const SubstitutionRegisterInterface > reg) |
| For registers. More... | |
| const SubstitutionRegisterInterface & | substitutionRegister () const |
| std::shared_ptr< const SubstitutionRegisterInterface > | getSubstitutionRegister () const |
| bool | matchParametersValues (const ParameterList &nullParams) override |
| Checks and sets the models with given parameters. More... | |
| const ParameterList & | getParameters () const override |
| Gets the parameters. More... | |
| std::shared_ptr< const AlphabetIndex2 > | getWeights () const |
| std::shared_ptr< const AlphabetIndex2 > | getDistances () const |
| void | addModel (size_t index, const TransitionModelInterface &model, Vuint brIds) |
| add a Substitution Model in the map, and on all branches with given Ids. More... | |
| void | setDistances (const AlphabetIndex2 &ndist) override |
| change Distances More... | |
Static Public Member Functions | |
| static B * | copy (const A &a, typename std::enable_if< !std::is_base_of< B, A >::value &&!std::is_abstract< B >::value, B * >::type *=0) |
| static B * | copy (const A &a, typename std::enable_if< !std::is_base_of< B, A >::value &&std::is_abstract< B >::value, B * >::type *=0) |
| static B * | copy (const A &a, typename std::enable_if< std::is_base_of< B, A >::value &&!std::is_abstract< A >::value, B * >::type *=0) |
| static B * | copy (const A &a, typename std::enable_if< std::is_base_of< B, A >::value &&std::is_abstract< A >::value &&std::is_base_of< Clonable, A >::value, B * >::type *=0) |
| static B * | copy (const A &a, typename std::enable_if< std::is_base_of< B, A >::value &&std::is_abstract< A >::value &&!std::is_base_of< Clonable, A >::value, B * >::type *=0) |
| static B * | copy (const A &a, typename std::enable_if< std::is_base_of< B, A >::value &&std::is_abstract< A >::value &&std::is_base_of< Clonable, A >::value, B * >::type *=0) |
| static B * | copy (const A &a, typename std::enable_if< std::is_base_of< B, A >::value &&std::is_abstract< A >::value &&!std::is_base_of< Clonable, A >::value, B * >::type *=0) |
Protected Attributes | |
| std::unique_ptr< ProbabilisticSubstitutionMapping > | counts_ |
| std::unique_ptr< ProbabilisticSubstitutionMapping > | factors_ |
| std::shared_ptr< TreeGraphImpl > | subjectGraph_ |
Private Types | |
| enum | neighborType |
Private Member Functions | |
| void | setBranchedModelSet_ () |
| Set the models of the BranchedModelSet to the adhoc branches, for normalization. More... | |
| std::vector< Nref > | getNeighbors_ (const Nref nodeObject, neighborType type) const |
| std::vector< Eref > | getEdges_ (const Nref nodeObject, neighborType type) const |
Private Attributes | |
| std::shared_ptr< SingleProcessPhyloLikelihood > | pSPP_ |
| std::shared_ptr< const SubstitutionRegisterInterface > | pReg_ |
| std::shared_ptr< const AlphabetIndex2 > | weights_ |
| weights of the substitutions. If null, no weights are used. More... | |
| std::shared_ptr< const AlphabetIndex2 > | distances_ |
| distances of the substitutions. If null, no distances are used. More... | |
| ParametrizableCollection< TransitionModelInterface > | modelColl_ |
| A collection of Transition Models. More... | |
| std::map< size_t, std::vector< uint > > | mModBrid_ |
| a map <model index, vector of branch ids> More... | |
| INCOMING | |
| OUTGOING | |
| BOTH | |
| std::vector< Nref > | graphidToN_ |
| std::vector< Eref > | graphidToE_ |
| std::map< Nref, NodeGraphid > | NToGraphid_ |
| std::map< Eref, EdgeGraphid > | EToGraphid_ |
| std::vector< Nref > | indexToN_ |
| std::vector< Eref > | indexToE_ |
| std::map< Nref, NodeIndex > | NToIndex_ |
| std::map< Eref, EdgeIndex > | EToIndex_ |
The SingleProcessSubstitutionMapping class: substitution mapping linked with a SingleProcessPhyloLikelihood.
Definition at line 25 of file SingleProcessSubstitutionMapping.h.
|
inherited |
Definition at line 35 of file AbstractSinglePhyloSubstitutionMapping.h.
| SingleProcessSubstitutionMapping::SingleProcessSubstitutionMapping | ( | std::shared_ptr< SingleProcessPhyloLikelihood > | spp, |
| std::shared_ptr< SubstitutionRegisterInterface > | reg, | ||
| std::shared_ptr< const AlphabetIndex2 > | weights, | ||
| std::shared_ptr< const AlphabetIndex2 > | distances, | ||
| double | threshold = -1, |
||
| bool | verbose = true |
||
| ) |
Definition at line 10 of file SingleProcessSubstitutionMapping.cpp.
References bpp::AssociationTreeGraphImplObserver< class, class, class >::allEdgesIterator(), bpp::AssociationTreeGraphImplObserver< class, class, class >::allNodesIterator(), bpp::AssociationTreeGraphImplObserver< class, class, class >::getEdgeGraphid(), bpp::AssociationTreeGraphImplObserver< class, class, class >::getNodeGraphid(), setBranchedModelSet_(), bpp::AssociationTreeGraphImplObserver< class, class, class >::setEdgeIndex(), and bpp::AssociationTreeGraphImplObserver< class, class, class >::setNodeIndex().
Referenced by clone().
|
inline |
Definition at line 47 of file SingleProcessSubstitutionMapping.h.
|
inlinevirtual |
Definition at line 59 of file SingleProcessSubstitutionMapping.h.
|
inherited |
add a Substitution Model in the map, and on all branches with given Ids.
| index | the index of the model |
| model | the model that will be COPIED. |
| brIds | the Ids of the branches that will carry this model. |
Definition at line 95 of file AbstractSinglePhyloSubstitutionMapping.cpp.
References bpp::AssociationTreeGraphImplObserver< class, class, class >::associateEdge(), bpp::TransitionModelInterface::clone(), bpp::AbstractSinglePhyloSubstitutionMapping::mModBrid_, and bpp::AbstractSinglePhyloSubstitutionMapping::modelColl_.
Referenced by bpp::OneProcessSequenceSubstitutionMapping::setBranchedModelSet_(), and setBranchedModelSet_().
|
inlinevirtual |
Reimplemented from bpp::AssociationTreeGraphImplObserver< class, class, class >.
Definition at line 61 of file SingleProcessSubstitutionMapping.h.
References SingleProcessSubstitutionMapping().
|
inlinevirtual |
ComputeCounts.
| unresolvedOption | mgmt of gaps in the counts (default: counted as zeros) |
| threshold | |
| verbose |
Implements bpp::PhyloSubstitutionMapping.
Definition at line 70 of file SingleProcessSubstitutionMapping.h.
References bpp::SubstitutionMappingTools::computeCounts(), bpp::AbstractSinglePhyloSubstitutionMapping::counts_, bpp::AbstractSinglePhyloSubstitutionMapping::getDistances(), getLikelihoodCalculationSingleProcess(), bpp::AbstractSinglePhyloSubstitutionMapping::getSubstitutionRegister(), and bpp::AbstractSinglePhyloSubstitutionMapping::getWeights().
|
virtual |
compute Normalizations
| nullParams | a list of null parameters |
| unresolvedOption | mgmt of gaps in the counts (default: counted as zeros) |
| verbose |
Implements bpp::PhyloSubstitutionMapping.
Definition at line 46 of file SingleProcessSubstitutionMapping.cpp.
References bpp::SubstitutionMappingTools::computeNormalizations(), bpp::AbstractSinglePhyloSubstitutionMapping::factors_, bpp::AbstractSinglePhyloSubstitutionMapping::getDistances(), getLikelihoodCalculationSingleProcess(), bpp::AbstractSinglePhyloSubstitutionMapping::getSubstitutionRegister(), and bpp::AbstractSinglePhyloSubstitutionMapping::matchParametersValues().
|
inlineoverridevirtualinherited |
Implements bpp::PhyloSubstitutionMapping.
Definition at line 157 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::counts_.
|
inlineoverridevirtualinherited |
Return the tree of counts.
Implements bpp::PhyloSubstitutionMapping.
Definition at line 152 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::counts_.
|
inlineoverridevirtualinherited |
return if counts have been performed.
Implements bpp::PhyloSubstitutionMapping.
Definition at line 147 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::counts_.
|
inlineoverridevirtualinherited |
Get a list of branches id for which the given model is associated.
| index | The index of the model. |
Implements bpp::BranchedModelSet.
Definition at line 114 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::mModBrid_.
|
inlineinherited |
Definition at line 196 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::distances_.
Referenced by computeCounts(), bpp::OneProcessSequenceSubstitutionMapping::computeCounts(), computeNormalizations(), and bpp::OneProcessSequenceSubstitutionMapping::computeNormalizations().
|
inline |
Definition at line 108 of file SingleProcessSubstitutionMapping.h.
References pSPP_.
Referenced by computeCounts(), and computeNormalizations().
|
inline |
Definition at line 113 of file SingleProcessSubstitutionMapping.h.
References pSPP_.
|
inlineinherited |
Definition at line 104 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::modelColl_.
|
inlineoverridevirtualinherited |
Get the model with a ginev index.
| index | The index of the query model. |
Implements bpp::BranchedModelSet.
Definition at line 109 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::modelColl_.
|
inlineoverridevirtualinherited |
Get the substitution model corresponding to a certain branch and model class.
| branchId | The id of the branch. |
| classIndex | The model class index. |
Implements bpp::PhyloSubstitutionMapping.
Definition at line 99 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AssociationTreeGraphImplObserver< class, class, class >::getEdge().
|
inlineoverrideinherited |
Definition at line 94 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AssociationTreeGraphImplObserver< class, class, class >::getEdge().
|
inlineoverrideinherited |
From BranchedModelSet.
Definition at line 89 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AssociationTreeGraphImplObserver< class, class, class >::getEdge().
|
pure virtualinherited |
Get the model associated to a particular branch id.
| branchId | The id of the query branch. |
| Exception | If no model is found for this branch. |
|
pure virtualinherited |
|
inlinevirtual |
Implements bpp::BranchedModelSet.
Definition at line 103 of file SingleProcessSubstitutionMapping.h.
References pSPP_.
|
inlinevirtual |
Implements bpp::BranchedModelSet.
Definition at line 98 of file SingleProcessSubstitutionMapping.h.
References pSPP_.
|
inlineoverridevirtualinherited |
Gets the parameters.
Implements bpp::PhyloSubstitutionMapping.
Definition at line 186 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::modelColl_.
|
inlineinherited |
Definition at line 176 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::pReg_.
Referenced by computeCounts(), bpp::OneProcessSequenceSubstitutionMapping::computeCounts(), computeNormalizations(), and bpp::OneProcessSequenceSubstitutionMapping::computeNormalizations().
|
inlineinherited |
Definition at line 191 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::weights_.
Referenced by computeCounts(), and bpp::OneProcessSequenceSubstitutionMapping::computeCounts().
|
inlineoverridevirtualinherited |
Checks and sets the models with given parameters.
Implements bpp::PhyloSubstitutionMapping.
Definition at line 181 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::modelColl_.
Referenced by computeNormalizations(), and bpp::OneProcessSequenceSubstitutionMapping::computeNormalizations().
|
inlineoverridevirtualinherited |
Implements bpp::PhyloSubstitutionMapping.
Definition at line 142 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::factors_.
|
inlineoverridevirtualinherited |
Return the tree of factors.
Implements bpp::PhyloSubstitutionMapping.
Definition at line 137 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::factors_.
|
inlineoverridevirtualinherited |
From PhyloSubstitutionMapping.
Return the tree of factors
Implements bpp::PhyloSubstitutionMapping.
Definition at line 132 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::factors_.
|
inline |
Definition at line 52 of file SingleProcessSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::operator=(), and pSPP_.
|
private |
Set the models of the BranchedModelSet to the adhoc branches, for normalization.
Definition at line 61 of file SingleProcessSubstitutionMapping.cpp.
References bpp::AbstractSinglePhyloSubstitutionMapping::addModel(), bpp::SubstitutionProcessInterface::getModelNumbers(), bpp::SubstitutionProcessInterface::getNodesWithModel(), bpp::SubstitutionProcessInterface::model(), and pSPP_.
Referenced by SingleProcessSubstitutionMapping().
|
inlineoverridevirtualinherited |
change Distances
Implements bpp::PhyloSubstitutionMapping.
Definition at line 216 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AlphabetIndex2::clone(), and bpp::AbstractSinglePhyloSubstitutionMapping::distances_.
|
inlineinherited |
For registers.
Definition at line 166 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::pReg_.
|
inlineinherited |
Definition at line 171 of file AbstractSinglePhyloSubstitutionMapping.h.
References bpp::AbstractSinglePhyloSubstitutionMapping::pReg_.
|
protectedinherited |
Definition at line 53 of file AbstractSinglePhyloSubstitutionMapping.h.
Referenced by computeCounts(), bpp::OneProcessSequenceSubstitutionMapping::computeCounts(), bpp::AbstractSinglePhyloSubstitutionMapping::counts(), bpp::AbstractSinglePhyloSubstitutionMapping::countsPerformed(), and bpp::AbstractSinglePhyloSubstitutionMapping::operator=().
|
privateinherited |
distances of the substitutions. If null, no distances are used.
Definition at line 50 of file AbstractSinglePhyloSubstitutionMapping.h.
Referenced by bpp::AbstractSinglePhyloSubstitutionMapping::getDistances(), bpp::AbstractSinglePhyloSubstitutionMapping::operator=(), and bpp::AbstractSinglePhyloSubstitutionMapping::setDistances().
|
protectedinherited |
Definition at line 54 of file AbstractSinglePhyloSubstitutionMapping.h.
Referenced by computeNormalizations(), bpp::OneProcessSequenceSubstitutionMapping::computeNormalizations(), bpp::AbstractSinglePhyloSubstitutionMapping::normalizations(), bpp::AbstractSinglePhyloSubstitutionMapping::normalizationsPerformed(), and bpp::AbstractSinglePhyloSubstitutionMapping::operator=().
|
privateinherited |
a map <model index, vector of branch ids>
Definition at line 67 of file AbstractSinglePhyloSubstitutionMapping.h.
Referenced by bpp::AbstractSinglePhyloSubstitutionMapping::addModel(), bpp::AbstractSinglePhyloSubstitutionMapping::getBranchesWithModel(), and bpp::AbstractSinglePhyloSubstitutionMapping::operator=().
|
privateinherited |
A collection of Transition Models.
Definition at line 60 of file AbstractSinglePhyloSubstitutionMapping.h.
Referenced by bpp::AbstractSinglePhyloSubstitutionMapping::AbstractSinglePhyloSubstitutionMapping(), bpp::AbstractSinglePhyloSubstitutionMapping::addModel(), bpp::AbstractSinglePhyloSubstitutionMapping::getModel(), bpp::AbstractSinglePhyloSubstitutionMapping::getParameters(), bpp::AbstractSinglePhyloSubstitutionMapping::matchParametersValues(), and bpp::AbstractSinglePhyloSubstitutionMapping::operator=().
|
privateinherited |
Definition at line 38 of file AbstractSinglePhyloSubstitutionMapping.h.
Referenced by bpp::AbstractSinglePhyloSubstitutionMapping::getSubstitutionRegister(), bpp::AbstractSinglePhyloSubstitutionMapping::operator=(), bpp::AbstractSinglePhyloSubstitutionMapping::setSubstitutionRegister(), and bpp::AbstractSinglePhyloSubstitutionMapping::substitutionRegister().
|
private |
Definition at line 30 of file SingleProcessSubstitutionMapping.h.
Referenced by getLikelihoodCalculationSingleProcess(), getModelNumbers(), getNumberOfModels(), operator=(), and setBranchedModelSet_().
|
privateinherited |
weights of the substitutions. If null, no weights are used.
Definition at line 44 of file AbstractSinglePhyloSubstitutionMapping.h.
Referenced by bpp::AbstractSinglePhyloSubstitutionMapping::getWeights(), and bpp::AbstractSinglePhyloSubstitutionMapping::operator=().