Bioinformatics
Parameterized reductions and algorithms for another vertex cover generalization
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
Theoretical Computer Science
Hi-index | 0.00 |
In current proteome research, the most widely used method for protein mixture identification is probably peptide sequencing. Peptide sequencing is based on tandem Mass Spectrometry (MS/MS) data. The disadvantage is that MS/MS data only sequences a limited number of peptides and leaves many more peptides uncovered. Peptide Mass Fingerprinting (PMF) has been widely used to identify single purified proteins from single-stage MS data. Unfortunately, this technique is less accurate than the peptide sequencing method and can not handle protein mixtures, which hampers the widespread use of PMF. In this paper, we tackle the problem of protein mixture identification from an optimization point of view. We show that some simple heuristics can find good solutions to the optimization problem. As a result, we obtain much better identification results than previous methods. Through a comprehensive simulation study, we identify a set of limiting factors that hinder the performance of PMF-based protein mixture identification. We argue that it is feasible to remove these limitations and PMF can be a powerful tool in the analysis of protein mixtures, especially in the identification of low-abundance proteins which are less likely to be sequenced by MS/MS scanning. Availability: The source codes, data and supplementary documents are available at http://bioinformatics.ust.hk/PMFMixture.rar