/usr/include/OpenMS/ANALYSIS/OPENSWATH/MRMTransitionGroupPicker.h is in libopenms-dev 1.11.1-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 | // --------------------------------------------------------------------------
// OpenMS -- Open-Source Mass Spectrometry
// --------------------------------------------------------------------------
// Copyright The OpenMS Team -- Eberhard Karls University Tuebingen,
// ETH Zurich, and Freie Universitaet Berlin 2002-2013.
//
// This software is released under a three-clause BSD license:
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// * Neither the name of any author or any participating institution
// may be used to endorse or promote products derived from this software
// without specific prior written permission.
// For a full list of authors, refer to the file AUTHORS.
// --------------------------------------------------------------------------
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL ANY OF THE AUTHORS OR THE CONTRIBUTING
// INSTITUTIONS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// --------------------------------------------------------------------------
// $Maintainer: Hannes Roest $
// $Authors: Hannes Roest $
// --------------------------------------------------------------------------
#ifndef OPENMS_ANALYSIS_OPENSWATH_MRMTRANSITIONGROUPPICKER_H
#define OPENMS_ANALYSIS_OPENSWATH_MRMTRANSITIONGROUPPICKER_H
#include <OpenMS/KERNEL/MRMTransitionGroup.h>
#include <OpenMS/KERNEL/MRMFeature.h>
#include <OpenMS/KERNEL/MSSpectrum.h>
#include <OpenMS/KERNEL/MSChromatogram.h>
#include <OpenMS/KERNEL/ChromatogramPeak.h>
#include <OpenMS/FILTERING/NOISEESTIMATION/SignalToNoiseEstimatorMedian.h>
#include <OpenMS/FILTERING/SMOOTHING/SavitzkyGolayFilter.h>
#include <OpenMS/FILTERING/SMOOTHING/GaussFilter.h>
#include <OpenMS/FILTERING/TRANSFORMERS/LinearResampler.h>
#include <OpenMS/FILTERING/TRANSFORMERS/LinearResamplerAlign.h>
#include <OpenMS/TRANSFORMATIONS/RAW2PEAK/PeakPickerHiRes.h>
//#define DEBUG_TRANSITIONGROUPPICKER
namespace OpenMS
{
/**
@brief The MRMTransitionGroupPicker finds peaks in chromatograms that belong to the same precursors.
@htmlinclude OpenMS_MRMTransitionGroupPicker.parameters
It is called through pickTransitionGroup which will accept an
MRMTransitionGroup filled with n chromatograms and perform the following steps:
- Step 1: find features (peaks) in individual chromatograms
- Step 2: merge these features to consensus features that span multiple chromatograms
Step 1 is performed by smoothing the individual chromatogram and applying the
PeakPickerHiRes.
Step 2 is performed by finding the largest peak overall and use this to
create a feature, propagating this through all chromatograms.
*/
class OPENMS_DLLAPI MRMTransitionGroupPicker :
public DefaultParamHandler
{
public:
// this is the type in which we store the chromatograms for this analysis
typedef MSSpectrum<ChromatogramPeak> RichPeakChromatogram;
protected:
UInt sgolay_frame_length_;
UInt sgolay_polynomial_order_;
DoubleReal gauss_width_;
bool use_gauss_;
String background_subtraction_;
DoubleReal peak_width_;
DoubleReal signal_to_noise_;
DoubleReal sn_win_len_;
UInt sn_bin_count_;
int stop_after_feature_;
DoubleReal stop_after_intensity_ratio_;
std::vector<RichPeakChromatogram> picked_chroms_;
std::vector<RichPeakChromatogram> smoothed_chroms_;
/// @name Resampling methods
//@{
/// create an empty master peak container that has the correct mz / RT values set
template <typename SpectrumT, typename TransitionT>
void prepareMasterContainer_(MRMTransitionGroup<SpectrumT, TransitionT> & transition_group,
SpectrumT & master_peak_container, int chr_idx, double best_left, double best_right)
{
const SpectrumT & ref_chromatogram = transition_group.getChromatograms()[chr_idx];
// search for begin / end of the reference chromatogram (and add one more point)
typename SpectrumT::const_iterator begin = ref_chromatogram.begin();
while (begin != ref_chromatogram.end() && begin->getMZ() < best_left) {begin++; }
if (begin != ref_chromatogram.begin()) {begin--; }
typename SpectrumT::const_iterator end = begin;
while (end != ref_chromatogram.end() && end->getMZ() < best_right) {end++; }
if (end != ref_chromatogram.end()) {end++; }
// resize the master container and set the m/z values to the ones of the master container
master_peak_container.resize(distance(begin, end));
typename SpectrumT::iterator it = master_peak_container.begin();
for (typename SpectrumT::const_iterator chrom_it = begin; chrom_it != end; chrom_it++, it++)
{
it->setMZ(chrom_it->getMZ());
}
}
/// use the master container from above to resample a chromatogram at those points stored in the master container
template <typename SpectrumT>
SpectrumT resampleChromatogram_(const SpectrumT & chromatogram,
SpectrumT & master_peak_container, double best_left, double best_right)
{
// get the start / end point of this chromatogram => go one past
// best_left / best_right to make the resampling accurate also at the
// edge.
typename SpectrumT::const_iterator begin = chromatogram.begin();
while (begin != chromatogram.end() && begin->getMZ() < best_left) {begin++; }
if (begin != chromatogram.begin()) {begin--; }
typename SpectrumT::const_iterator end = begin;
while (end != chromatogram.end() && end->getMZ() < best_right) {end++; }
if (end != chromatogram.end()) {end++; }
SpectrumT resampled_peak_container = master_peak_container; // copy the master container, which contains the RT values
LinearResamplerAlign lresampler;
lresampler.raster(begin, end, resampled_peak_container.begin(), resampled_peak_container.end());
#if DEBUG_TRANSITIONGROUPPICKER
{
std::cout << "=========================================================================== " << std::endl;
double tot;
tot = 0;
for (typename SpectrumT::const_iterator it = begin; it != end; it++)
{
std::cout << " before resampl " << *it << std::endl;
tot += it->getIntensity();
}
std::cout << " total " << tot << std::endl;
tot = 0;
for (typename SpectrumT::iterator it = resampled_peak_container.begin(); it != resampled_peak_container.end(); it++)
{
std::cout << " resampl " << *it << std::endl;
tot += it->getIntensity();
}
std::cout << " total " << tot << std::endl;
std::cout << " resampled size " << resampled_peak_container.size() << std::endl;
}
#endif
return resampled_peak_container;
}
//@}
/// Will use the smoothed chromatograms
double calculateBgEstimation_(const RichPeakChromatogram& smoothed_chromat, double best_left, double best_right);
/// Synchronize members with param class
void updateMembers_();
/// Assignment operator is private for algorithm
MRMTransitionGroupPicker& operator=(const MRMTransitionGroupPicker& rhs);
public:
//@{
/// Constructor
MRMTransitionGroupPicker();
/// Destructor
~MRMTransitionGroupPicker();
//@}
/// This function will accept a MRMTransitionGroup with raw chromatograms,
/// create features on it and add the features back to the
/// MRMTransitionGroup.
template <typename SpectrumT, typename TransitionT>
void pickTransitionGroup(MRMTransitionGroup<SpectrumT, TransitionT> & transition_group)
{
// Pick chromatograms
picked_chroms_.clear();
for (Size k = 0; k < transition_group.getChromatograms().size(); k++)
{
RichPeakChromatogram& chromatogram = transition_group.getChromatograms()[k];
if (!chromatogram.isSorted()) { chromatogram.sortByPosition(); }
// pickChromatogram will return the picked and the smoothed chromatogram
RichPeakChromatogram picked_chrom, smoothed_chrom;
pickChromatogram(chromatogram, smoothed_chrom, picked_chrom);
picked_chrom.sortByIntensity(); // we could do without that
picked_chroms_.push_back(picked_chrom);
smoothed_chroms_.push_back(smoothed_chrom);
}
// Find features (peak groups) in this group of transitions.
// While there are still peaks left, one will be picked and used to create
// a feature. Whenever we run out of peaks, we will get -1 back as index
// and terminate.
int chr_idx, peak_idx, cnt = 0;
while (true)
{
chr_idx = -1; peak_idx = -1;
findLargestPeak(picked_chroms_, chr_idx, peak_idx);
if (chr_idx == -1 && peak_idx == -1) break;
/*
// FEATURE (hroest) check that this left/right do not collide with any already present features -- if so, re-set the left/right
double best_left = picked_chroms[chr_idx].getFloatDataArrays()[1][peak_idx];
double best_right = picked_chroms[chr_idx].getFloatDataArrays()[2][peak_idx];
*/
// get feature, prevent non-extended zero features to be added
MRMFeature mrm_feature = createMRMFeature(transition_group, picked_chroms_, chr_idx, peak_idx);
if (mrm_feature.getIntensity() > 0)
{
transition_group.addFeature(mrm_feature);
}
cnt++;
if ((stop_after_feature_ > 0 && cnt > stop_after_feature_) && mrm_feature.getIntensity() / (double)mrm_feature.getMetaValue("total_xic") < stop_after_intensity_ratio_)
{
break;
}
}
}
/// Finds peaks in a chromatogram and annotates left/right borders
// This function will return a smoothed chromatogram and a picked chromatogram
void pickChromatogram(const RichPeakChromatogram& chromatogram, RichPeakChromatogram& smoothed_chrom, RichPeakChromatogram& picked_chrom);
/// Create feature from a vector of chromatograms and a specified peak
template <typename SpectrumT, typename TransitionT>
MRMFeature createMRMFeature(MRMTransitionGroup<SpectrumT, TransitionT> & transition_group,
std::vector<SpectrumT> & picked_chroms, int & chr_idx, int & peak_idx)
{
MRMFeature mrmFeature;
const double best_left = picked_chroms[chr_idx].getFloatDataArrays()[1][peak_idx];
const double best_right = picked_chroms[chr_idx].getFloatDataArrays()[2][peak_idx];
const double peak_apex = picked_chroms[chr_idx][peak_idx].getRT();
// Remove other, overlapping, picked peaks (in this and other
// chromatograms) and then ensure that at least one peak is set to zero
// (the currently best peak).
remove_overlapping_features(picked_chroms, best_left, best_right);
picked_chroms[chr_idx][peak_idx].setIntensity(0.0);
// Prepare linear resampling of all the chromatograms, here creating the
// empty master_peak_container with the same RT (m/z) values as the reference
// chromatogram.
SpectrumT master_peak_container;
prepareMasterContainer_(transition_group, master_peak_container, chr_idx, best_left, best_right);
double total_intensity = 0; double total_peak_apices = 0; double total_xic = 0;
for (Size k = 0; k < transition_group.getChromatograms().size(); k++)
{
const SpectrumT& chromatogram = transition_group.getChromatograms()[k];
for (typename SpectrumT::const_iterator it = chromatogram.begin(); it != chromatogram.end(); it++)
{
total_xic += it->getIntensity();
}
// resample the current chromatogram
const SpectrumT used_chromatogram = resampleChromatogram_(chromatogram, master_peak_container, best_left, best_right);
// const SpectrumT& used_chromatogram = chromatogram; // instead of resampling
Feature f;
double quality = 0;
f.setQuality(0, quality);
f.setOverallQuality(quality);
ConvexHull2D::PointArrayType hull_points;
DoubleReal intensity_sum(0.0), rt_sum(0.0);
double peak_apex_int = -1;
double peak_apex_dist = std::fabs(used_chromatogram.begin()->getMZ() - peak_apex);
// FEATURE : use RTBegin / MZBegin -> for this we need to know whether the template param is a real chromatogram or a spectrum!
for (typename SpectrumT::const_iterator it = used_chromatogram.begin(); it != used_chromatogram.end(); it++)
{
if (it->getMZ() > best_left && it->getMZ() < best_right)
{
DPosition<2> p;
p[0] = it->getMZ();
p[1] = it->getIntensity();
hull_points.push_back(p);
if (std::fabs(it->getMZ() - peak_apex) <= peak_apex_dist)
{
peak_apex_int = p[1];
peak_apex_dist = std::fabs(it->getMZ() - peak_apex);
}
rt_sum += it->getMZ();
intensity_sum += it->getIntensity();
}
}
if (background_subtraction_ != "none")
{
double background = 0;
// we use the smoothed chromatogram here to have a more accurate estimatation of the noise at the flanks of the peak
if (background_subtraction_ == "smoothed")
{
if (smoothed_chroms_.size() <= k)
{
std::cerr << "Tried to calculate background estimation without any smoothed chromatograms" << std::endl;
background = 0;
}
else
{
background = calculateBgEstimation_(smoothed_chroms_[k], best_left, best_right);
}
}
else if (background_subtraction_ == "original")
{
background = calculateBgEstimation_(used_chromatogram, best_left, best_right);
}
intensity_sum -= background;
if (intensity_sum < 0)
{
std::cerr << "Warning: Intensity was below 0 after background subtraction: " << intensity_sum << ". Setting it to 0." << std::endl;
intensity_sum = 0;
}
}
f.setRT(picked_chroms[chr_idx][peak_idx].getMZ());
f.setMZ(chromatogram.getMetaValue("product_mz"));
f.setIntensity(intensity_sum);
ConvexHull2D hull;
hull.setHullPoints(hull_points);
f.getConvexHulls().push_back(hull);
f.setMetaValue("MZ", chromatogram.getMetaValue("product_mz"));
f.setMetaValue("native_id", chromatogram.getNativeID());
f.setMetaValue("peak_apex_int", peak_apex_int);
//f.setMetaValue("leftWidth", best_left);
//f.setMetaValue("rightWidth", best_right);
total_intensity += intensity_sum;
total_peak_apices += peak_apex_int;
mrmFeature.addFeature(f, chromatogram.getNativeID()); //map index and feature
}
mrmFeature.setRT(picked_chroms[chr_idx][peak_idx].getMZ());
mrmFeature.setIntensity(total_intensity);
mrmFeature.setMetaValue("PeptideRef", transition_group.getTransitionGroupID());
mrmFeature.setMetaValue("leftWidth", best_left);
mrmFeature.setMetaValue("rightWidth", best_right);
mrmFeature.setMetaValue("total_xic", total_xic);
mrmFeature.setMetaValue("peak_apices_sum", total_peak_apices);
return mrmFeature;
}
// maybe private, but we have tests
/// Remove overlaping features that are within the current seed feature or overlap with it
template <typename SpectrumT>
void remove_overlapping_features(std::vector<SpectrumT> & picked_chroms, double best_left, double best_right)
{
// delete all seeds that lie within the current seed
for (Size k = 0; k < picked_chroms.size(); k++)
{
for (Size i = 0; i < picked_chroms[k].size(); i++)
{
if (picked_chroms[k][i].getMZ() >= best_left && picked_chroms[k][i].getMZ() <= best_right)
{
picked_chroms[k][i].setIntensity(0.0);
}
}
}
// delete all seeds that overlap within the current seed
for (Size k = 0; k < picked_chroms.size(); k++)
{
for (Size i = 0; i < picked_chroms[k].size(); i++)
{
double left = picked_chroms[k].getFloatDataArrays()[1][i];
double right = picked_chroms[k].getFloatDataArrays()[2][i];
if ((left >= best_left && left <= best_right)
|| (right >= best_left && right <= best_right))
{
picked_chroms[k][i].setIntensity(0.0);
}
}
}
}
/// Find largest peak in a vector of chromatograms
void findLargestPeak(std::vector<RichPeakChromatogram>& picked_chroms, int& chr_idx, int& peak_idx);
};
}
#endif
|