An algorithm for decoy-free false discovery rate estimation in XL-MS/MS proteomics.


Journal

Bioinformatics (Oxford, England)
ISSN: 1367-4811
Titre abrégé: Bioinformatics
Pays: England
ID NLM: 9808944

Informations de publication

Date de publication:
28 Jun 2024
Historique:
medline: 28 6 2024
pubmed: 28 6 2024
entrez: 28 6 2024
Statut: ppublish

Résumé

Cross-linking tandem mass spectrometry (XL-MS/MS) is an established analytical platform used to determine distance constraints between residues within a protein or from physically interacting proteins, thus improving our understanding of protein structure and function. To aid biological discovery with XL-MS/MS, it is essential that pairs of chemically linked peptides be accurately identified, a process that requires: (i) database search, that creates a ranked list of candidate peptide pairs for each experimental spectrum and (ii) false discovery rate (FDR) estimation, that determines the probability of a false match in a group of top-ranked peptide pairs with scores above a given threshold. Currently, the only available FDR estimation mechanism in XL-MS/MS is the target-decoy approach (TDA). However, despite its simplicity, TDA has both theoretical and practical limitations that impact the estimation accuracy and increase run time over potential decoy-free approaches (DFAs). We introduce a novel decoy-free framework for FDR estimation in XL-MS/MS. Our approach relies on multi-sample mixtures of skew normal distributions, where the latent components correspond to the scores of correct peptide pairs (both peptides identified correctly), partially incorrect peptide pairs (one peptide identified correctly, the other incorrectly), and incorrect peptide pairs (both peptides identified incorrectly). To learn these components, we exploit the score distributions of first- and second-ranked peptide-spectrum matches for each experimental spectrum and subsequently estimate FDR using a novel expectation-maximization algorithm with constraints. We evaluate the method on ten datasets and provide evidence that the proposed DFA is theoretically sound and a viable alternative to TDA owing to its good performance in terms of accuracy, variance of estimation, and run time. https://github.com/shawn-peng/xlms.

Identifiants

pubmed: 38940171
pii: 7700896
doi: 10.1093/bioinformatics/btae233
doi:

Substances chimiques

Peptides 0
Proteins 0

Types de publication

Journal Article

Langues

eng

Sous-ensembles de citation

IM

Pagination

i428-i436

Informations de copyright

© The Author(s) 2024. Published by Oxford University Press.

Auteurs

Yisu Peng (Y)

Khoury College of Computer Sciences, Northeastern University, Boston, MA 02115, United States.

Shantanu Jain (S)

Khoury College of Computer Sciences, Northeastern University, Boston, MA 02115, United States.
The Institute for Experiential AI, Northeastern University, Boston, MA 02115, United States.

Predrag Radivojac (P)

Khoury College of Computer Sciences, Northeastern University, Boston, MA 02115, United States.

Articles similaires

Selecting optimal software code descriptors-The case of Java.

Yegor Bugayenko, Zamira Kholmatova, Artem Kruglov et al.
1.00
Software Algorithms Programming Languages
Databases, Protein Protein Domains Protein Folding Proteins Deep Learning
1.00
Humans Magnetic Resonance Imaging Brain Infant, Newborn Infant, Premature
Humans Algorithms Software Artificial Intelligence Computer Simulation

Classifications MeSH