class GeneOrder;
struct Component;
-
+/**
+ * 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){
std::pair<int,int> longestSequences(const GeneOrder& go);
/**
+ * Uses the Robinson-Schensted algorithm on the gene order. Gives the longest
+ * increasing and decreasing subsequences.
*/
std::vector<std::vector<int> > robinsonSchensted(const GeneOrder& go);