NDLI: A Combinatorial Perspective of the Protein Inference Problem

Content Provider	ACM Digital Library
Author	Yu, Weichuan He, Zengyou Yang, Chao
Abstract	In a shotgun proteomics experiment, proteins are the most biologically meaningful output. The success of proteomics studies depends on the ability to accurately and efficiently identify proteins. Many methods have been proposed to facilitate the identification of proteins from peptide identification results. However, the relationship between protein identification and peptide identification has not been thoroughly explained before. In this paper, we devote ourselves to a combinatorial perspective of the protein inference problem. We employ combinatorial mathematics to calculate the conditional protein probabilities (protein probability means the probability that a protein is correctly identified) under three assumptions, which lead to a lower bound, an upper bound, and an empirical estimation of protein probabilities, respectively. The combinatorial perspective enables us to obtain an analytical expression for protein inference. Our method achieves comparable results with ProteinProphet in a more efficient manner in experiments on two data sets of standard protein mixtures and two data sets of real samples. Based on our model, we study the impact of unique peptides and degenerate peptides (degenerate peptides are peptides shared by at least two proteins) on protein probabilities. Meanwhile, we also study the relationship between our model and ProteinProphet. We name our program ProteinInfer. Its Java source code, our supplementary document and experimental results are available at: >http://bioinformatics.ust.hk/proteininfer.
Starting Page	1542
Ending Page	1547
Page Count	6
File Format	PDF
ISSN	15455963
DOI	10.1109/TCBB.2013.110
Volume Number	10
Issue Number	6
Journal	IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-11-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Protein identification, combinatorial perspective, analytical formulation, probability bounds
Content Type	Text
Resource Type	Article
Subject	Genetics Biotechnology Applied Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Combinatorial Perspective of the Protein Inference Problem

Nature Reserve Selection Problem: A Tight Approximation Algorithm

Faster Mass Spectrometry-Based Protein Inference: Junction Trees Are More Efficient than Sampling and Marginalization by Enumeration

A Combinatorial Perspective of the Protein Inference Problem

A Combinatorial Perspective of the Protein Inference Problem

Cover-based combinatorial bounds on probability of overfitting

Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem

Simultaneous Identification of Duplications and Lateral Gene Transfers

Lower bounds in the combinatorial problem of Erdös and Lovász

A Combinatorial Perspective of the Protein Inference Problem

Similar Documents

A Combinatorial Perspective of the Protein Inference Problem

Nature Reserve Selection Problem: A Tight Approximation Algorithm

Faster Mass Spectrometry-Based Protein Inference: Junction Trees Are More Efficient than Sampling and Marginalization by Enumeration

A Combinatorial Perspective of the Protein Inference Problem

A Combinatorial Perspective of the Protein Inference Problem

Cover-based combinatorial bounds on probability of overfitting

Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem

Simultaneous Identification of Duplications and Lateral Gene Transfers

Lower bounds in the combinatorial problem of Erdös and Lovász

A Combinatorial Perspective of the Protein Inference Problem