TreeParsimonyScore data structure.
More...
#include <Bpp/Phyl/Parsimony/TreeParsimonyData.h>
TreeParsimonyScore data structure.
Stores all the inner computations:
- subtree scores and ancestral states for each node,
- correspondance between sites in the dataset and array indices.
- See also
- TreeParsimonyNodeData
Definition at line 94 of file TreeParsimonyData.h.
◆ TreeParsimonyData()
bpp::TreeParsimonyData::TreeParsimonyData |
( |
| ) |
|
|
inline |
◆ ~TreeParsimonyData()
virtual bpp::TreeParsimonyData::~TreeParsimonyData |
( |
| ) |
|
|
inlinevirtual |
◆ clone()
◆ getArrayPosition()
virtual size_t bpp::TreeParsimonyData::getArrayPosition |
( |
int |
parentId, |
|
|
int |
sonId, |
|
|
size_t |
currentPosition |
|
) |
| const |
|
pure virtual |
◆ getNodeData() [1/2]
◆ getNodeData() [2/2]
◆ getRootArrayPosition()
virtual size_t bpp::TreeParsimonyData::getRootArrayPosition |
( |
size_t |
site | ) |
const |
|
pure virtual |
◆ getTree()
The documentation for this class was generated from the following file: