Groups corresponding features from multiple maps using Wasserstein optimal transport.

potential predecessor tools	→ FeatureLinkerWNet →	potential successor tools
FeatureFinderCentroided (or another feature detection algorithm)		ProteinQuantifier
MapAlignerPoseClustering (or another map alignment algorithm)		TextExporter

This tool provides an algorithm for grouping corresponding features in multiple runs of label-free experiments using Wasserstein (optimal transport) distance. Features are matched by solving a minimum-cost network flow problem over their (m/z, RT) positions.

For more details and algorithm-specific parameters (set in the ini file) see "Detailed Description" in the algorithm documentation.

FeatureLinkerWNet takes several feature maps (featureXML files) and stores the corresponding features in a consensus map (consensusXML file). Feature maps can be created from MS experiments (peak data) using one of the FeatureFinder TOPP tools.

Note: FeatureLinkerWNet is only built when OpenMS is configured with -DWITH_WNETALIGN=ON (off by default).

See also: FeatureLinkerUnlabeledQT FeatureLinkerUnlabeledKD