OpenMS
ConsensusIDAlgorithmWorst.h
Go to the documentation of this file.
1 // Copyright (c) 2002-present, The OpenMS Team -- EKU Tuebingen, ETH Zurich, and FU Berlin
2 // SPDX-License-Identifier: BSD-3-Clause
3 //
4 // --------------------------------------------------------------------------
5 // $Maintainer: Hendrik Weisser $
6 // $Authors: Andreas Bertsch, Marc Sturm, Sven Nahnsen, Hendrik Weisser $
7 // --------------------------------------------------------------------------
8 
9 #pragma once
10 
12 
13 namespace OpenMS
14 {
22  class OPENMS_DLLAPI ConsensusIDAlgorithmWorst :
24  {
25  public:
28 
29  private:
32 
35 
37  double getAggregateScore_(std::vector<double>& scores,
38  bool higher_better) override;
39  };
40 
41 } // namespace OpenMS
42 
Abstract base class for ConsensusID algorithms that compare only identical sequences.
Definition: ConsensusIDAlgorithmIdentity.h:28
Calculates a consensus from multiple ID runs by taking the worst search score (conservative approach)...
Definition: ConsensusIDAlgorithmWorst.h:24
ConsensusIDAlgorithmWorst & operator=(const ConsensusIDAlgorithmWorst &)
Not implemented.
double getAggregateScore_(std::vector< double > &scores, bool higher_better) override
Aggregate peptide scores into one final score (by taking the worst score)
ConsensusIDAlgorithmWorst(const ConsensusIDAlgorithmWorst &)
Not implemented.
ConsensusIDAlgorithmWorst()
Default constructor.
Main OpenMS namespace.
Definition: openswathalgo/include/OpenMS/OPENSWATHALGO/DATAACCESS/ISpectrumAccess.h:19