This article is part of the supplement: A Semantic Web for Bioinformatics: Goals, Tools, Systems, Applications
PARPST: a PARallel algorithm to find peptide sequence tags
1 Dipartimento di Scienze Matematiche e Informatiche, Università degli studi di Siena, Siena I-53100, Italy
2 Novartis Vaccines & Diagnostics, Siena I-53100, Italy
BMC Bioinformatics 2008, 9(Suppl 4):S11 doi:10.1186/1471-2105-9-S4-S11Published: 25 April 2008
Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification problem.
We developed a work-efficient parallel algorithm for the peptide sequence tag problem. The algorithm runs on the concurrent-read, exclusive-write PRAM in O(n) time using log n processors, where n is the number of mass peaks in the spectrum. The algorithm is able to find all the sequence tags having score greater than a parameter or all the sequence tags of maximum length. Our tests on 1507 spectra in the Open Proteomics Database shown that our algorithm is efficient and effective since achieves comparable results to other methods.
The proposed algorithm can be used to speed up the database searching or to identify post-translational modifications, comparing the homology of the sequence tags found with the sequences in the biological database.