PARPST: a PARallel algorithm to find peptide sequence tags.
BACKGROUND
Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification problem.


RESULTS
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.


CONCLUSIONS
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.
Brunetti
Sara
S
Dipartimento di Scienze Matematiche e Informatiche, Università degli studi di Siena, Siena I-53100, Italy. sara.brunetti@unisi.it
Lodi
Elena
E
Mori
Elisa
E
Stella
Maria
M
D000465:Algorithms; D000595:Amino Acid Sequence; D013058:Mass Spectrometry / Q000379:methods*; D008969:Molecular Sequence Data; D010449:Peptide Mapping / Q000379:methods*; D010455:Peptides / Q000737:chemistry*; D020539:Sequence Analysis, Protein / Q000379:methods*; D012984:Software
D010455:Peptides