src/genealgorithms.cpp

   1 /***************************************************************************
   2  *   Copyright (C) 2006 by Michael Andreen                                 *
   3  *   andreen@student.chalmers.se                                           *
   4  *                                                                         *
   5  *   This program is free software; you can redistribute it and/or modify  *
   6  *   it under the terms of the GNU General Public License as published by  *
   7  *   the Free Software Foundation; either version 2 of the License, or     *
   8  *   (at your option) any later version.                                   *
   9  *                                                                         *
  10  *   This program is distributed in the hope that it will be useful,       *
  11  *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
  12  *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
  13  *   GNU General Public License for more details.                          *
  14  *                                                                         *
  15  *   You should have received a copy of the GNU General Public License     *
  16  *   along with this program; if not, write to the                         *
  17  *   Free Software Foundation, Inc.,                                       *
  18  *   51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA          *
  19  ***************************************************************************/
  20
  21 #include "genealgorithms.h"
  22 #include "geneorder.h"
  23
  24 #include <algorithm>
  25 #include <cstdlib>
  26 using namespace std;
  27
  28 std::pair<int,int> longestSequences(const GeneOrder& go){
  29         vector<vector<int> > v = robinsonSchensted(go);
  30         return pair<int,int>(v[0].size(),v.size());
  31 }
  32
  33 std::vector<std::vector<int> > robinsonSchensted(const GeneOrder& go){
  34         vector<vector<int> > v;
  35         for (GeneOrder::iterator i = go.begin(); i != go.end(); ++i){
  36                 int n = abs(*i);
  37                 bool added = false;
  38                 for (vector<vector<int> >::iterator vs = v.begin();
  39                                 vs != v.end(); ++vs){
  40                         vector<int>::iterator bigger = upper_bound(vs->begin(),vs->end(),n);
  41                         if ( bigger == vs->end()){
  42                                 vs->push_back(n);
  43                                 added = true;
  44                                 break;
  45                         }else{
  46                                 swap(n,*bigger);
  47                         }
  48                 }
  49                 if (!added){
  50                         v.push_back(vector<int>());
  51                         v.back().push_back(n);
  52                 }
  53         }
  54         return v;
  55 }