+ vector<Interval> intervals(go.size()-1,Interval(go.size(),go.size()));
+ size_t n = 0;
+ for (GeneOrder::iterator g = go.begin(); g != go.end(); ++g, ++n){
+ size_t i = abs(*g);
+ if (i < go.size() - 1)
+ intervals[i].first = n + (*g >= 0 ? 1 : 0);
+ if (i > 0)
+ intervals[i-1].second = n + (*g < 0 ? 1 : 0);
+ }
+ return intervals;
+}
+
+/**
+ * TODO: Think of a better than O(n^2) implementation.
+ * Possibly move to cache result
+ */
+std::vector<Interval> findIntervalsAtPoints(const vector<Interval>& intervals){
+ vector<Interval> points;
+ points.push_back(Interval(intervals.size(),intervals.size())); //Dummy interval to match point and index
+ for (size_t p = 1; p <= intervals.size(); ++p){