MétaCan
Menu
Back to cohort
Record W4388213288 · doi:10.1101/2023.10.30.564469

Pepid: a Highly Modifiable, Bioinformatics-Oriented Peptide Search Engine

2023· preprint· en· W4388213288 on OpenAlexafffund
Jérémie Zumer, Sébastien Lemieux

Bibliographic record

VenuebioRxiv (Cold Spring Harbor Laboratory) · 2023
Typepreprint
Languageen
FieldChemistry
TopicAdvanced Proteomics Techniques and Applications
Canadian institutionsUniversité de MontréalInstitute for Research in Immunology and Cancer
FundersInstitut de Valorisation des Données
KeywordsIdentification (biology)Computer scienceSoftwareWorkflowProcess (computing)MascotSearch engineDatabase search engineSoftware engineeringData miningInformation retrievalProgramming languageDatabase

Abstract

fetched live from OpenAlex

Abstract Motivation Current peptide search engines are optimized for wet-lab workflows, i.e. they operate in an “end-to-end” manner to achieve good identification results, not to be modified or provide algorithmic insight. This makes developing new software methods to solve problems in peptide identification methods difficult, often requiring a full engine rewrite. Recently, many deep learning methods were proposed as solutions to various parts of the peptide identification task, but virtually none of those methods have been implemented in any actual peptide search process. We believe that the lack of a reliable bioinformatics research platform for peptide identification that enables such integrations is slowing down proteomics research as a whole. Results We present pepid, a bioinformatics research-oriented peptide search engine. Unlike other search engines, pepid is specifically designed with ease of computational research in mind. Our design is highly flexible and allows easy modifications with little required software development expertise, allowing researchers to focus on analysing and improving peptide identification methods.It also takes recent computational trends into account, such as the recent slew of deep learning publications in proteomics, and features a multi-phased batched operations design that is more appropriate than the spectrum batch “end-to-end” designs of existing search engines for those approaches. We show that pepid is competitive with common engines in terms of both identification rates and runtime, forming a minimum required baseline to enable further identification research. Availability and Implementation Pepid is available as open source software under the MIT license at https://github.com/lemieux-lab/pepid . Other data referenced in the text is 3rd party. The selected yeast proteome can be found on SwissProt with accession ID UP000002311 while the human proteome’s accession ID is UP0000005640. The ProteomeTools spectra can be found in the PRIDE archive under accession D PXD004732 and the One Hour Yeast Proteome can be found at the ChorusProject at https://chorusproject.org/anonymous/download/experiment/-8823069691100997209 and https://chorusproject.org/anonymous/download/experiment/449795368199176159 .

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.012
Threshold uncertainty score0.041

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0020.003
Open science0.0030.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0120.008

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.020
GPT teacher head0.250
Teacher spread0.230 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2023
Admission routes2
Has abstractyes

Explore more

Same venuebioRxiv (Cold Spring Harbor Laboratory)Same topicAdvanced Proteomics Techniques and ApplicationsFrench-language works237,207