|
size_t | rf_distance_absolute (Tree const &lhs, Tree const &rhs) |
| Compute the absolute RF (Robinson-Foulds) distance metric between two Trees. More...
|
|
std::vector< size_t > | rf_distance_absolute (Tree const &lhs, TreeSet const &rhs) |
| Compute the absolute RF (Robinson-Foulds) distance metric between a given lhs Tree and all of the trees in the rhs TreeSet. More...
|
|
utils::Matrix< size_t > | rf_distance_absolute (TreeSet const &trees) |
| Compute the pairwise absolute RF (Robinson-Foulds) distance metric between a set of trees . More...
|
|
double | rf_distance_relative (Tree const &lhs, Tree const &rhs) |
| Compute the relative RF (Robinson-Foulds) distance metric between two Trees. More...
|
|
std::vector< double > | rf_distance_relative (Tree const &lhs, TreeSet const &rhs) |
| Compute the relative RF (Robinson-Foulds) distance metric between a given lhs Tree and all of the trees in the rhs TreeSet. More...
|
|
utils::Matrix< double > | rf_distance_relative (TreeSet const &trees) |
| Compute the pairwise relative RF (Robinson-Foulds) distance metric between a set of trees . More...
|
|
std::vector< utils::Bitvector > | rf_get_bitvectors (Tree const &tree, std::unordered_map< std::string, size_t > const &names) |
| Get all split Bitvectors for a given Tree. More...
|
|
std::unordered_map< utils::Bitvector, utils::Bitvector > | rf_get_occurrences (Tree const &lhs, Tree const &rhs) |
| Get an occurrence map for each split found in two trees. More...
|
|
std::unordered_map< utils::Bitvector, utils::Bitvector > | rf_get_occurrences (Tree const &lhs, TreeSet const &rhs) |
| Get an occurrence map for each split found in some Trees. More...
|
|
std::unordered_map< utils::Bitvector, utils::Bitvector > | rf_get_occurrences (TreeSet const &trees) |
| Get an occurrence map for each split found in the given TreeSet. More...
|
|
std::unordered_map< std::string, size_t > | rf_taxon_name_map (Tree const &tree) |
| Get a mapping from taxon names to unique IDs. More...
|
|