PARPST: a PARallel algorithm to find peptide sequence tags

Area of Science:

• Proteomics
• Bioinformatics
• Computational Biology

Background:

• Protein identification is a significant challenge in proteomics.
• Tandem mass spectrometry is a key technology for protein identification.

Purpose of the Study:

• To develop a work-efficient parallel algorithm for the peptide sequence tag problem.
• To improve the speed and accuracy of protein identification using mass spectrometry data.

Main Methods:

• Developed a parallel algorithm for the peptide sequence tag problem.
• Algorithm runs on concurrent-read, exclusive-write PRAM in O(n) time with log n processors.
• Tested on 1507 spectra from the Open Proteomics Database.

Main Results:

• The algorithm efficiently finds all sequence tags above a score threshold or of maximum length.
• Achieved comparable results to existing methods on a large dataset.
• Demonstrated efficiency and effectiveness for peptide sequence tag identification.

Conclusions:

• The algorithm can accelerate database searching for protein identification.
• Facilitates the identification of post-translational modifications by comparing sequence tags with biological databases.