void IRKE::traverse_path(KmerCounter &kcounter, Kmer_Occurence_Pair seed_kmer, Kmer_visitor &visitor,
Kmer_visitor &place_holder, float MIN_CONNECTIVITY_RATIO, unsigned int depth)
{
if (IRKE_COMMON::MONITOR >= 3) {
cerr << "traverse_path, depth: " << depth << ", kmer: " << kcounter.get_kmer_string(seed_kmer.first) << endl;
}
// check to see if visited already
if (visitor.exists(seed_kmer.first)) {
// already visited
if (IRKE_COMMON::MONITOR >= 3) {
cout << "\talready visited " << kcounter.get_kmer_string(seed_kmer.first) << endl;
}
return;
}
// check if at the end of the max recursion, and if so, don't visit it but set a placeholder.
if (depth > MAX_RECURSION) {
place_holder.add(seed_kmer.first);
return;
}
visitor.add(seed_kmer.first);
// try each of the forward paths from the kmer:
vector<Kmer_Occurence_Pair> forward_candidates = kcounter.get_forward_kmer_candidates(seed_kmer.first);
for (unsigned int i = 0; i < forward_candidates.size(); i++) {
Kmer_Occurence_Pair kmer = forward_candidates[i];
if (kmer.second && exceeds_min_connectivity(kcounter, seed_kmer, kmer, MIN_CONNECTIVITY_RATIO)) {
traverse_path(kcounter, kmer, visitor, place_holder, MIN_CONNECTIVITY_RATIO, depth + 1);
}
}
// try each of the reverse paths from the kmer:
vector<Kmer_Occurence_Pair> reverse_candidates = kcounter.get_reverse_kmer_candidates(seed_kmer.first);
for (unsigned int i = 0; i < reverse_candidates.size(); i++) {
Kmer_Occurence_Pair kmer = reverse_candidates[i];
if (kmer.second && exceeds_min_connectivity(kcounter, seed_kmer, kmer, MIN_CONNECTIVITY_RATIO)) {
traverse_path(kcounter, kmer, visitor, place_holder, MIN_CONNECTIVITY_RATIO, depth + 1);
}
}
return;
}
bool IRKE::sequence_path_exists(string &sequence, unsigned int min_coverage, float min_entropy, float min_connectivity,
vector<unsigned int> &coverage_counter)
{
unsigned int kmer_length = kcounter.get_kmer_length();
if (sequence.length() < kmer_length) {
return (false);
}
bool path_exists = true;
string prev_kmer = sequence.substr(0, kmer_length);
if (contains_non_gatc(prev_kmer) || !kcounter.kmer_exists(prev_kmer)) {
path_exists = false;
coverage_counter.push_back(0);
}
else {
unsigned int kmer_count = kcounter.get_kmer_count(prev_kmer);
coverage_counter.push_back(kmer_count);
float entropy = compute_entropy(prev_kmer);
if (kmer_count < min_coverage || entropy < min_entropy) {
path_exists = false;
}
}
for (unsigned int i = 1; i <= sequence.length() - kmer_length; i++) {
string kmer = sequence.substr(i, kmer_length);
if (contains_non_gatc(kmer) || !kcounter.kmer_exists(kmer)) {
path_exists = false;
coverage_counter.push_back(0);
}
else {
unsigned int kmer_count = kcounter.get_kmer_count(kmer);
coverage_counter.push_back(kmer_count);
float entropy = compute_entropy(kmer);
if (kmer_count < min_coverage || entropy < min_entropy) {
path_exists = false;
}
}
if (path_exists && !exceeds_min_connectivity(kcounter, prev_kmer, kmer, min_connectivity)) {
path_exists = false;
}
prev_kmer = kmer;
}
return (path_exists);
}
bool IRKE::exceeds_min_connectivity (KmerCounter& kcounter, string kmerA, string kmerB, float min_connectivity) {
kmer_int_type_t valA = kmer_to_intval(kmerA);
kmer_int_type_t valB = kmer_to_intval(kmerB);
Kmer_Occurence_Pair pairA(valA, kcounter.get_kmer_count(valA));
Kmer_Occurence_Pair pairB(valB, kcounter.get_kmer_count(valB));
return exceeds_min_connectivity(kcounter, pairA, pairB, min_connectivity);
}
Path_n_count_pair IRKE::inchworm_step (KmerCounter& kcounter, char direction, Kmer_Occurence_Pair kmer, Kmer_visitor& visitor,
Kmer_visitor& eliminator, unsigned int inchworm_round, unsigned int depth,
float MIN_CONNECTIVITY_RATIO, unsigned int max_recurse) {
// cout << "inchworm_step" << endl;
if (IRKE_COMMON::MONITOR >= 2) {
cerr << "\rinchworm: " << string(1,direction)
<< " A:" << INCHWORM_ASSEMBLY_COUNTER << " "
<< " rnd:" << inchworm_round << " D:" << depth << " ";
}
// check to see if kmer exists. If not, return empty container
Path_n_count_pair best_path_n_pair;
if ( !kmer.second
|| visitor.exists(kmer.first) // visited
|| eliminator.exists(kmer.first) // eliminated
) {
// base case, already visited or kmer doesn't exist.
//cout << kmer << "already visited or doesn't exist. ending recursion at depth: " << depth << endl;
return(best_path_n_pair);
}
visitor.add(kmer.first);
if (PACMAN && depth > 0) {
// cerr << "pacman eliminated kmer: " << kmer << endl;
eliminator.add(kmer.first);
}
if (depth < max_recurse) {
vector<Kmer_Occurence_Pair> kmer_candidates;
if (direction == 'F') {
// forward search
kmer_candidates = kcounter.get_forward_kmer_candidates(kmer.first);
}
else {
// reverse search
kmer_candidates = kcounter.get_reverse_kmer_candidates(kmer.first);
}
bool tie = true;
unsigned int recurse_cap = max_recurse;
unsigned int best_path_length = 0;
while (tie) {
vector<Path_n_count_pair> paths;
for (unsigned int i = 0; i < kmer_candidates.size(); i++) {
Kmer_Occurence_Pair kmer_candidate = kmer_candidates[i];
if (kmer_candidate.second // ) {
&& !visitor.exists(kmer_candidate.first) // avoid creating already visited kmers since they're unvisited below...
&& exceeds_min_connectivity(kcounter, kmer, kmer_candidate, MIN_CONNECTIVITY_RATIO) ) {
//cout << endl << "\ttrying " << kmer_candidate << endl;
// recursive call here for extension
Path_n_count_pair p = inchworm_step(kcounter, direction, kmer_candidate, visitor, eliminator, inchworm_round, depth+1, MIN_CONNECTIVITY_RATIO, recurse_cap);
paths.push_back(p);
visitor.erase(kmer_candidate.first); // un-visiting
}
} // end for kmer
if (paths.size() > 1) {
sort(paths.begin(), paths.end(), compare);
if (paths[0].second == paths[1].second // same cumulative coverage values for both paths.
&&
// check last kmer to be sure they're different.
// Not interested in breaking ties between identically scoring paths that end up at the same kmer.
paths[0].first[0] != paths[1].first[0]
) {
// got tie, two different paths and two different endpoints:
if (IRKE_COMMON::MONITOR >= 3) {
cerr << "Got tie! " << ", score: " << paths[0].second << ", recurse at: " << recurse_cap << endl;
vector<unsigned int> v;
cerr << reconstruct_path_sequence(kcounter, paths[0].first, v) << endl;
cerr << reconstruct_path_sequence(kcounter, paths[1].first, v) << endl;
}
if (paths[0].first.size() > best_path_length) {
recurse_cap++;
best_path_length = paths[0].first.size();
}
else {
// cerr << "not able to delve further into the graph, though... Stopping here." << endl;
tie = false;
}
}
else if ((paths[0].second == paths[1].second // same cumulative coverage values for both paths.
&&
paths[0].first[0] == paths[1].first[0] ) // same endpoint
) {
if (IRKE_COMMON::MONITOR >= 3) {
cerr << "Tied, but two different paths join to the same kmer. Choosing first path arbitrarily." << endl;
}
tie = false;
best_path_n_pair = paths[0];
}
else {
// no tie.
tie = false;
best_path_n_pair = paths[0];
}
}
else if (paths.size() == 1) {
tie = false;
best_path_n_pair = paths[0];
}
else {
// no extensions possible.
tie = false;
}
} // end while tie
}
// add current kmer to path, as long as not the original seed kmer!
if (depth > 0) {
best_path_n_pair.first.push_back(kmer.first);
best_path_n_pair.second += kmer.second;
}
return(best_path_n_pair);
}
Path_n_count_pair IRKE::inchworm_step(KmerCounter &kcounter,
char direction,
Kmer_Occurence_Pair kmer,
Kmer_visitor &visitor,
Kmer_visitor &eliminator,
unsigned int inchworm_round,
unsigned int depth,
float MIN_CONNECTIVITY_RATIO,
unsigned int max_recurse)
{
// cout << "inchworm_step" << endl;
if (IRKE_COMMON::MONITOR >= 2) {
cerr << "\rinchworm: " << string(1, direction)
<< " A:" << INCHWORM_ASSEMBLY_COUNTER << " "
<< " rnd:" << inchworm_round << " D:" << depth << " ";
}
// check to see if kmer exists. If not, return empty container
Path_n_count_pair best_path_n_pair;
best_path_n_pair.second = 0; // init
if ( // !kmer.second ||
visitor.exists(kmer.first) // visited
|| eliminator.exists(kmer.first) // eliminated
) {
if (IRKE_COMMON::MONITOR >= 3) {
cerr << "base case, already visited or kmer doesn't exist." << endl;
cerr << kmer.first << " already visited or doesn't exist. ending recursion at depth: " << depth << endl;
}
return (best_path_n_pair);
}
visitor.add(kmer.first);
if (PACMAN && depth > 0) {
// cerr << "pacman eliminated kmer: " << kmer << endl;
eliminator.add(kmer.first);
}
if (depth < max_recurse) {
vector<Kmer_Occurence_Pair> kmer_candidates;
if (direction == 'F') {
// forward search
kmer_candidates = kcounter.get_forward_kmer_candidates(kmer.first);
}
else {
// reverse search
kmer_candidates = kcounter.get_reverse_kmer_candidates(kmer.first);
}
if (IRKE_COMMON::MONITOR >= 3) {
cerr << "Got " << kmer_candidates.size() << " kmer extension candidates." << endl;
}
bool tie = true;
unsigned int recurse_cap = max_recurse;
unsigned int best_path_length = 0;
while (tie) {
// keep trying to break ties if ties encountered.
// this is done by increasing the allowed recursion depth until the tie is broken.
// Recursion depth set via: recurse_cap and incremented if tie is found
vector<Path_n_count_pair> paths; // to collect all the paths rooting from this point
for (unsigned int i = 0; i < kmer_candidates.size(); i++) {
Kmer_Occurence_Pair kmer_candidate = kmer_candidates[i];
if (kmer_candidate.second &&
!visitor.exists(kmer_candidate
.first) // avoid creating already visited kmers since they're unvisited below...
&& exceeds_min_connectivity(kcounter, kmer, kmer_candidate, MIN_CONNECTIVITY_RATIO)) {
//cout << endl << "\ttrying " << kmer_candidate << endl;
// recursive call here for extension
Path_n_count_pair p = inchworm_step(kcounter,
direction,
kmer_candidate,
visitor,
eliminator,
inchworm_round,
depth + 1,
MIN_CONNECTIVITY_RATIO,
recurse_cap);
if (p.first.size() >= 1) {
// only retain paths that include visited nodes.
paths.push_back(p);
}
visitor.erase(kmer_candidate.first); // un-visiting
}
} // end for kmer
if (paths.size() > 1) {
sort(paths.begin(), paths.end(), compare);
if (IRKE_COMMON::__DEVEL_no_greedy_extend) {
// pick a path at random
int rand_index = rand() % paths.size();
tie = false;
if (IRKE_COMMON::MONITOR) {
cerr << "IRKE_COMMON::__DEVEL_no_greedy_extend -- picking random path index: " << rand_index
<< " from size(): " << paths.size() << endl;
}
best_path_n_pair = paths[rand_index];
}
else if (paths[0].second == paths[1].second // same cumulative coverage values for both paths.
&&
// check last kmer to be sure they're different.
// Not interested in breaking ties between identically scoring paths that end up at the same kmer.
paths[0].first[0] != paths[1].first[0]
) {
// got tie, two different paths and two different endpoints:
if (IRKE_COMMON::MONITOR >= 3) {
cerr << "Got tie! " << ", score: " << paths[0].second << ", recurse at: " << recurse_cap
<< endl;
vector<unsigned int> v;
cerr << reconstruct_path_sequence(kcounter, paths[0].first, v) << endl;
cerr << reconstruct_path_sequence(kcounter, paths[1].first, v) << endl;
}
if (IRKE_COMMON::__DEVEL_no_tie_breaking || recurse_cap >= MAX_RECURSION_HARD_STOP) {
tie = false;
int rand_index = rand() % 2;
if (IRKE_COMMON::MONITOR >= 2) {
cerr << "IRKE_COMMON::__DEVEL_no_tie_breaking, so picking path: " << rand_index
<< " at random." << endl;
}
best_path_n_pair = paths[rand_index];
}
else if (paths[0].first.size() > best_path_length) {
// still making progress in extending to try to break the tie. Keep going.
// note, this is the only test that keeps us in this while loop. (tie stays true)
recurse_cap++;
best_path_length = paths[0].first.size();
}
else {
// cerr << "not able to delve further into the graph, though... Stopping here." << endl;
tie = false;
best_path_n_pair = paths[0]; // pick one
}
}
else if ((paths[0].second == paths[1].second // same cumulative coverage values for both paths.
&&
paths[0].first[0] == paths[1].first[0]) // same endpoint
) {
if (IRKE_COMMON::MONITOR >= 3) {
cerr << "Tied, but two different paths join to the same kmer. Choosing first path arbitrarily."
<< endl;
}
tie = false;
best_path_n_pair = paths[0];
}
else {
// no tie.
tie = false;
best_path_n_pair = paths[0];
}
}
else if (paths.size() == 1) {
tie = false;
best_path_n_pair = paths[0];
}
else {
// no extensions possible.
tie = false;
}
} // end while tie
}
// add current kmer to path, as long as not the original seed kmer!
if (depth > 0) {
best_path_n_pair.first.push_back(kmer.first);
best_path_n_pair.second += kmer.second;
}
return (best_path_n_pair);
}
