X-Git-Url: https://ruin.nu/git/?a=blobdiff_plain;f=src%2Fgenealgorithms.h;h=59e8f9caee921c452553829d3b1e66bedf32250b;hb=ca651f2fd25147f88dbb27a27bc79bedcd9e4c81;hp=7f07d17f47476f617018e62494b7cb0ed9e738c6;hpb=e44303f027e957d05c9e9418fbd68171f3707599;p=germs.git diff --git a/src/genealgorithms.h b/src/genealgorithms.h index 7f07d17..59e8f9c 100644 --- a/src/genealgorithms.h +++ b/src/genealgorithms.h @@ -24,17 +24,23 @@ #include class GeneOrder; +struct Component; -struct Component{ - Component(int b,int e,int s):begin(b),end(e),sign(s){} - bool operator==(const Component& c){ - return begin == c.begin && end == c.end && sign == c.sign; +/** + * Simple interval struct, holds the indexes + information if the interval is + * oriented or not. + */ +struct Interval{ + Interval(size_t f,size_t s,bool o = false):first(f),second(s),oriented(o){} + bool operator==(const Interval& i){ + return first == i.first && second == i.second && oriented == i.oriented; } - int begin; - int end; - int sign; + //!The start index for this elementary interval + size_t first; + //!The end interval for this elementary interval + size_t second; + bool oriented; }; -typedef std::pair Interval; /** * Returns the length of the longest increasing sequence and the longest @@ -43,6 +49,8 @@ typedef std::pair Interval; std::pair longestSequences(const GeneOrder& go); /** + * Uses the Robinson-Schensted algorithm on the gene order. Gives the longest + * increasing and decreasing subsequences. */ std::vector > robinsonSchensted(const GeneOrder& go); @@ -67,7 +75,9 @@ std::vector findComponents(const GeneOrder& go); std::vector findIntervals(const GeneOrder& go); /** - * Creates a list with the intervals at each point. + * Creates a list with the intervals at each point. The first and second members + * of the returned Intervals are elementary intervals that start, or end, at the + * specific point. */ std::vector findIntervalsAtPoints(const std::vector& intervals);