Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Fast Deisotoping Algorithm and Its Implementation in the MSFragger Search Engine.

ABSTRACT: Deisotoping, or the process of removing peaks in a mass spectrum resulting from the incorporation of naturally occurring heavy isotopes, has long been used to reduce complexity and improve the effectiveness of spectral annotation methods in proteomics. We have previously described MSFragger, an ultrafast search engine for proteomics, that did not utilize deisotoping in processing input spectra. Here, we present a new, high-speed parallelized deisotoping algorithm, based on elements of several existing methods, that we have incorporated into the MSFragger search engine. Applying deisotoping with MSFragger reveals substantial improvements to database search speed and performance, particularly for complex methods like open or nonspecific searches. Finally, we evaluate our deisotoping method on data from several instrument types and vendors, revealing a wide range in performance and offering an updated perspective on deisotoping in the modern proteomics environment.

SUBMITTER: Teo GC

PROVIDER: S-EPMC8864561 | biostudies-literature | 2021 Jan

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Fast Deisotoping Algorithm and Its Implementation in the MSFragger Search Engine.

Teo Guo Ci GC Polasky Daniel A DA Yu Fengchao F Nesvizhskii Alexey I AI

Journal of proteome research 20201217 1

Deisotoping, or the process of removing peaks in a mass spectrum resulting from the incorporation of naturally occurring heavy isotopes, has long been used to reduce complexity and improve the effectiveness of spectral annotation methods in proteomics. We have previously described MSFragger, an ultrafast search engine for proteomics, that did not utilize deisotoping in processing input spectra. Here, we present a new, high-speed parallelized deisotoping algorithm, based on elements of several ex ...[more]

PMID: 33332123

Similar Datasets

A novel algorithm for validating peptide identification from a shotgun proteomics search engine.

Project description:Liquid chromatography coupled with tandem mass spectrometry (LC-MS/MS) has revolutionized the proteomics analysis of complexes, cells, and tissues. In a typical proteomic analysis, the tandem mass spectra from a LC-MS/MS experiment are assigned to a peptide by a search engine that compares the experimental MS/MS peptide data to theoretical peptide sequences in a protein database. The peptide spectra matches are then used to infer a list of identified proteins in the original sample. However, the search engines often fail to distinguish between correct and incorrect peptides assignments. In this study, we designed and implemented a novel algorithm called De-Noise to reduce the number of incorrect peptide matches and maximize the number of correct peptides at a fixed false discovery rate using a minimal number of scoring outputs from the SEQUEST search engine. The novel algorithm uses a three-step process: data cleaning, data refining through a SVM-based decision function, and a final data refining step based on proteolytic peptide patterns. Using proteomics data generated on different types of mass spectrometers, we optimized the De-Noise algorithm on the basis of the resolution and mass accuracy of the mass spectrometer employed in the LC-MS/MS experiment. Our results demonstrate De-Noise improves peptide identification compared to other methods used to process the peptide sequence matches assigned by SEQUEST. Because De-Noise uses a limited number of scoring attributes, it can be easily implemented with other search engines.

| S-EPMC3608465 | biostudies-literature

HortGenome Search Engine, a universal genomic search engine for horticultural crops.

Project description:Horticultural crops comprising fruit, vegetable, ornamental, beverage, medicinal and aromatic plants play essential roles in food security and human health, as well as landscaping. With the advances of sequencing technologies, genomes for hundreds of horticultural crops have been deciphered in recent years, providing a basis for understanding gene functions and regulatory networks and for the improvement of horticultural crops. However, these valuable genomic data are scattered in warehouses with various complex searching and displaying strategies, which increases learning and usage costs and makes comparative and functional genomic analyses across different horticultural crops very challenging. To this end, we have developed a lightweight universal search engine, HortGenome Search Engine (HSE; http://hort.moilab.net), which allows for the querying of genes, functional annotations, protein domains, homologs, and other gene-related functional information of more than 500 horticultural crops. In addition, four commonly used tools, including 'BLAST', 'Batch Query', 'Enrichment analysis', and 'Synteny Viewer' have been developed for efficient mining and analysis of these genomic data.

| S-EPMC11165154 | biostudies-literature

PSimScan: algorithm and utility for fast protein similarity search.

Project description:In the era of metagenomics and diagnostics sequencing, the importance of protein comparison methods of boosted performance cannot be overstated. Here we present PSimScan (Protein Similarity Scanner), a flexible open source protein similarity search tool which provides a significant gain in speed compared to BLASTP at the price of controlled sensitivity loss. The PSimScan algorithm introduces a number of novel performance optimization methods that can be further used by the community to improve the speed and lower hardware requirements of bioinformatics software. The optimization starts at the lookup table construction, then the initial lookup table-based hits are passed through a pipeline of filtering and aggregation routines of increasing computational complexity. The first step in this pipeline is a novel algorithm that builds and selects 'similarity zones' aggregated from neighboring matches on small arrays of adjacent diagonals. PSimScan performs 5 to 100 times faster than the standard NCBI BLASTP, depending on chosen parameters, and runs on commodity hardware. Its sensitivity and selectivity at the slowest settings are comparable to the NCBI BLASTP's and decrease with the increase of speed, yet stay at the levels reasonable for many tasks. PSimScan is most advantageous when used on large collections of query sequences. Comparing the entire proteome of Streptocuccus pneumoniae (2,042 proteins) to the NCBI's non-redundant protein database of 16,971,855 records takes 6.5 hours on a moderately powerful PC, while the same task with the NCBI BLASTP takes over 66 hours. We describe innovations in the PSimScan algorithm in considerable detail to encourage bioinformaticians to improve on the tool and to use the innovations in their own software development.

| S-EPMC3591303 | biostudies-literature

Kmer-SSR: a fast and exhaustive SSR search algorithm.

Project description:MotivationOne of the main challenges with bioinformatics software is that the size and complexity of datasets necessitate trading speed for accuracy, or completeness. To combat this problem of computational complexity, a plethora of heuristic algorithms have arisen that report a 'good enough' solution to biological questions. However, in instances such as Simple Sequence Repeats (SSRs), a 'good enough' solution may not accurately portray results in population genetics, phylogenetics and forensics, which require accurate SSRs to calculate intra- and inter-species interactions.ResultsWe present Kmer-SSR, which finds all SSRs faster than most heuristic SSR identification algorithms in a parallelized, easy-to-use manner. The exhaustive Kmer-SSR option has 100% precision and 100% recall and accurately identifies every SSR of any specified length. To identify more biologically pertinent SSRs, we also developed several filters that allow users to easily view a subset of SSRs based on user input. Kmer-SSR, coupled with the filter options, accurately and intuitively identifies SSRs quickly and in a more user-friendly manner than any other SSR identification algorithm.Availability and implementationThe source code is freely available on GitHub at https://github.com/ridgelab/Kmer-SSR.Contactperry.ridge@byu.edu.

| S-EPMC5860095 | biostudies-literature

Search Engine for Antimicrobial Resistance

Project description:Search Engine for Antimicrobial Resistance: a cloud compatible pipeline and web interface for rapidly detecting antimicrobial resistance genes directly from sequence data

| PRJEB4647 | ENA

Search Engine Gender Bias.

Project description:This article discusses possible search engine page rank biases as a consequence of search engine profile information. After describing search engine biases, their causes, and their ethical implications, we present data about the Google search engine (GSE) and DuckDuckGo (DDG) for which only the first uses profile data for the production of page ranks. We analyze 408 search engine screen prints of 102 volunteers (53 male and 49 female) on queries for job search and political participation. For job searches via GSE, we find a bias toward stereotypically "female" jobs for women but also for men, although the bias is significantly stronger for women. For political participation, the bias of GSE is toward more powerful positions. Contrary to our hypothesis, this bias is even stronger for women than for men. Our analysis of DDG does not give statistically significant page rank differences for male and female users. We, therefore, conclude that GSE's personal profiling is not reinforcing a gender stereotype. Although no gender differences in page ranks was found for DDG, DDG usage in general gave a bias toward "male-dominant" vacancies for both men and women. We, therefore, believe that search engine page ranks are not biased by profile ranking algorithms, but that page rank biases may be caused by many other factors in the search engine's value chain. We propose ten search engine bias factors with virtue ethical implications for further research.

| S-EPMC8187950 | biostudies-literature

MSFragger-DDA+ Enhances Peptide Identification Sensitivity with Full Isolation Window Search.

Project description:Liquid chromatography-mass spectrometry (LC-MS) based proteomics, particularly in the bottom-up approach, relies on the digestion of proteins into peptides for subsequent separation and analysis. The most prevalent method for identifying peptides from data-dependent acquisition (DDA) mass spectrometry data is database search. Traditional tools typically focus on identifying a single peptide per tandem mass spectrum (MS2), often neglecting the frequent occurrence of peptide co-fragmentations leading to chimeric spectra. Here, we introduce MSFragger-DDA+, a novel database search algorithm that enhances peptide identification by detecting co-fragmented peptides with high sensitivity and speed. Utilizing MSFragger's fragment ion indexing algorithm, MSFragger-DDA+ performs a comprehensive search within the full isolation window for each MS2, followed by robust feature detection, filtering, and rescoring procedures to refine search results. Evaluation against established tools across diverse datasets demonstrated that, integrated within the FragPipe computational platform, MSFragger-DDA+ significantly increases identification sensitivity while maintaining stringent false discovery rate (FDR) control. It is also uniquely suited for wide-window acquisition (WWA) data. MSFragger-DDA+ provides an efficient and accurate solution for peptide identification, enhancing the detection of low-abundance co-fragmented peptides. Coupled with the FragPipe platform, MSFragger-DDA+ enables more comprehensive and accurate analysis of proteomics data.

| S-EPMC11507693 | biostudies-literature

Fast Quantitative Analysis of timsTOF PASEF Data with MSFragger and IonQuant.

Project description:Ion mobility brings an additional dimension of separation to LC-MS, improving identification of peptides and proteins in complex mixtures. A recently introduced timsTOF mass spectrometer (Bruker) couples trapped ion mobility separation to TOF mass analysis. With the parallel accumulation serial fragmentation (PASEF) method, the timsTOF platform achieves promising results, yet analysis of the data generated on this platform represents a major bottleneck. Currently, MaxQuant and PEAKS are most used to analyze these data. However, because of the high complexity of timsTOF PASEF data, both require substantial time to perform even standard tryptic searches. Advanced searches (e.g. with many variable modifications, semi- or non-enzymatic searches, or open searches for post-translational modification discovery) are practically impossible. We have extended our fast peptide identification tool MSFragger to support timsTOF PASEF data, and developed a label-free quantification tool, IonQuant, for fast and accurate 4-D feature extraction and quantification. Using a HeLa data set published by Meier et al. (2018), we demonstrate that MSFragger identifies significantly (∼30%) more unique peptides than MaxQuant (1.6.10.43), and performs comparably or better than PEAKS X+ (∼10% more peptides). IonQuant outperforms both in terms of number of quantified proteins while maintaining good quantification precision and accuracy. Runtime tests show that MSFragger and IonQuant can fully process a typical two-hour PASEF run in under 70 min on a typical desktop (6 CPU cores, 32 GB RAM), significantly faster than other tools. Finally, through semi-enzymatic searching, we significantly increase the number of identified peptides. Within these semi-tryptic identifications, we report evidence of gas-phase fragmentation before MS/MS analysis.

| S-EPMC7996969 | biostudies-literature

Fast and comprehensive N- and O-glycoproteomics analysis with MSFragger-Glyco.

Project description:Recent advances in methods for enrichment and mass spectrometric analysis of intact glycopeptides have produced large-scale glycoproteomics datasets, but interpreting these data remains challenging. We present MSFragger-Glyco, a glycoproteomics mode of the MSFragger search engine, for fast and sensitive identification of N- and O-linked glycopeptides and open glycan searches. Reanalysis of recent N-glycoproteomics data resulted in annotation of 80% more glycopeptide spectrum matches (glycoPSMs) than previously reported. In published O-glycoproteomics data, our method more than doubled the number of glycoPSMs annotated when searching the same glycans as the original search, and yielded 4- to 6-fold increases when expanding searches to include additional glycan compositions and other modifications. Expanded searches also revealed many sulfated and complex glycans that remained hidden to the original search. With greatly improved spectral annotation, coupled with the speed of index-based scoring, MSFragger-Glyco makes it possible to comprehensively interrogate glycoproteomics data and illuminate the many roles of glycosylation.

| S-EPMC7606558 | biostudies-literature

GlycoNote search engine

Project description:Mass spectrometry is a central technique in glycomic analysis. However, there is no generic software tool for automated, confident analysis of tandem-mass spectrometry based glycomic data. Here, we propose GlycoNote – a generic and reliable search engine for tandem-mass spectrometry based glycomics. A false discovery rate analysis based on iterative decoy searching was specifically designed for glycomic data analysis. We apply GlycoNote to the analyses of distinct glycomic samples, including human milk oligosaccharides, N/O-glycome from human cell line and polysaccharides from plant. To further demonstrate the general utility of GlycoNote, automated analyses of nonnative glycomes (N-glycome labeled with aniline and permethylated N-glycome) or atypical glycans (O-glycome with N-acetylneuraminic acid / N-glycome from C. elegans) were performed. More importantly, an open-search mode was introduced for the elucidation of component heterogeneity in samples. GlycoNote could be an important tool in the rapidly growing efforts toward comprehensive glycomic analysis.

2019-07-23 | PXD014705 |

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data