Hao Lin1, Lin He, Bin Ma. 1. David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1.
Abstract
MOTIVATION: Label-free quantification is an important approach to identify biomarkers, as it measures the quantity change of peptides across different biological samples. One of the fundamental steps for label-free quantification is to match the peptide features that are detected in two datasets to each other. Although ad hoc software tools exist for the feature matching, the definition of a combinatorial model for this problem is still not available. RESULTS: A combinatorial model is proposed in this article. Each peptide feature contains a mass value and a retention time value, which are used to calculate a matching weight between a pair of features. The feature matching is to find the maximum-weighted matching between the two sets of features, after applying a to-be-computed time alignment function to all the retention time values of one set of the features. This is similar to the maximum matching problem in a bipartite graph. But we show that the requirement of time alignment makes the problem NP-hard. Practical algorithms are also provided. Experiments on real data show that the algorithm compares favorably with other existing methods. CONTACT: binma@uwaterloo.ca SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
MOTIVATION: Label-free quantification is an important approach to identify biomarkers, as it measures the quantity change of peptides across different biological samples. One of the fundamental steps for label-free quantification is to match the peptide features that are detected in two datasets to each other. Although ad hoc software tools exist for the feature matching, the definition of a combinatorial model for this problem is still not available. RESULTS: A combinatorial model is proposed in this article. Each peptide feature contains a mass value and a retention time value, which are used to calculate a matching weight between a pair of features. The feature matching is to find the maximum-weighted matching between the two sets of features, after applying a to-be-computed time alignment function to all the retention time values of one set of the features. This is similar to the maximum matching problem in a bipartite graph. But we show that the requirement of time alignment makes the problem NP-hard. Practical algorithms are also provided. Experiments on real data show that the algorithm compares favorably with other existing methods. CONTACT: binma@uwaterloo.ca SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Authors: Michael R Hall; Kevin M Kocot; Kenneth W Baughman; Selene L Fernandez-Valverde; Marie E A Gauthier; William L Hatleberg; Arunkumar Krishnan; Carmel McDougall; Cherie A Motti; Eiichi Shoguchi; Tianfang Wang; Xueyan Xiang; Min Zhao; Utpal Bose; Chuya Shinzato; Kanako Hisata; Manabu Fujie; Miyuki Kanda; Scott F Cummins; Noriyuki Satoh; Sandie M Degnan; Bernard M Degnan Journal: Nature Date: 2017-04-05 Impact factor: 49.962
Authors: Derek J Bailey; Molly T McDevitt; Michael S Westphall; David J Pagliarini; Joshua J Coon Journal: J Proteome Res Date: 2014-03-18 Impact factor: 4.466
Authors: Hussein Kaddour; Yuan Lyu; Jennifer L Welch; Victor Paromov; Sammed N Mandape; Shruti S Sakhare; Jui Pandhare; Jack T Stapleton; Siddharth Pratap; Chandravanu Dash; Chioma M Okeoma Journal: Mol Cell Proteomics Date: 2019-11-01 Impact factor: 7.381