bpp-seq-omics  2.4.1
DuplicateFilterMafIterator.cpp
Go to the documentation of this file.
1 //
2 // File: DuplicateFilterMafIterator.cpp
3 // Authors: Julien Dutheil
4 // Created: Tue Sep 07 2010
5 //
6 
7 /*
8 Copyright or © or Copr. Bio++ Development Team, (2010)
9 
10 This software is a computer program whose purpose is to provide classes
11 for sequences analysis.
12 
13 This software is governed by the CeCILL license under French law and
14 abiding by the rules of distribution of free software. You can use,
15 modify and/ or redistribute the software under the terms of the CeCILL
16 license as circulated by CEA, CNRS and INRIA at the following URL
17 "http://www.cecill.info".
18 
19 As a counterpart to the access to the source code and rights to copy,
20 modify and redistribute granted by the license, users are provided only
21 with a limited warranty and the software's author, the holder of the
22 economic rights, and the successive licensors have only limited
23 liability.
24 
25 In this respect, the user's attention is drawn to the risks associated
26 with loading, using, modifying and/or developing or reproducing the
27 software by the user in light of its specific status of free software,
28 that may mean that it is complicated to manipulate, and that also
29 therefore means that it is reserved for developers and experienced
30 professionals having in-depth computer knowledge. Users are therefore
31 encouraged to load and test the software's suitability as regards their
32 requirements in conditions enabling the security of their systems and/or
33 data to be ensured and, more generally, to use and operate it in the
34 same conditions as regards security.
35 
36 The fact that you are presently reading this means that you have had
37 knowledge of the CeCILL license and that you accept its terms.
38 */
39 
41 
42 using namespace bpp;
43 
44 //From the STL:
45 #include <string>
46 #include <numeric>
47 
48 using namespace std;
49 
51 {
52  currentBlock_ = iterator_->nextBlock();
53  while (currentBlock_) {
54  bool foundRef = false;
55  string chr = "";
56  char strand = '+';
57  size_t start = 0;
58  size_t stop = 0;
59  for (size_t i = 0; i < currentBlock_->getNumberOfSequences() && !foundRef; ++i) {
60  string species = currentBlock_->getSequence(i).getSpecies();
61  if (species == ref_) {
62  foundRef = true;
63  chr = currentBlock_->getSequence(i).getChromosome();
64  strand = currentBlock_->getSequence(i).getStrand();
65  start = currentBlock_->getSequence(i).start();
66  stop = currentBlock_->getSequence(i).stop();
67  }
68  }
69  if (!foundRef) {
70  if (logstream_) {
71  (*logstream_ << "DUPLICATE FILTER: block does not contain reference species and was removed.").endLine();
72  }
73  delete currentBlock_;
74  } else {
75  size_t occurrence = blocks_[chr][strand][start][stop]++;
76  if (occurrence > 0) {
77  if (logstream_) {
78  (*logstream_ << "DUPLICATE FILTER: sequence in reference species was found in a previous block. New block was removed.").endLine();
79  }
80  delete currentBlock_;
81  } else {
82  return currentBlock_;
83  }
84  }
85 
86  //Look for the next block:
87  currentBlock_ = iterator_->nextBlock();
88  }
89 
90  return currentBlock_;
91 }
92 
A synteny block data structure, the basic unit of a MAF alignement file.
Definition: MafBlock.h:57
const MafSequence & getSequence(const std::string &name) const
Definition: MafBlock.h:121
const std::string & getSpecies() const
Definition: MafSequence.h:162