count_bin.cc

/**
 * @file count_bin.cc
 * @author Melissa Ip
 *
 * This parses an input file, where the first column represents
 * the probability of mutation (as a float [0, 1]) and the second column
 * represents whether the site contains a mutation (1 is true, 0 is false). Each
 * site is placed on a new line. The file can be generated by
 * simulation_driver.cc.
 *
 * This creates 10 bins numbered 0-9 with probability cateogories at 10%
 * intervals:
 * 
 * BIN   0        1         2        ...   9
 * %    [0, 10), [10, 20), [20, 30), ..., [90, 100]
 * 
 * This calculates the percentage of the sites in each bin that contain a real
 * mutation (value in the second column is 1). The digit in the tenths place of
 * the probability represents the number of the bin it belongs to. A probability
 * of 1.00 (100%) will go in the highest bin possible, bin 9.
 *
 * To compile on Herschel:
 * c++ -std=c++11 -L/usr/local/lib -I/usr/local/include -o count_bin utility.cc count_bin.cc
 *
 * To run this file, provide the following command line inputs:
 * ./count_bin <input>.txt
 */
#include <fstream>
#include <sstream>

#include "utility.h"

const int kNumBins = 10;  // 10 bins cover 0-100% with 10% intervals.


int main(int argc, const char *argv[]) {
  if (argc < 2) {        
    Die("USAGE: count_bin <input>.txt");
  }

  const string file_name = argv[1];
  ifstream f(file_name);
  if (!f.is_open() || 0 != f.fail()) {
    Die("Input file cannot be read.");
  }

  int counts[kNumBins] = {0};
  int totals[kNumBins] = {0};
  double probability = 0.0;
  int has_mutation = 0;
  int bin = 0;
  string line;

  while (getline(f, line)) {
    line.erase(remove(line.begin(), line.end(), '\n'), line.end());
    stringstream str(line);
    str >> probability;
    str >> has_mutation;
    bin = (int) fmin(floor(probability * kNumBins), kNumBins - 1);
    totals[bin]++;
    if (has_mutation == 1) {
      counts[bin]++;
    }
  }
  f.close();

  for (int i = 0; i < kNumBins; i++) {
    if (totals[i] > 0) {
      double has_mutation_percent = (double) counts[i] / totals[i] * 100;
      printf("%.2f%% or %d/%d sites in bin %d contain a mutation.\n",
             has_mutation_percent, counts[i], totals[i], i);
    } else {
      printf("There are no sites in bin %d.\n", i);
    }
  }

  return 0;
}