PARPST: a PARallel algorithm to find peptide sequence tags
2008
A New Algorithm for Finding Peptide Sequence Tags
Sample size: 1507
publication
Evidence: moderate
Author Information
Author(s): Sara Brunetti, Elena Lodi, Elisa Mori, Maria Stella
Primary Institution: Università degli studi di Siena
Hypothesis
Can a parallel algorithm improve the efficiency of peptide sequence tag identification?
Conclusion
The proposed algorithm is efficient and effective for identifying peptide sequence tags, achieving comparable results to existing methods.
Supporting Evidence
- The algorithm runs in O(n) time using log n processors.
- Tests on 1507 spectra showed the algorithm is efficient and effective.
- The algorithm can identify post-translational modifications.
Takeaway
This study created a new computer program that helps scientists quickly find pieces of proteins, which is important for understanding how they work.
Methodology
The algorithm runs on a parallel computing model and processes mass spectrometry data to identify peptide sequence tags.
Limitations
The algorithm's performance may vary based on the quality of the input mass spectra.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website