A Compressed Sequence Tag Index for Fast Peptide Retrieval and Efficient Storage in Protein Identification Search Engines
Open Access
- 9 June 2025
- journal article
- research article
- Published by MDPI AG in Applied Sciences
- Vol. 15 (12) , 6482
Abstract
Proteins regulate various cellular processes and are of great biological interest. The protein search engine is a crucial tool in proteomics research, used to analyze high-throughput tandem mass spectrometry data and to identify protein sequence information. A core step in protein search engines is constructing sequence tag indexes and performing the rapid retrieval of protein databases. However, as the scale of protein sequence data continues to grow, traditional protein search engines face the dual challenges of the high storage cost of sequence tag indexes and low retrieval efficiency. To address these issues, we propose a sequence tag index scheme named STIP, which is based on an inverted index and compression techniques. Based on STIP, we design a peptide retrieval algorithm named STIP-Search. This algorithm utilizes the sequence tag index constructed by STIP for peptide sequence retrieval. STIP uses the greedy algorithm to partition the tag index into blocks; in this way, STIP can generate tag indexes for very large protein databases, such as NCBI-nr. Compared to the current four mainstream tag index generation algorithms used in Open-pFind, MODplus, TIIP and PIPI2, STIP has the lowest storage and time consumption. It utilizes delta encoding, index reduction, and dynamic bit width encoding to compress the tag index, reducing the storage cost by 76.2%. Compared to TIIP, which is currently the algorithm with the lowest time complexity, the time cost of the peptide sequence retrieval of STIP-Search is reduced by 8.94% to 23.31%.Keywords
Funding Information
- Outstanding Youth Innovation Teams in Higher Educational Institutions of Shandong Province (2019KJN048)
This publication has 30 references indexed in Scilit:
- Accelerating spliced alignment of long RNA sequencing reads using parallel maximal exact match retrievalComputers in Biology and Medicine, 2024
- Efficient Indexing of Peptides for Database Search Using TideJournal of Proteome Research, 2023
- Enabling fast and energy-efficient FM-index exact matching using processing-near-memoryThe Journal of Supercomputing, 2021
- MODplus: Robust and Unrestrictive Identification of Post-Translational Modifications Using Mass SpectrometryAnalytical Chemistry, 2019
- pFind–Alioth: A novel unrestricted database search algorithm to improve the interpretation of high-resolution MS/MS dataJournal of Proteomics, 2015
- A Deeper Look into Comet—Implementation and FeaturesJournal of the American Society for Mass Spectrometry, 2015
- Lightweight algorithms for constructing and inverting the BWT of string collectionsTheoretical Computer Science, 2013
- Speeding up tandem mass spectrometry based database searching by peptide and spectrum indexingRapid Communications in Mass Spectrometry, 2010
- PEAKS: powerful software for peptide de novo sequencing by tandem mass spectrometryRapid Communications in Mass Spectrometry, 2003
- Error-Tolerant Identification of Peptides in Sequence Databases by Peptide Sequence TagsAnalytical Chemistry, 1994