|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include "alisimulatorinvar.h" |
|
|
|
|
|
AliSimulatorInvar::AliSimulatorInvar(Params *params, double invar_prop) : |
|
|
AliSimulator(params) { |
|
|
invariant_proportion = invar_prop; |
|
|
} |
|
|
|
|
|
AliSimulatorInvar::AliSimulatorInvar(AliSimulator *alisimulator, double invar_prop){ |
|
|
tree = alisimulator->tree; |
|
|
params = alisimulator->params; |
|
|
num_sites_per_state = alisimulator->num_sites_per_state; |
|
|
length_ratio = alisimulator->length_ratio; |
|
|
inverse_length_ratio = alisimulator->inverse_length_ratio; |
|
|
expected_num_sites = alisimulator->expected_num_sites; |
|
|
partition_rate = alisimulator->partition_rate; |
|
|
invariant_proportion = invar_prop; |
|
|
max_length_taxa_name = alisimulator->max_length_taxa_name; |
|
|
fundi_items = alisimulator->fundi_items; |
|
|
STATE_UNKNOWN = alisimulator->STATE_UNKNOWN; |
|
|
max_num_states = alisimulator->max_num_states; |
|
|
seq_length_indels = alisimulator->seq_length_indels; |
|
|
map_seqname_node = alisimulator->map_seqname_node; |
|
|
latest_insertion = alisimulator->latest_insertion; |
|
|
first_insertion = alisimulator->first_insertion; |
|
|
starting_pos = alisimulator->starting_pos; |
|
|
output_line_length = alisimulator->output_line_length; |
|
|
num_threads = alisimulator->num_threads; |
|
|
force_output_PHYLIP = alisimulator->force_output_PHYLIP; |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void AliSimulatorInvar::simulateASequenceFromBranchAfterInitVariables(int segment_start, ModelSubst *model, double *trans_matrix, vector<short int> &dad_seq_chunk, vector<short int> &node_seq_chunk, Node *node, NeighborVec::iterator it, int* rstream, string lengths) |
|
|
{ |
|
|
|
|
|
double scale = 1.0 / (1 - invariant_proportion); |
|
|
|
|
|
|
|
|
model->computeTransMatrix(partition_rate * params->alisim_branch_scale * (*it)->length * scale, trans_matrix); |
|
|
|
|
|
|
|
|
convertProMatrixIntoAccumulatedProMatrix(trans_matrix, max_num_states, max_num_states); |
|
|
|
|
|
|
|
|
for (int i = 0; i < node_seq_chunk.size(); i++) |
|
|
{ |
|
|
|
|
|
|
|
|
if (site_specific_rates[segment_start + i] == 0 || dad_seq_chunk[i] == STATE_UNKNOWN) |
|
|
node_seq_chunk[i] = dad_seq_chunk[i]; |
|
|
else |
|
|
{ |
|
|
|
|
|
|
|
|
int parent_state = dad_seq_chunk[i]; |
|
|
node_seq_chunk[i] = getRandomItemWithAccumulatedProbMatrixMaxProbFirst(trans_matrix, parent_state * max_num_states, max_num_states, parent_state, rstream); |
|
|
} |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void AliSimulatorInvar::initVariablesRateHeterogeneity(int sequence_length, default_random_engine& generator, bool regenerate_root_sequence) |
|
|
{ |
|
|
initSiteSpecificRates(site_specific_rates, sequence_length); |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void AliSimulatorInvar::initSiteSpecificRates(vector<double> &site_specific_rates, int sequence_length) |
|
|
{ |
|
|
site_specific_rates.resize(sequence_length, 1); |
|
|
for (int i = 0; i < sequence_length; i++) |
|
|
{ |
|
|
|
|
|
if (random_double() <= invariant_proportion) |
|
|
site_specific_rates[i] = 0; |
|
|
else |
|
|
site_specific_rates[i] = 1; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void AliSimulatorInvar::insertNewSequenceForInsertionEvent(vector<short int> &indel_sequence, int position, vector<short int> &new_sequence, default_random_engine& generator) |
|
|
{ |
|
|
|
|
|
vector<double> new_site_specific_rates; |
|
|
initSiteSpecificRates(new_site_specific_rates, new_sequence.size()); |
|
|
|
|
|
|
|
|
site_specific_rates.insert(site_specific_rates.begin()+position, new_site_specific_rates.begin(), new_site_specific_rates.end()); |
|
|
|
|
|
|
|
|
AliSimulator::insertNewSequenceForInsertionEvent(indel_sequence, position, new_sequence, generator); |
|
|
} |
|
|
|