infer_parsimonious_accessions {MSnID} | R Documentation |
Infer parsimonious set of accessions (e.g. proteins) that explains all the peptide sequences. The algorithm is a simple loop that looks for the accession explaining most peptides, records the peptide-to-accession mapping for this accession, removes those peptides, and then looks for next best accession. The loop continues until no peptides left. The method does not accept any arguments at this point (except the MSnID object itself).
infer_parsimonious_accessions(object, unique_only=FALSE)
object |
An instance of class "MSnID". |
unique_only |
If TRUE, peptides mapping to multiple accessions are dropped and only unique are retained. If FALSE, then shared peptides assigned according to Occam's razor rule. That is a shared peptide is assigned to a protein with larger number of unique peptides. If the number of unique peptides is the same, then to the first accession. Default is FALSE. |
Although the algorithm is rather simple it is THE algorithm used for inferring maximal matching in bipartate graphs and is used in the IDPicker software.
Returns an instance of "MSnID" with minimal set of proteins necessary to explain all the peptide sequences.
Vladislav A Petyuk vladislav.petyuk@pnnl.gov
data(c_elegans) # explicitely adding parameters that will be used for data filtering msnidObj$msmsScore <- -log10(msnidObj$`MS-GF:SpecEValue`) msnidObj$absParentMassErrorPPM <- abs(mass_measurement_error(msnidObj)) # quick-and-dirty filter. The filter is too strong for the sake of saving time # at the minimal set of proteins inference step. msnidObj <- apply_filter(msnidObj, 'msmsScore > 12 & absParentMassErrorPPM < 2') show(msnidObj) msnidObj2 <- infer_parsimonious_accessions(msnidObj) show(msnidObj2)