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
|
// --------------------------------------------------------------------------
// 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: Clemens Groepl $
// $Authors: Marc Sturm, Clemens Groepl $
// --------------------------------------------------------------------------
#include <OpenMS/ANALYSIS/MAPMATCHING/MapAlignmentAlgorithmIdentification.h>
#include <OpenMS/APPLICATIONS/MapAlignerBase.h>
using namespace OpenMS;
using namespace std;
//-------------------------------------------------------------
//Doxygen docu
//-------------------------------------------------------------
/**
@page TOPP_MapAlignerIdentification MapAlignerIdentification
@brief Corrects retention time distortions between maps, using information from peptides identified in different maps.
<CENTER>
<table>
<tr>
<td ALIGN = "center" BGCOLOR="#EBEBEB"> potential predecessor tools </td>
<td VALIGN="middle" ROWSPAN=4> \f$ \longrightarrow \f$ MapAlignerIdentification \f$ \longrightarrow \f$</td>
<td ALIGN = "center" BGCOLOR="#EBEBEB"> potential successor tools </td>
</tr>
<tr>
<td VALIGN="middle" ALIGN = "center" ROWSPAN=1> @ref TOPP_XTandemAdapter @n (or another search engine adapter) </td>
<td VALIGN="middle" ALIGN = "center" ROWSPAN=1> @ref TOPP_IDMerger </td>
</tr>
<tr>
<td VALIGN="middle" ALIGN = "center" ROWSPAN=1> @ref TOPP_IDFileConverter </td>
<td VALIGN="middle" ALIGN = "center" ROWSPAN=2> @ref TOPP_FeatureLinkerUnlabeled or @n @ref TOPP_FeatureLinkerUnlabeledQT </td>
</tr>
<tr>
<td VALIGN="middle" ALIGN = "center" ROWSPAN=1> @ref TOPP_IDMapper </td>
</tr>
</table>
</CENTER>
Reference:\n
Weisser <em>et al.</em>: <a href="http://dx.doi.org/10.1021/pr300992u">An automated pipeline for high-throughput label-free quantitative proteomics</a> (J. Proteome Res., 2013, PMID: 23391308).
This tool provides an algorithm to align the retention time scales of multiple input files, correcting shifts and distortions between them. Retention time adjustment may be necessary to correct for chromatography differences e.g. before data from multiple LC-MS runs can be combined (feature grouping), or when one run should be annotated with peptide identifications obtained in a different run.
All map alignment tools (MapAligner...) collect retention time data from the input files and - by fitting a model to this data - compute transformations that map all runs to a common retention time scale. They can apply the transformations right away and return output files with aligned time scales (parameter @p out), and/or return descriptions of the transformations in trafoXML format (parameter @p trafo_out). Transformations stored as trafoXML can be applied to arbitrary files with the @ref TOPP_MapRTTransformer tool.
The map alignment tools differ in how they obtain retention time data for the modeling of transformations, and consequently what types of data they can be applied to. The alignment algorithm implemented here is based on peptide identifications, and thus applicable to files containing peptide IDs (idXML, annotated featureXML/consensusXML). It finds peptide sequences that different input files have in common and uses them as points of correspondence between the inputs. For more details and algorithm-specific parameters (set in the INI file) see "Detailed Description" in the @ref OpenMS::MapAlignmentAlgorithmIdentification "algorithm documentation".
@see @ref TOPP_MapAlignerPoseClustering @ref TOPP_MapAlignerSpectrum @ref TOPP_MapRTTransformer
Note that alignment is based on the sequence including modifications, thus an exact match is required. I.e., a peptide with oxidised methionine will not be matched to its unmodified version.
For some applications this behaviour is desired, while for others its not, but you can always remove all modifications from the input files if you want to ignore modifications.
Since %OpenMS 1.8, the extraction of data for the alignment has been separate from the modeling of RT transformations based on that data. It is now possible to use different models independently of the chosen algorithm. This algorithm has been tested mostly with the "b_spline" model. The different available models are:
- @ref OpenMS::TransformationModelLinear "linear": Linear model.
- @ref OpenMS::TransformationModelBSpline "b_spline": Smoothing spline (non-linear).
- @ref OpenMS::TransformationModelInterpolated "interpolated": Different types of interpolation.
The following parameters control the modeling of RT transformations (they can be set in the "model" section of the INI file):
@htmlinclude OpenMS_MapAlignerIdentificationModel.parameters @n
<B>The command line parameters of this tool are:</B> @n
@verbinclude TOPP_MapAlignerIdentification.cli
<B>INI file documentation of this tool:</B>
@htmlinclude TOPP_MapAlignerIdentification.html
*/
// We do not want this class to show up in the docu:
/// @cond TOPPCLASSES
class TOPPMapAlignerIdentification :
public TOPPMapAlignerBase
{
public:
TOPPMapAlignerIdentification() :
TOPPMapAlignerBase("MapAlignerIdentification", "Corrects retention time distortions between maps based on common peptide identifications.")
{
}
private:
template <typename TMapType, typename TFileType>
void loadInitialMaps(std::vector<TMapType> & maps, StringList & ins, TFileType & inputPutFile)
{
// custom progresslogger for this task
ProgressLogger progresslogger;
progresslogger.setLogType(log_type_);
progresslogger.startProgress(0, ins.size(), "loading input files");
for (Size i = 0; i < ins.size(); ++i)
{
progresslogger.setProgress(i);
inputPutFile.load(ins[i], maps[i]);
}
progresslogger.endProgress();
}
/// helper function to avoid code duplication between consensus and featureXML storage operations
template <typename TMapType, typename TFileType>
void storeTransformedMaps(std::vector<TMapType> & maps, StringList & outs, TFileType & outPutFile)
{
// custom progresslogger for this task
ProgressLogger progresslogger;
progresslogger.setLogType(log_type_);
progresslogger.startProgress(0, outs.size(), "writing output files");
for (Size i = 0; i < outs.size(); ++i)
{
progresslogger.setProgress(i);
//annotate output with data processing info
addDataProcessing_(maps[i], getProcessingInfo_(DataProcessing::ALIGNMENT));
outPutFile.store(outs[i], maps[i]);
}
progresslogger.endProgress();
}
void saveTransformationDescriotions(const std::vector<TransformationDescription> & transformations,
StringList & trafos)
{
// custom progresslogger for this task
ProgressLogger progresslogger;
progresslogger.setLogType(log_type_);
progresslogger.startProgress(0, trafos.size(), "writing transformation files");
for (Size i = 0; i < transformations.size(); ++i)
{
TransformationXMLFile().store(trafos[i], transformations[i]);
}
progresslogger.endProgress();
}
void registerOptionsAndFlags_()
{
String formats = "featureXML,consensusXML,idXML";
TOPPMapAlignerBase::registerOptionsAndFlags_(formats, true);
registerSubsection_("algorithm", "Algorithm parameters section");
registerSubsection_("model", "Options to control the modeling of retention time transformations from data");
}
Param getSubsectionDefaults_(const String & section) const
{
if (section == "algorithm")
{
MapAlignmentAlgorithmIdentification algo;
return algo.getParameters();
}
if (section == "model")
{
return getModelDefaults("b_spline");
}
// shouldn't happen
return Param();
}
ExitCodes main_(int, const char **)
{
MapAlignmentAlgorithmIdentification algorithm;
handleReference_(&algorithm);
ExitCodes returnCode = initialize_(&algorithm);
if (returnCode != EXECUTION_OK) return returnCode;
// handle in- and output files
StringList inputFiles = getStringList_("in");
StringList outputFiles = getStringList_("out");
StringList trafoFiles = getStringList_("trafo_out");
FileTypes::Type in_type = FileHandler::getType(inputFiles[0]);
// find model parameters
Param modelParams = getParam_().copy("model:", true);
String modelType = modelParams.getValue("type");
modelParams = modelParams.copy(modelType + ":", true);
// create transformations vector
std::vector<TransformationDescription> transformations;
if (in_type == FileTypes::FEATUREXML)
{
// load input
std::vector<FeatureMap<> > featureMaps(inputFiles.size());
FeatureXMLFile fxmlFile;
// no need to store featureXML, thus we can load only minimum required information
if (outputFiles.size() == 0)
{
fxmlFile.getOptions().setLoadConvexHull(false);
fxmlFile.getOptions().setLoadSubordinates(false);
}
// load maps
loadInitialMaps(featureMaps, inputFiles, fxmlFile);
algorithm.alignFeatureMaps(featureMaps, transformations);
if (modelType != "none")
{
algorithm.fitModel(modelType, modelParams, transformations);
}
MapAlignmentTransformer::transformFeatureMaps(featureMaps, transformations);
storeTransformedMaps(featureMaps, outputFiles, fxmlFile);
}
//-------------------------------------------------------------
// perform consensus alignment
//-------------------------------------------------------------
else if (in_type == FileTypes::CONSENSUSXML)
{
// load input
std::vector<ConsensusMap> cons_maps(inputFiles.size());
ConsensusXMLFile f;
// load maps
loadInitialMaps(cons_maps, inputFiles, f);
algorithm.alignConsensusMaps(cons_maps, transformations);
if (modelType != "none")
{
algorithm.fitModel(modelType, modelParams, transformations);
}
MapAlignmentTransformer::transformConsensusMaps(cons_maps, transformations);
storeTransformedMaps(cons_maps, outputFiles, f);
}
//-------------------------------------------------------------
// perform peptide alignment
//-------------------------------------------------------------
else if (in_type == FileTypes::IDXML)
{
ProgressLogger progresslogger;
progresslogger.setLogType(log_type_);
// load input
std::vector<std::vector<ProteinIdentification> > protein_ids_vec(inputFiles.size());
std::vector<std::vector<PeptideIdentification> > peptide_ids_vec(inputFiles.size());
IdXMLFile f;
progresslogger.startProgress(0, inputFiles.size(), "loading input files");
for (Size i = 0; i < inputFiles.size(); ++i)
{
progresslogger.setProgress(i);
f.load(inputFiles[i], protein_ids_vec[i], peptide_ids_vec[i]);
}
progresslogger.endProgress();
algorithm.alignPeptideIdentifications(peptide_ids_vec, transformations);
if (modelType != "none")
{
algorithm.fitModel(modelType, modelParams, transformations);
}
MapAlignmentTransformer::transformPeptideIdentifications(peptide_ids_vec,
transformations);
// write output
progresslogger.startProgress(0, outputFiles.size(), "writing output files");
for (Size i = 0; i < outputFiles.size(); ++i)
{
progresslogger.setProgress(i);
f.store(outputFiles[i], protein_ids_vec[i], peptide_ids_vec[i]);
}
progresslogger.endProgress();
}
else
{
// TODO can this really happen? I think it is tested above. Otherwise
// throw an appropriate exception?
return ILLEGAL_PARAMETERS;
}
if (!trafoFiles.empty())
{
saveTransformationDescriotions(transformations, trafoFiles);
}
return EXECUTION_OK;
}
};
int main(int argc, const char ** argv)
{
TOPPMapAlignerIdentification tool;
return tool.main(argc, argv);
}
/// @endcond
|