source: branches/ali/PROBE_SET/ps_find_probes.cxx

// =============================================================== //
//                                                                 //
//   File      : ps_find_probes.cxx                                //
//   Purpose   :                                                   //
//                                                                 //
//   Coded by Wolfram Foerster in October 2002                     //
//   Institute of Microbiology (Technical University Munich)       //
//   http://www.arb-home.de/                                       //
//                                                                 //
// =============================================================== //

#include "ps_tools.hxx"
#include "ps_database.hxx"
#include "ps_candidate.hxx"

#include <cmath>
#include <iostream>
#include <sys/times.h>

using namespace std;

template<class T>
void PS_print_set_ranges(const char *_set_name, const set<T> &_set, const bool _cr_at_end = true) {
    fflush(stdout);
    printf("%s size (%3zu) : ", _set_name, _set.size());
    if (_set.empty()) {
        printf("(empty)");
    }
    else {
        typename set<T>::const_iterator range_begin = _set.begin();
        typename set<T>::const_iterator range_end   = range_begin;
        typename set<T>::const_iterator it = _set.begin();
        for (++it;
              it != _set.end();
              ++it) {
            if (*it == (*range_end)+1) {
                range_end = it;
            }
            else {
                if (range_end == range_begin) {
                    cout << *range_begin << " ";
                }
                else {
                    cout << *range_begin << "-" << *range_end << " ";
                }
                range_begin = it;
                range_end   = it;
            }
        }
        cout << *range_begin;
        if (range_end != range_begin) cout << "-" << *range_end;
    }
    if (_cr_at_end) cout << "\n";
    fflush(stdout);
}


template<class T1, class T2>
void PS_print_map_ranges(const char *_map_name, const map<T1, T2> &_map, const bool _compare_keys = true, const bool _cr_at_end = true) {
    fflush(stdout);
    if (_map.empty()) {
        printf("%s size (  0) : (empty)", _map_name);
    }
    else {
        if (_compare_keys) {
            printf("%s size (%3i) : ", _map_name, _map.size());
            typename map<T1, T2>::const_iterator range_begin = _map.begin();
            typename map<T1, T2>::const_iterator range_end   = range_begin;
            typename map<T1, T2>::const_iterator it = _map.begin();
            for (++it;
                  it != _map.end();
                  ++it) {
                if (it->first == range_end->first+1) {
                    range_end = it;
                }
                else {
                    if (range_end == range_begin) {
                        cout << "(" << range_begin->first << "," << range_begin->second << ") ";
                    }
                    else {
                        cout << "(" << range_begin->first << "-" << range_end->first << "," << range_begin->second << ") ";
                    }
                    range_begin = it;
                    range_end   = it;
                }
            }
            if (range_end == range_begin) {
                cout << "(" << range_begin->first << "," << range_begin->second << ") ";
            }
            else {
                cout << "(" << range_begin->first << "-" << range_end->first << "," << range_begin->second << ") ";
            }
        }
        else {
            map<T2, set<pair<T1, T1> > > value2indices;
            map<T2, unsigned long int>  value2count;
            pair<T1, T1> range;
            range.first  = _map.begin()->first;
            range.second = range.first;
            T2 cur_value = _map.begin()->second;
            typename map<T1, T2>::const_iterator it = _map.begin();
            for (++it;
                  it != _map.end();
                  ++it) {
                if (it->second == cur_value) {
                    if (it->first == range.second+1) {
                        range.second = it->first;
                    }
                    else {
                        value2indices[cur_value].insert(range);
                        value2count[cur_value] += range.second - range.first + 1;
                        range.first  = it->first;
                        range.second = it->first;
                    }
                }
                else {
                    value2indices[cur_value].insert(range);
                    value2count[cur_value] += range.second - range.first + 1;
                    range.first  = it->first;
                    range.second = it->first;
                    cur_value    = it->second;
                }
            }
            value2indices[cur_value].insert(range);
            value2count[cur_value] += range.second - range.first + 1;
            for (typename map<T2, set<pair<T1, T1> > >::const_iterator value = value2indices.begin();
                  value != value2indices.end();
                  ++value) {
                if (value != value2indices.begin()) cout << "\n";
                printf("%s size (%3i) : value (", _map_name, _map.size());
                cout << value->first << ") count (" << value2count[value->first] << ") [";
                for (typename set<pair<T1, T1> >::const_iterator indices = value->second.begin();
                      indices != value->second.end();
                      ++indices) {
                    if (indices != value->second.begin()) cout << " ";
                    cout << indices->first;
                    if (indices->first != indices->second) cout << "-" << indices->second;
                }
                cout << "]," << value->first << ")";
            }
        }
    }
    if (_cr_at_end) cout << "\n";
    fflush(stdout);
}

//
// common globals
//

static bool                     __VERBOSE = false;
static SpeciesID                __MAX_ID;
static SpeciesID                __MIN_ID;
static SpeciesID                __SPECIES_COUNT;
static unsigned long            __BITS_IN_MAP;
static PS_BitMap_Counted       *__MAP;
static PS_BitMap_Counted       *__PRESET_MAP;
static IDSet                    __SOURCE_ID_SET;
static PS_BitSet::IndexSet      __TARGET_ID_SET;

//
// globals for PS_calc_next_speciesid_sets,
//             PS_calc_next_speciesid_sets_for_candidate
//

//  count of trues for a source_id may be max 5%
//  (of the difference between __SPECIES_COUNT and the lowest
//  count of trues per species) higher than the lowest count
//  of trues for the species in __SOURCE_ID_SET
#define __THRESHOLD_PERCENTAGE_NEXT_SOURCE_ID_SET  5
//  target_id must be at least in 95% of total target_id_sets
//  to be in __TARGET_ID_SET
#define __THRESHOLD_PERCENTAGE_NEXT_TARGET_ID_SET 95

static SpeciesID               __MIN_SETS_ID;
static SpeciesID               __MAX_SETS_ID;

//
// globals for PS_find_probes
//

//  initially a probe must match 40-60% of species
//  in the ID-sets to be a candidate
//  if PS_find_probes fails to find candidates within this range
//  it is repeated with a broadened range (by 5% each border)
#define __MIN_PERCENTAGE_SET_MATCH 40
#define __MAX_PERCENTAGE_SET_MATCH 60

static float                   __SOURCE_MIN_MATCH_COUNT;
static float                   __SOURCE_MAX_MATCH_COUNT;
static float                   __TARGET_MIN_MATCH_COUNT;
static float                   __TARGET_MAX_MATCH_COUNT;
static float                   __SOURCE_PERFECT_MATCH_COUNT;
static float                   __TARGET_PERFECT_MATCH_COUNT;
static unsigned long           __PROBES_COUNTER;
static unsigned long           __PROBES_REMOVED;
static PS_CandidatePtr         __CANDIDATES_ROOT;
static unsigned long           __CANDIDATES_COUNTER;
static unsigned long           __CANDIDATES_TODO;
static unsigned long           __CANDIDATES_FINISHED;
static unsigned long           __MAX_DEPTH;

//
// globals for PS_find_probe_for_sets
//             PS_test_candidate_on_bitmap
//

static IDSet __PATH;

//
// globals for PS_descend
//
static char *__PATH_IN_CANDIDATES;


static unsigned long int PS_test_candidate_on_bitmap(float *_filling_level = NULp, PS_BitMap_Counted *_map = NULp) {
    //  returns number of locations in __MAP that would be switched
    //  from false to true by __PATH

    // iterate over all IDs except path
    IDSetCIter        path_iter    = __PATH.begin();
    SpeciesID         next_path_ID = *path_iter;
    unsigned long int gain         = 0;
    if (_map) {
        for (SpeciesID not_in_path_ID = __MIN_ID;
              not_in_path_ID <= __MAX_ID;
              ++not_in_path_ID) {
            if (not_in_path_ID == next_path_ID) {   // if i run into a ID in path
                ++path_iter;                        // advance to next path ID
                next_path_ID = (path_iter == __PATH.end()) ? -1 : *path_iter;
                continue;                           // skip this ID
            }
            // iterate over path IDs
            for (IDSetCIter path_ID = __PATH.begin();
                  path_ID != __PATH.end();
                  ++path_ID) {
                if (not_in_path_ID == *path_ID)
                    continue;   // obviously a probe cant differ a species from itself
                if (not_in_path_ID > *path_ID) {
                    gain += !_map->get(not_in_path_ID, *path_ID);
                }
                else {
                    gain += !_map->get(*path_ID, not_in_path_ID);
                }
            }
        }
    }
    else {
        for (SpeciesID not_in_path_ID = __MIN_ID;
              not_in_path_ID <= __MAX_ID;
              ++not_in_path_ID) {
            if (not_in_path_ID == next_path_ID) {   // if i run into a ID in path
                ++path_iter;                        // advance to next path ID
                next_path_ID = (path_iter == __PATH.end()) ? -1 : *path_iter;
                continue;                           // skip this ID
            }
            // iterate over path IDs
            for (IDSetCIter path_ID = __PATH.begin();
                  path_ID != __PATH.end();
                  ++path_ID) {
                if (not_in_path_ID == *path_ID)
                    continue;   // obviously a probe cant differ a species from itself
                if (not_in_path_ID > *path_ID) {
                    gain += !__MAP->get(not_in_path_ID, *path_ID);
                }
                else {
                    gain += !__MAP->get(*path_ID, not_in_path_ID);
                }
            }
        }
    }
    if (_filling_level) {
        unsigned long int trues = (_map) ? _map->getCountOfTrues() + gain :  __MAP->getCountOfTrues() + gain;
        *_filling_level = ((float)trues / __BITS_IN_MAP)*100.0;
    }
    return gain;
}


static bool PS_test_sets_on_path(float &_distance) {
    long count_matched_source = 0;
    long count_matched_target = 0;
    SpeciesID  path_id;
    IDSetCIter path_end   = __PATH.end();
    IDSetCIter path       = __PATH.begin();
    IDSetCIter source_end = __SOURCE_ID_SET.end();
    IDSetCIter source     = __SOURCE_ID_SET.begin();
    PS_BitSet::IndexSet::const_iterator target_end = __TARGET_ID_SET.end();
    PS_BitSet::IndexSet::const_iterator target     = __TARGET_ID_SET.begin();

    while (path != path_end) {
        path_id = *path;
        while ((*target < path_id) && (target != target_end)) {
            ++target;
        }
        if ((target != target_end) && (*target == path_id))
            ++count_matched_target;
        while ((*source < path_id) && (source != source_end)) {
            ++source;
        }
        if ((source != source_end) && (*source == path_id))
            ++count_matched_source;
        ++path;
    }

    if ((count_matched_source > __SOURCE_MIN_MATCH_COUNT) &&
        (count_matched_source < __SOURCE_MAX_MATCH_COUNT) &&
        (count_matched_target > __TARGET_MIN_MATCH_COUNT) &&
        (count_matched_target < __TARGET_MAX_MATCH_COUNT)) {
        _distance = fabs(__SOURCE_PERFECT_MATCH_COUNT - count_matched_source) + fabs(__TARGET_PERFECT_MATCH_COUNT - count_matched_target);
        return true;
    }
    return false;
}

static void PS_find_probe_for_sets(const PS_NodePtr& _ps_node, PS_CandidatePtr _candidate_parent) {
    //  scan subtree starting with _ps_node for candidates

    SpeciesID id         = _ps_node->getNum();
    bool      has_probes = _ps_node->hasProbes();

    //
    // append ID to path
    //
    __PATH.insert(id);

    //
    // don't look at path until ID is greater than lowest ID in the sets of IDs
    // also don't use a node if its already used as candidate
    //
    if ((id >= __MIN_SETS_ID) && has_probes && !_candidate_parent->alreadyUsedNode(_ps_node)) {
        ++__PROBES_COUNTER;
        if (__VERBOSE && (__PROBES_COUNTER % 100 == 0)) {
            printf("%8lup %8luc\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b", __PROBES_COUNTER, __CANDIDATES_COUNTER);
            fflush(stdout);
        }
        // make intersections of __PATH with __SOURCE_ID_SET and __TARGET_ID_SET
        float distance_to_perfect_match;
        if (PS_test_sets_on_path(distance_to_perfect_match)) {
            unsigned long gain = PS_test_candidate_on_bitmap();   // no -> calc gain and make new candidate node
            int status = (gain < (unsigned)__SPECIES_COUNT / 100)
                ? 0
                : _candidate_parent->addChild(static_cast<unsigned long>(distance_to_perfect_match), gain, _ps_node, __PATH);
            if (status > 0) {
                if (status == 2) {
                    ++__CANDIDATES_COUNTER;
                    if (__VERBOSE) {
                        printf("%8lup %8luc\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b", __PROBES_COUNTER, __CANDIDATES_COUNTER);
                        fflush(stdout);
                    }
                }
                fflush(stdout);
            }
        }
    }

    //
    // step down the children if either ID is lower than highest
    // ID in the set of ID-pairs or the node has no probes
    //
    if ((id < __MAX_SETS_ID) || (! has_probes)) {
        for (PS_NodeMapConstIterator i = _ps_node->getChildrenBegin();
              i != _ps_node->getChildrenEnd();
              ++i) {
            PS_find_probe_for_sets(i->second, _candidate_parent);
        }
    }

    //
    // remove ID from path
    //
    __PATH.erase(id);
}

static void PS_find_probes(const PS_NodePtr& _root_node, const int _round, PS_CandidatePtr _candidate_parent, const float _filling_level) {
    //  scan PS_Node-tree for candidates to raise filling level of __MAP

    __PROBES_COUNTER             = 0;
    __CANDIDATES_COUNTER         = 0;
    __SOURCE_MIN_MATCH_COUNT     = (__SOURCE_ID_SET.size() * (__MIN_PERCENTAGE_SET_MATCH - (_round * 5))) / 100.0;
    __SOURCE_MAX_MATCH_COUNT     = (__SOURCE_ID_SET.size() * (__MAX_PERCENTAGE_SET_MATCH + (_round * 5))) / 100.0;
    __TARGET_MIN_MATCH_COUNT     = (__TARGET_ID_SET.size() * (__MIN_PERCENTAGE_SET_MATCH - (_round * 5))) / 100.0;
    __TARGET_MAX_MATCH_COUNT     = (__TARGET_ID_SET.size() * (__MAX_PERCENTAGE_SET_MATCH + (_round * 5))) / 100.0;
    __SOURCE_PERFECT_MATCH_COUNT = __SOURCE_ID_SET.size() / 2.0;
    __TARGET_PERFECT_MATCH_COUNT = __TARGET_ID_SET.size() / 2.0;
    __MIN_SETS_ID = (*__SOURCE_ID_SET.begin()  < *__TARGET_ID_SET.begin())  ? *__SOURCE_ID_SET.begin()  : *__TARGET_ID_SET.begin();
    __MAX_SETS_ID = (*__SOURCE_ID_SET.rbegin() < *__TARGET_ID_SET.rbegin()) ? *__SOURCE_ID_SET.rbegin() : *__TARGET_ID_SET.rbegin();
    printf("PS_find_probes(%i) : source match %10.3f .. %10.3f   target match %10.3f .. %10.3f\n", _round, __SOURCE_MIN_MATCH_COUNT, __SOURCE_MAX_MATCH_COUNT, __TARGET_MIN_MATCH_COUNT, __TARGET_MAX_MATCH_COUNT); fflush(stdout);
    struct tms before;
    times(&before);
    for (PS_NodeMapConstIterator i = _root_node->getChildrenBegin();
          (i != _root_node->getChildrenEnd()) && (i->first < __MAX_SETS_ID);
          ++i)
    {
        __PATH.clear();
        PS_find_probe_for_sets(i->second, _candidate_parent);
    }
    printf("PS_find_probes(%i) : %li candidates of %li probes visited  ", _round, __CANDIDATES_COUNTER, __PROBES_COUNTER);
    PS_print_time_diff(&before);
    // reduce candidates to best,worst and middle gain
    _candidate_parent->reduceChildren(_filling_level);
    for (PS_CandidateByGainMapCIter c = _candidate_parent->children.begin();
          c != _candidate_parent->children.end();
          ++c) {
        printf("PS_find_probes(%i) : ", _round);
        c->second->print();
        ++__CANDIDATES_TODO;
    }
    fflush(stdout);
}

static void PS_calc_next_speciesid_sets() {
    //  scan __MAP to find sets of IDs that need differentiation most

    //
    // 1. __SOURCE_ID_SET
    //    scan bitmap for species that need more matches
    //
    SpeciesID highest_count;
    SpeciesID lowest_count;
    float     threshold;
    SpeciesID count;

    // first pass -- get lowest count of trues and calc threshold
    lowest_count  = __SPECIES_COUNT;
    highest_count = 0;
    for (SpeciesID id = __MIN_ID;
          id <= __MAX_ID;
          ++id) {
        count = __MAP->getCountFor(id);
        if (count == __SPECIES_COUNT-__MIN_ID-1) continue; // i cannot improve species that can be differed from all others
        if (count > highest_count) highest_count = count;
        if (count < lowest_count)  lowest_count  = count;
    }
    threshold = (((__SPECIES_COUNT-lowest_count) * __THRESHOLD_PERCENTAGE_NEXT_SOURCE_ID_SET) / 100.0) + lowest_count;
    printf("PS_calc_next_speciesid_sets() : SOURCE count 1's [%i..%i]  threshold (%.3f)", lowest_count, highest_count, threshold);

    // second pass -- get IDs where count is below or equal threshold
    __SOURCE_ID_SET.clear();
    for (SpeciesID id = __MIN_ID;
          id <= __MAX_ID;
          ++id) {
        if (__MAP->getCountFor(id) <= threshold) __SOURCE_ID_SET.insert(id);
    }
    PS_print_set_ranges(" __SOURCE_ID_SET", __SOURCE_ID_SET);

    //
    // 2. __TARGET_ID_SET
    //    scan bitmap for species IDs that need to be distinguished from MOST species in __SOURCE_ID_SET
    //
    ID2IDMap count_falses_per_id;

    // first -- get the IDs that need differentiation from __SOURCE_ID_SET
    unsigned long count_iterations = 0;
    for (IDSetCIter source_id = __SOURCE_ID_SET.begin();
          source_id != __SOURCE_ID_SET.end();
          ++source_id, ++count_iterations) {
        // get 'next_target_set'
        __MAP->getFalseIndicesFor(*source_id, __TARGET_ID_SET);
        // count falses per SpeciesID
        for (PS_BitSet::IndexSet::iterator target_id = __TARGET_ID_SET.begin();
              target_id != __TARGET_ID_SET.end();
              ++target_id) {
            if ((*target_id < __MIN_ID) || (*target_id > __MAX_ID)) continue; // skip ID's that are outside DB-IDs-range (like zero if __MIN_ID is one)
            if (*target_id != *source_id) ++count_falses_per_id[*target_id];
        }
    }

    // second -- get highest count of falses and calc threshold
    lowest_count  = __SPECIES_COUNT;
    highest_count = 0;
    for (ID2IDMapCIter count_per_id = count_falses_per_id.begin();
          count_per_id != count_falses_per_id.end();
          ++count_per_id) {
        if (count_per_id->second > highest_count) highest_count = count_per_id->second;
        if (count_per_id->second < lowest_count)  lowest_count  = count_per_id->second;
    }
    printf("PS_calc_next_speciesid_sets() : TARGET count 0's [%i..%i]", lowest_count, highest_count);

    // third -- put all IDs in __TARGET_ID_SET that are needed most by species from __SOURCE_ID_SET
    __TARGET_ID_SET.clear();
    for (ID2IDMapCIter count_per_id = count_falses_per_id.begin();
          count_per_id != count_falses_per_id.end();
          ++count_per_id) {
        if (count_per_id->second == highest_count) __TARGET_ID_SET.insert(count_per_id->first);
    }
    PS_print_set_ranges(" __TARGET_ID_SET", __TARGET_ID_SET);
}

void PS_apply_path_to_bitmap(IDSet &_path, const bool _silent = false, PS_BitMap_Counted *_map = NULp) {
    //  set true in __MAP for all combinations of IDs (in _path , not in _path)

    // iterate over all IDs except path
    IDSetCIter        path_iter    = _path.begin();
    SpeciesID         next_path_ID = *path_iter;
    unsigned long int gain         = 0;
    if (_map) { // called for a 'private' map ?
        for (SpeciesID not_in_path_ID = __MIN_ID;
              not_in_path_ID <= __MAX_ID;
              ++not_in_path_ID) {
            if (not_in_path_ID == next_path_ID) {   // if i run into a ID in path
                ++path_iter;                        // advance to next path ID
                next_path_ID = (path_iter == _path.end()) ? -1 : *path_iter;
                continue;                           // skip this ID
            }
            // iterate over path IDs
            for (IDSetCIter path_ID = _path.begin();
                  path_ID != _path.end();
                  ++path_ID) {
                if (not_in_path_ID == *path_ID) continue;   // obviously a probe cant differ a species from itself
                if (not_in_path_ID > *path_ID) {
                    gain += !_map->set(not_in_path_ID, *path_ID, true);
                }
                else {
                    gain += !_map->set(*path_ID, not_in_path_ID, true);
                }
            }
        }
    }
    else { // called for __MAP
        for (SpeciesID not_in_path_ID = __MIN_ID;
              not_in_path_ID <= __MAX_ID;
              ++not_in_path_ID) {
            if (not_in_path_ID == next_path_ID) {   // if i run into a ID in path
                ++path_iter;                        // advance to next path ID
                next_path_ID = (path_iter == _path.end()) ? -1 : *path_iter;
                continue;                           // skip this ID
            }
            // iterate over path IDs
            for (IDSetCIter path_ID = _path.begin();
                  path_ID != _path.end();
                  ++path_ID) {
                if (not_in_path_ID == *path_ID) continue;   // obviously a probe cant differ a species from itself
                if (not_in_path_ID > *path_ID) {
                    gain += !__MAP->set(not_in_path_ID, *path_ID, true);
                }
                else {
                    gain += !__MAP->set(*path_ID, not_in_path_ID, true);
                }
            }
        }
    }
    unsigned long int sets =  (__SPECIES_COUNT-_path.size())*_path.size();
    if (!_silent) printf("PS_apply_path_to_bitmap() : gain %lu of %lu -- %.2f%%  -> wasted %lu\n", gain, sets, ((float)gain/sets)*100.0, sets-gain);
}

static float PS_filling_level(PS_CandidatePtr _candidate = NULp) {
    //  returns filling level of __MAP

    unsigned long trues      = __MAP->getCountOfTrues();
    float         percentage = ((float)trues / __BITS_IN_MAP)*100.0;
    if (_candidate) {
        _candidate->filling_level = percentage;
        _candidate->false_IDs     = __BITS_IN_MAP - trues;
    }
    else {
        printf("PS_filling_level() : bitmap (%lu) now has %lu trues and %lu falses -- %.5f%% filled\n", __BITS_IN_MAP, trues, __BITS_IN_MAP-trues, percentage);
    }
    return percentage;
}

void PS_GNUPlot(const char *_out_prefix, const long _iteration, const IDSet &_path, const ID2IDSet &_noMatches) {
    //  generate data- and commandfiles for GNUPlot to display __MAP and its count_trues_per_id

    char *buffer = (char *)malloc(4096);
    // open data file
    sprintf(buffer, "%s.%06li", _out_prefix, _iteration);
    char *data_name = strdup(buffer);
    PS_FileBuffer *file = new PS_FileBuffer(data_name, PS_FileBuffer::WRITEONLY);
    // output data
    long size = sprintf(buffer, "# CANDIDATE #%li path (%zu)\n", _iteration, _path.size());
    file->put(buffer, size);
    for (IDSetCIter i = _path.begin();
          i != _path.end();
          ++i) {
        size = sprintf(buffer, "# %i\n", *i);
        file->put(buffer, size);
    }
    size = sprintf(buffer, "#noMatches (%zu)\n", _noMatches.size());
    file->put(buffer, size);
    for (ID2IDSetCIter p = _noMatches.begin();
          p != _noMatches.end();
          ++p) {
        size = sprintf(buffer, "%i %i\n", p->first, p->second);
        file->put(buffer, size);
    }
    size = sprintf(buffer, "\n\n");
    file->put(buffer, size);
    sprintf(buffer, "Bitmap after %li. candidate", _iteration);
    char *title = strdup(buffer);
    __MAP->printGNUplot(title, buffer, file);
    // open gnuplot command file
    sprintf(buffer, "%s.%06li.gnuplot", _out_prefix, _iteration);
    file->reinit(buffer, PS_FileBuffer::WRITEONLY);
    // output gnuplot commands
    size = sprintf(buffer, "set terminal png color\nset output '%06li.bitmap.png\n", _iteration);
    file->put(buffer, size);
    size = sprintf(buffer, "set yrange [%i:%i] reverse\nset xrange [%i:%i]\n", __MIN_ID, __MAX_ID, __MIN_ID, __MAX_ID);
    file->put(buffer, size);
    size = sprintf(buffer, "set size square\nset title '%li. iteration'\nset pointsize 0.5\n", _iteration);
    file->put(buffer, size);
    size = sprintf(buffer, "plot '%s' index 1 title 'match ()' with dots 2,'%s' index 0 title 'no match (30)' with points 1\n", data_name, data_name);
    file->put(buffer, size);
    size = sprintf(buffer, "set terminal png color\nset output '%06li.counters.png\n", _iteration);
    file->put(buffer, size);
    size = sprintf(buffer, "set yrange [] noreverse\nset size nosquare\n");
    file->put(buffer, size);
    size = sprintf(buffer, "plot '%s' index 2 title 'count/species' with impulses 2,'%s' index 3 title 'species/count' with points 1", data_name, data_name);
    file->put(buffer, size);

    delete file;
    free(title);
    free(data_name);
    free(buffer);
}

static PS_CandidatePtr PS_ascend(PS_CandidatePtr _last_candidate) {
    //  'remove' _last_candidate from __MAP by applying its parent's
    //  paths to a fresh __MAP

    //
    // make fresh __MAP
    //
    __MAP->copy(__PRESET_MAP);
    //
    // apply paths of parent-candidates to __MAP
    //
    PS_CandidatePtr parent = _last_candidate->parent;
    while (parent && !parent->path.empty()) {
        PS_apply_path_to_bitmap(parent->path, true);
        parent = parent->parent;
    }
    printf("ASCEND ");
    PS_filling_level();
    //
    // return the parent of the given candidate
    //
    return _last_candidate->parent;
}


static void PS_descend(PS_CandidatePtr _candidate_parent, const PS_NodePtr& _root_node, unsigned long _depth, const float _filling_level) {
    struct tms before;
    times(&before);

    printf("\nDESCEND ==================== depth (%lu / %lu) candidates (%lu / %lu -> %lu left) ====================\n",
            _depth,
            __MAX_DEPTH,
            __CANDIDATES_FINISHED,
            __CANDIDATES_TODO,
            __CANDIDATES_TODO-__CANDIDATES_FINISHED); fflush(stdout);
    printf("DESCEND PATH : (%s)\n\n", __PATH_IN_CANDIDATES);

    //
    // calc source- and target-set of IDs
    //
    PS_calc_next_speciesid_sets();
    printf("\nDESCEND ---------- calculated next speciesid-sets ----------\n\n"); fflush(stdout);

    //
    // search for candidates to improve filling level of __MAP using the source- and target-set of IDs
    // max. 3 rounds
    //
    int round = 0;
    for (; round<3 && _candidate_parent->children.empty(); ++round) {
        PS_find_probes(_root_node, round, _candidate_parent, _filling_level);
    }
    printf("\nDESCEND ---------- searched probe for speciesid-sets [rounds : %i] candidates (%lu / %lu -> %lu left) ----------\n\n",
            round,
            __CANDIDATES_FINISHED,
            __CANDIDATES_TODO,
            __CANDIDATES_TODO-__CANDIDATES_FINISHED); fflush(stdout);

    //
    // descend down each (of the max 3) candidate(s)
    //
    char count = '0'+_candidate_parent->children.size();
    for (PS_CandidateByGainMapRIter next_candidate_it = _candidate_parent->children.rbegin();
          next_candidate_it != _candidate_parent->children.rend();
          ++next_candidate_it, --count) {
        PS_CandidatePtr next_candidate = &(*next_candidate_it->second);
        ++__CANDIDATES_FINISHED;
        //
        // apply candidate to __MAP
        //
        printf("[%p] ", next_candidate);
        PS_apply_path_to_bitmap(next_candidate->path);
        printf("[%p] ", next_candidate);
        PS_filling_level(next_candidate);
        next_candidate->depth = _depth+1;
        next_candidate->print(0, false, false);
        //
        // step down
        //
        if ((next_candidate->filling_level < 75.0) && (_depth+1 < __MAX_DEPTH)) {
            __PATH_IN_CANDIDATES[_depth] = count;
            __PATH_IN_CANDIDATES[_depth+1] = '\x00';
            PS_descend(next_candidate, _root_node, _depth+1, next_candidate->filling_level);
        }
        //
        // remove candidate from __MAP
        //
        PS_ascend(next_candidate);
    }

    printf("\nDESCEND ~~~~~~~~~~~~~~~~~~~~ depth (%li) max depth (%li) candidates (%lu / %lu -> %lu left) ~~~~~~~~~~~~~~~~~~~~ ",
            _depth,
            __MAX_DEPTH,
            __CANDIDATES_FINISHED,
            __CANDIDATES_TODO,
            __CANDIDATES_TODO-__CANDIDATES_FINISHED);
    PS_print_time_diff(&before);
    printf("\n"); fflush(stdout);
}

static void PS_make_map_for_candidate(PS_CandidatePtr _candidate) {
    //  make __MAP for _candidate

    if (_candidate->map) return; // if candidate already has its map return
    _candidate->map = new PS_BitMap_Counted(false, __MAX_ID+1);
    _candidate->map->copy(__PRESET_MAP);
    PS_apply_path_to_bitmap(_candidate->path, true, _candidate->map);   // apply _candidate's path
    PS_CandidatePtr parent = _candidate->parent;
    while (parent && !parent->path.empty()) {        // apply parent's paths
        PS_apply_path_to_bitmap(parent->path, true, _candidate->map);
        parent = parent->parent;
    }
}


void PS_get_leaf_candidates(PS_CandidatePtr  _candidate_parent,
                             PS_CandidateSet &_leaf_candidates,
                             const bool       _ignore_passes_left = false) {

    for (PS_CandidateByGainMapIter next_candidate = _candidate_parent->children.begin();
          next_candidate != _candidate_parent->children.end();
          ++next_candidate) {

        if ((next_candidate->second->children.size() == 0) &&
            ((next_candidate->second->passes_left > 0) || _ignore_passes_left)) {
            _leaf_candidates.insert(next_candidate->second);
        }
        PS_get_leaf_candidates(&(*next_candidate->second), _leaf_candidates, _ignore_passes_left);
    }
}

void PS_get_next_candidates_descend(PS_NodePtr _ps_node, PS_CandidateSet &_leaf_candidates) {
    //  scan PS_node-tree for next candidates for each of _leaf_candidates

    SpeciesID id         = _ps_node->getNum();
    bool      has_probes = _ps_node->hasProbes();

    //
    // append ID to path
    //
    __PATH.insert(id);

    //
    // don't look at path until ID is greater than lowest ID in the sets of IDs
    // also don't use a node if its already used as candidate
    //
    if ((id >= __MIN_SETS_ID) && has_probes) {
        unsigned long total_gain_of_node   = 0;
        unsigned long total_tests_per_node = 0;
        ++__PROBES_COUNTER;
        // iterate over _leaf_candidates
        for (PS_CandidateSetIter candidate_iter = _leaf_candidates.begin();
              candidate_iter != _leaf_candidates.end();
              ++candidate_iter) {
            PS_CandidateSPtr candidate = *candidate_iter;

            // next leaf-candidate if the probe was already used for current candidate
            if (candidate->alreadyUsedNode(_ps_node)) continue;

            ++__CANDIDATES_COUNTER; // possible candidates
            if (__VERBOSE) printf("%8lup %8lur %8luc %8lug %8luu\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b",
                                   __PROBES_COUNTER,
                                   __PROBES_REMOVED,
                                   __CANDIDATES_COUNTER,
                                   __CANDIDATES_TODO,
                                   __CANDIDATES_FINISHED); fflush(stdout);

            // next leaf-candidate if __PATH doesn't fulfill matching criteria
            unsigned long matches = candidate->matchPathOnOneFalseIDs(__PATH);
            if (matches < candidate->one_false_IDs_matches) continue;

            ++__CANDIDATES_TODO; // good candidates
            if (__VERBOSE) printf("%8lup %8lur %8luc %8lug %8luu\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b",
                                   __PROBES_COUNTER,
                                   __PROBES_REMOVED,
                                   __CANDIDATES_COUNTER,
                                   __CANDIDATES_TODO,
                                   __CANDIDATES_FINISHED); fflush(stdout);

            // test node on candidate's bitmap
            float filling_level;
            ++total_tests_per_node;
            unsigned long gain = PS_test_candidate_on_bitmap(&filling_level, candidate->map);
            total_gain_of_node += gain;
            if (candidate->updateBestChild(gain, matches, filling_level, _ps_node, __PATH)) {
                ++__CANDIDATES_FINISHED; // used candiates
                if (__VERBOSE) printf("%8lup %8lur %8luc %8lug %8luu\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b",
                                       __PROBES_COUNTER,
                                       __PROBES_REMOVED,
                                       __CANDIDATES_COUNTER,
                                       __CANDIDATES_TODO,
                                       __CANDIDATES_FINISHED); fflush(stdout);
            }
        }
        if ((total_tests_per_node == _leaf_candidates.size()) &&
            (total_gain_of_node == 0)) {
            ++__PROBES_REMOVED;
            if (__VERBOSE) printf("%8lup %8lur %8luc %8lug %8luu\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b\b",
                                   __PROBES_COUNTER,
                                   __PROBES_REMOVED,
                                   __CANDIDATES_COUNTER,
                                   __CANDIDATES_TODO,
                                   __CANDIDATES_FINISHED); fflush(stdout);
            _ps_node->removeProbes();
        }
    }

    //
    // step down the children if either ID is lower than highest
    // ID in the set of ID-pairs or the node has no probes
    //
    if ((id < __MAX_SETS_ID) || (! has_probes)) {
        for (PS_NodeMapConstIterator i = _ps_node->getChildrenBegin();
              i != _ps_node->getChildrenEnd();
              ++i) {
            PS_get_next_candidates_descend(i->second, _leaf_candidates);
        }
    }

    //
    // remove ID from path
    //
    __PATH.erase(id);
}


void PS_get_next_candidates(const PS_NodePtr&  _root_node, PS_CandidateSet& _leaf_candidates) {
    struct tms before;
    times(&before);
    // first calc source/target/false_IDs sets
    printf("PS_get_next_candidates() : initializing %zu candidates..\n", _leaf_candidates.size()); fflush(stdout);
    __PROBES_COUNTER      = 0;
    __PROBES_REMOVED      = 0;
    __CANDIDATES_COUNTER  = 0;
    __CANDIDATES_TODO     = 0;
    __CANDIDATES_FINISHED = 0;
    __MIN_SETS_ID         = __MAX_ID;
    __MAX_SETS_ID         = __MIN_ID;
    for (PS_CandidateSetIter iter = _leaf_candidates.begin();
          iter != _leaf_candidates.end();
          ++iter) {
        PS_CandidateSPtr candidate = *iter;
        if (!candidate->map) {          // if candidate has no map yet
            candidate->getParentMap();  // try to get its parent's map
            if (candidate->map) {       // if parent had a map (if not a new map is created in PS_calc_next_speciesid_sets_for_candidate
                PS_apply_path_to_bitmap(candidate->path, true, candidate->map);   // apply candidate's path
            }
        }
        PS_make_map_for_candidate(&(*candidate));
        candidate->initFalseIDs(__MIN_ID, __MAX_ID, __MIN_SETS_ID, __MAX_SETS_ID);
    }
    // scan tree
    printf("PS_get_next_candidates() : "); fflush(stdout);
    for (PS_NodeMapConstIterator node_iter = _root_node->getChildrenBegin();
          (node_iter != _root_node->getChildrenEnd()) && (node_iter->first < __MAX_SETS_ID);
          ++node_iter) {
        __PATH.clear();
        PS_get_next_candidates_descend(node_iter->second, _leaf_candidates);
    }
    printf("looked at probes (%lu) -> removed probes (%lu)   possible candidates (%lu) -> good candidates (%lu) -> used candidates (%lu)\nPS_get_next_candidates() : ",
            __PROBES_COUNTER,
            __PROBES_REMOVED,
            __CANDIDATES_COUNTER,
            __CANDIDATES_TODO,
            __CANDIDATES_FINISHED); fflush(stdout);
    PS_print_time_diff(&before);

    // 'descend' candidates
    for (PS_CandidateSetIter iter = _leaf_candidates.begin();
          iter != _leaf_candidates.end();
          ++iter) {
        PS_CandidateSPtr candidate = *iter;
        candidate->print();
        candidate->decreasePasses();
    }

    _leaf_candidates.clear();
    PS_get_leaf_candidates(__CANDIDATES_ROOT, _leaf_candidates);
}

//  ====================================================
//  ====================================================
int main(int   argc,
          char *argv[]) {
    //
    // check arguments
    //
    if (argc < 5) {
        printf("Missing argument\n Usage %s <database name> <result filename> <[-]candidates filename> <final candidates filename> [--verbose] [result filename prefix for output files]\n", argv[0]);
        exit(1);
    }

    const char *input_DB_name             = argv[1];
    const char *result_in_filename        = argv[2];
    const char *candidates_filename       = argv[3];
    const char *final_candidates_filename = argv[4];
    const char *result_out_prefix         = (argc > 5) ? argv[5] : NULp;
    if (argc > 5) {
        if (strcmp(result_out_prefix, "--verbose") == 0) {
            __VERBOSE = true;
            result_out_prefix  = (argc > 6) ? argv[6] : NULp;
        }
    }
    //
    // open probe-set-database
    //
    printf("Opening probe-set-database '%s'..\n", input_DB_name);
    PS_Database *db = new PS_Database(input_DB_name, PS_Database::READONLY);
    db->load();
    __MAX_ID = db->getMaxID();
    __MIN_ID = db->getMinID();
    __SPECIES_COUNT = db->getSpeciesCount();
    printf("min ID (%i)  max ID (%i)  count of species (%i)\n", __MIN_ID, __MAX_ID, __SPECIES_COUNT);
    printf("..loaded database (enter to continue)\n"); fflush(stdout);

    //
    // open result file for preset bitmap
    //
    printf("Opening result file %s..\n", result_in_filename);
    PS_FileBuffer *result_file = new PS_FileBuffer(result_in_filename, PS_FileBuffer::READONLY);
    long size;
    ID2IDSet noMatches;
    SpeciesID id1, id2;
    printf("reading no matches : ");
    result_file->get_long(size);
    printf("(%li)\n", size); fflush(stdout);
    for (long i=0;
          i < size;
          ++i) {
        result_file->get_int(id1);
        result_file->get_int(id2);
        printf("  %i,%i", id1, id2);
        if (id1 < id2) {
            noMatches.insert(ID2IDPair(id1, id2));
        }
        else {
            noMatches.insert(ID2IDPair(id2, id1));
        }
    }
    printf("\nreading one matches : ");
    result_file->get_long(size);
    printf("(%li)\n", size); fflush(stdout);
    long          path_length;
    SpeciesID     path_id;
    IDSet         path;
    // IDID2IDSetMap oneMatchesMap;
    for (long i=0;
          i < size;
          ++i) {
        path.clear();
        result_file->get_int(id1);
        result_file->get_int(id2);
        result_file->get_long(path_length);
        printf("%i,%i path(%li)", id1, id2, path_length);
        while (path_length-- > 0) {
            result_file->get_int(path_id);
            printf(" %i", path_id);
            path.insert(path_id);
        }
        printf("\n");
        // oneMatchesMap[ID2IDPair(id1, id2)] = path;
    }
    printf("loading preset bitmap..\n"); fflush(stdout);
    __BITS_IN_MAP = ((__MAX_ID+1)*__MAX_ID)/2 + __MAX_ID+1;
    __MAP         = new PS_BitMap_Counted(result_file);
    __PRESET_MAP  = new PS_BitMap_Counted(false, __MAX_ID+1);
    for (id1 = 0; id1 < __MIN_ID; ++id1) {
        for (id2 = 0; id2 <= __MAX_ID; ++id2) {
            if (id1 > id2) {
                __MAP->setTrue(id1, id2);
            }
            else {
                __MAP->setTrue(id2, id1);
            }
        }
    }
    for (SpeciesID id = 0; id <= __MAX_ID; ++id) {
        __MAP->setTrue(id, id);
    }
    __MAP->recalcCounters();
    __PRESET_MAP->copy(__MAP);
    printf("..loaded result file (enter to continue)\n");
    printf("cleaning up... result file\n"); fflush(stdout);
    delete result_file;

    //
    // create or read candidates
    //
    __CANDIDATES_ROOT = new PS_Candidate(0.0);
    PS_FileBuffer *candidates_file;
    struct tms before;
    if (candidates_filename[0] != '-') {
        printf("searching candidates..\n");
        //
        // recursively build a tree of candidates
        //
        __MAX_DEPTH = 0;
        for (long species_count = __SPECIES_COUNT; species_count > 0; species_count >>= 1) {
            ++__MAX_DEPTH;
        }
        __MAX_DEPTH = (__MAX_DEPTH * 3) >> 1;
        __PATH_IN_CANDIDATES = (char *)calloc(__MAX_DEPTH+1, sizeof(char));
        __CANDIDATES_TODO = 0;
        __CANDIDATES_FINISHED = 0;
        times(&before);
        PS_descend(__CANDIDATES_ROOT, db->getConstRootNode(), 0, 0.0);
        printf("PS_descend : total ");
        PS_print_time_diff(&before);

        //
        // save candidates
        //
        printf("saving candidates to %s..\n", candidates_filename);
        candidates_file = new PS_FileBuffer(candidates_filename, PS_FileBuffer::WRITEONLY);
        __CANDIDATES_ROOT->false_IDs = __BITS_IN_MAP;
        __CANDIDATES_ROOT->save(candidates_file, __BITS_IN_MAP);
    }
    else {
        printf("loading candidates..\n");
        candidates_file = new PS_FileBuffer(candidates_filename+1, PS_FileBuffer::READONLY);
        __CANDIDATES_ROOT->load(candidates_file, __BITS_IN_MAP, db->getConstRootNode());
        printf("..loaded candidates file (enter to continue)\n");
    }
    printf("cleaning up... candidates file\n"); fflush(stdout);
    delete candidates_file;

    //
    // scan candidates-tree for leaf candidates
    //
    printf("CANDIDATES :\n");
    __CANDIDATES_ROOT->print();
    printf("\nsearching leaf candidates.. ");
    PS_CandidateSet leaf_candidates;
    PS_get_leaf_candidates(__CANDIDATES_ROOT, leaf_candidates);
    printf("%zu\n", leaf_candidates.size());

    //
    // scan tree for next candidates (below the ones in leaf_candidates)
    //
    times(&before);
    long round = 0;
    while (!leaf_candidates.empty() && round<200) {
        printf("\nsearching next candidates [round #%li]..\n", ++round);
        PS_get_next_candidates(db->getConstRootNode(), leaf_candidates);

        printf("rounds %li total ", round);
        PS_print_time_diff(&before);
    }

    printf("\nFINAL CANDIDATES:\n");
    __CANDIDATES_ROOT->print(0, true);
    printf("\nfinal leaf candidates.. (%zu)\n", leaf_candidates.size());
    PS_get_leaf_candidates(__CANDIDATES_ROOT, leaf_candidates, true);
    for (PS_CandidateSetIter c = leaf_candidates.begin();
          c != leaf_candidates.end();
          ++c) {
        (*(*c)).print();
    }

    //
    // save final candidates
    //
    printf("saving final candidates to %s..\n", final_candidates_filename);
    candidates_file = new PS_FileBuffer(final_candidates_filename, PS_FileBuffer::WRITEONLY);
    __CANDIDATES_ROOT->save(candidates_file, __BITS_IN_MAP);
    printf("cleaning up... candidates file\n"); fflush(stdout);
    delete candidates_file;

    //
    // starting with the best candidate print the __MAP for each
    // depth walking up to root of candidates-tree
    //
    if (result_out_prefix) {
        // put __MAP in the state 'after applying best_candidate and its parents'
        PS_CandidateSPtr best_candidate_smart = *leaf_candidates.begin();
        PS_CandidatePtr  best_candidate       = &(*best_candidate_smart);
        PS_ascend(best_candidate);
        PS_apply_path_to_bitmap(best_candidate->path);
        while (best_candidate) {
            PS_GNUPlot(result_out_prefix, __MAX_DEPTH--, best_candidate->path, noMatches);
            best_candidate = PS_ascend(best_candidate);
        }
    }

    //
    // clean up
    //
    printf("cleaning up... candidates\n"); fflush(stdout);
    delete __CANDIDATES_ROOT;
    free(__PATH_IN_CANDIDATES);
    printf("cleaning up... database\n"); fflush(stdout);
    delete db;
    printf("cleaning up... bitmaps\n"); fflush(stdout);
    delete __PRESET_MAP;
    delete __MAP;

    return 0;
}