A feature grouping algorithm for unlabeled data. More...
#include <OpenMS/ANALYSIS/MAPMATCHING/FeatureGroupingAlgorithmQT.h>
Public Member Functions | ||||
| FeatureGroupingAlgorithmQT () | ||||
| Default constructor. | ||||
| virtual | ~FeatureGroupingAlgorithmQT () | |||
| Destructor. | ||||
| virtual void | group (const std::vector< FeatureMap<> > &maps, ConsensusMap &out) | |||
Applies the algorithm to feature maps
| ||||
| virtual void | group (const std::vector< ConsensusMap > &maps, ConsensusMap &out) | |||
Applies the algorithm to consensus maps
| ||||
Static Public Member Functions | ||||
| static FeatureGroupingAlgorithm * | create () | |||
| Creates a new instance of this class (for Factory). | ||||
| static String | getProductName () | |||
| Returns the product name (for the Factory). | ||||
Private Member Functions | ||||
| FeatureGroupingAlgorithmQT (const FeatureGroupingAlgorithmQT &) | ||||
| Copy constructor intentionally not implemented -> private. | ||||
| FeatureGroupingAlgorithmQT & | operator= (const FeatureGroupingAlgorithmQT &) | |||
| Assignment operator intentionally not implemented -> private. | ||||
| template<typename MapType > | ||||
| void | group_ (const std::vector< MapType > &maps, ConsensusMap &out) | |||
Applies the algorithm to feature or consensus maps
| ||||
A feature grouping algorithm for unlabeled data.
The algorithm takes a number of feature or consensus maps and searches for corresponding (consensus) features across different maps. The maps have to be aligned (i.e. retention time distortions corrected, e.g. using one of the MapAlignmentAlgorithms), but small deviations are tolerated.
This particular algorithm accumulates the features from all input maps, then applies a variant of QT clustering to find groups of corresponding features. For more details, see QTClusterFinder.
Parameters of this class are:| Name | Type | Default | Restrictions | Description |
|---|---|---|---|---|
| use_identifications | string | false | true, false | Never link features that are annotated with different peptides (only the best hit per peptide identification is taken into account). |
| ignore_charge | string | false | true, false | Compare features normally even if their charge states are different |
| distance_RT:max_difference | float | 100 | min: 0 | Maximum allowed difference in RT in seconds |
| distance_RT:exponent | float | 1 | min: 0 | Normalized RT differences are raised to this power (using 1 or 2 will be fast, everything else is REALLY slow) |
| distance_RT:weight | float | 1 | min: 0 | RT distances are weighted by this factor |
| distance_MZ:max_difference | float | 0.3 | min: 0 | Maximum allowed difference in m/z (unit defined by 'unit') |
| distance_MZ:unit | string | Da | Da, ppm | Unit of the 'max_difference' parameter |
| distance_MZ:exponent | float | 2 | min: 0 | Normalized m/z differences are raised to this power (using 1 or 2 will be fast, everything else is REALLY slow) |
| distance_MZ:weight | float | 1 | min: 0 | m/z distances are weighted by this factor |
| distance_intensity:exponent | float | 1 | min: 0 | Differences in relative intensity are raised to this power (using 1 or 2 will be fast, everything else is REALLY slow) |
| distance_intensity:weight | float | 0 | min: 0 | Distances based on relative intensity are weighted by this factor |
Default constructor.
| virtual ~FeatureGroupingAlgorithmQT | ( | ) | [virtual] |
Destructor.
| FeatureGroupingAlgorithmQT | ( | const FeatureGroupingAlgorithmQT & | ) | [private] |
Copy constructor intentionally not implemented -> private.
| static FeatureGroupingAlgorithm* create | ( | ) | [inline, static] |
Creates a new instance of this class (for Factory).
| virtual void group | ( | const std::vector< ConsensusMap > & | maps, | |
| ConsensusMap & | out | |||
| ) | [virtual] |
Applies the algorithm to consensus maps
| IllegalArgument | is thrown if less than two input maps are given. |
Reimplemented from FeatureGroupingAlgorithm.
| virtual void group | ( | const std::vector< FeatureMap<> > & | maps, | |
| ConsensusMap & | out | |||
| ) | [virtual] |
Applies the algorithm to feature maps
| IllegalArgument | is thrown if less than two input maps are given. |
Implements FeatureGroupingAlgorithm.
| void group_ | ( | const std::vector< MapType > & | maps, | |
| ConsensusMap & | out | |||
| ) | [private] |
Applies the algorithm to feature or consensus maps
| IllegalArgument | is thrown if less than two input maps are given. |
| FeatureGroupingAlgorithmQT& operator= | ( | const FeatureGroupingAlgorithmQT & | ) | [private] |
Assignment operator intentionally not implemented -> private.
| OpenMS / TOPP release 1.10.0 | Documentation generated on Thu Mar 7 2013 09:42:49 using doxygen 1.7.1 |