5 #ifndef BPP_PHYL_MAPPING_SUBSTITUTIONMAPPINGTOOLS_H
6 #define BPP_PHYL_MAPPING_SUBSTITUTIONMAPPINGTOOLS_H
10 #include "../Likelihood/DataFlow/LikelihoodCalculationSingleProcess.h"
78 double threshold = -1,
82 return computeCounts(rltc, edgeIds, substitutionCount, unresolvedOption, threshold, verbose);
105 std::shared_ptr<const SubstitutionRegisterInterface> reg,
106 std::shared_ptr<const AlphabetIndex2> weights = 0,
107 std::shared_ptr<const AlphabetIndex2> distances = 0,
109 double threshold = -1,
113 return computeCounts(rltc, edgeIds, reg, weights, distances, unresolvedOption, threshold, verbose);
130 static std::unique_ptr<ProbabilisticSubstitutionMapping>
computeCounts(
132 const std::vector<uint>& speciesIds,
135 double threshold = -1,
136 bool verbose =
true);
159 static std::unique_ptr<ProbabilisticSubstitutionMapping>
computeCounts(
161 const std::vector<uint>& edgeIds,
162 std::shared_ptr<const SubstitutionRegisterInterface> reg,
163 std::shared_ptr<const AlphabetIndex2> weights = 0,
164 std::shared_ptr<const AlphabetIndex2> distances = 0,
166 double threshold = -1,
167 bool verbose =
true);
189 const std::vector<uint>& edgeIds,
190 std::shared_ptr<const BranchedModelSet> nullModels,
191 std::shared_ptr<const SubstitutionRegisterInterface> reg,
192 std::shared_ptr<const AlphabetIndex2> distances = 0,
194 bool verbose =
true);
213 std::shared_ptr<const BranchedModelSet> nullModels,
214 std::shared_ptr<const SubstitutionRegisterInterface> reg,
215 std::shared_ptr<const AlphabetIndex2> distances = 0,
256 const std::vector<uint>& edgeIds,
257 std::shared_ptr<const BranchedModelSet> nullModels,
258 std::shared_ptr<const SubstitutionRegisterInterface> reg,
259 std::shared_ptr<const AlphabetIndex2> weights = 0,
260 std::shared_ptr<const AlphabetIndex2> distances = 0,
261 bool perTimeUnit =
false,
264 double threshold = -1,
265 bool verbose =
true);
270 const std::vector<uint>& edgeIds,
271 bool perTimeUnit =
false,
276 std::shared_ptr<const BranchedModelSet> nullModels,
277 std::shared_ptr<const SubstitutionRegisterInterface> reg,
278 std::shared_ptr<const AlphabetIndex2> weights = 0,
279 std::shared_ptr<const AlphabetIndex2> distances = 0,
280 bool perTimeUnit =
false,
283 double threshold = -1,
287 return computeNormalizedCounts(rltc, edgeIds, nullModels, reg, weights, distances, perTimeUnit, siteSize, unresolvedOption, threshold, verbose);
384 const std::vector<uint>& ids =
Vuint(0));
416 const std::vector<uint>& ids =
Vuint(0));
421 const std::vector<uint>& ids =
Vuint(0));
446 const std::vector<uint>& ids =
Vuint(0));
450 const std::vector<uint>& ids =
Vuint(0));
476 const std::vector<uint>& ids,
477 std::shared_ptr<const SubstitutionRegisterInterface> reg,
478 std::shared_ptr<const AlphabetIndex2> weights = 0,
479 std::shared_ptr<const AlphabetIndex2> distances = 0,
481 double threshold = -1,
482 bool verbose =
true);
510 const std::vector<uint>& ids =
Vuint(0));
553 const std::vector<uint>& ids,
567 const std::vector<uint>& ids =
Vuint(0));
606 const std::vector<uint>& ids,
643 const std::vector<uint>& ids,
667 const std::vector<uint>& ids,
virtual std::vector< EdgeIndex > getAllEdgesIndexes() const=0
const SubstitutionProcessInterface & substitutionProcess() const
Return the ref to the SubstitutionProcess.
std::shared_ptr< const StateMapInterface > getStateMap() const
Computes the probability that at least one jump occurred on a branch, given the initial and final sta...
Data storage class for probabilistic substitution mappings.
The SubstitutionsCount interface.
virtual const ParametrizablePhyloTree & parametrizablePhyloTree() const =0
The SubstitutionRegister interface.
Defines the basic types of data flow nodes.
std::vector< double > Vdouble
std::vector< VVdouble > VVVdouble
std::vector< Vdouble > VVdouble
std::vector< unsigned int > Vuint