using namespace std;
std::pair<int,int> longestSequences(const GeneOrder& go){
+ vector<vector<int> > v = robinsonSchensted(go);
+ return pair<int,int>(v[0].size(),v.size());
}
-
-/*
-robSche2 :: [Int] -> [[Int]] -> [[Int]]
-robSche2 [] ys = ys
-robSche2 (x:xs) ys = robSche2 xs $ robSche4 x ys
-
-robSche3 :: Int -> [Int] -> (Maybe Int,[Int])
-robSche3 x ys = let yless = [y | y <- ys, y < x] in
- let ymore = [y | y <- ys, y > x] in
- case ymore of
- [] -> (Nothing, yless++[x])
- (y:ys) -> (Just y, yless++(x:ys))
-
-robSche4 :: Int -> [[Int]] -> [[Int]]
-robSche4 x [] = [[x]]
-robSche4 x (y:ys) = case robSche3 x y of
- (Nothing, y) -> y:ys
- (Just x, y) -> y:robSche4 x ys
-*/
std::vector<std::vector<int> > robinsonSchensted(const GeneOrder& go){
vector<vector<int> > v;
for (GeneOrder::iterator i = go.begin(); i != go.end(); ++i){
{
CPPUNIT_TEST_SUITE( TESTNAME );
CPPUNIT_TEST( testRobinsonSchensted );
+ CPPUNIT_TEST( testLongestSequences );
CPPUNIT_TEST_SUITE_END();
protected:
CPPUNIT_ASSERT(equal(v[1].begin(),v[1].end(),second));
}
+ void testLongestSequences (){
+ GeneOrder go(_validPerm.begin(),_validPerm.end());
+ pair<int,int> p = longestSequences(go);
+ CPPUNIT_ASSERT_EQUAL(5,p.first);
+ CPPUNIT_ASSERT_EQUAL(1,p.second);
+
+ GeneOrder go2(_validPerm2.begin(),_validPerm2.end());
+ p = longestSequences(go2);
+ int first[] = {0,1,3,5,6,7,9};
+ int second[] = {2,4,8};
+ CPPUNIT_ASSERT_EQUAL(7,p.first);
+ CPPUNIT_ASSERT_EQUAL(2,p.second);
+ }
+
};
CPPUNIT_TEST_SUITE_REGISTRATION( TESTNAME );