Repository logo
 

PARALLEL COMPUTING ALGORITHMS FOR TANDEM

dc.contributor.advisorWu, Fangxiangen_US
dc.contributor.committeeMemberZhang, Chrisen_US
dc.contributor.committeeMemberKusalik, Tonyen_US
dc.contributor.committeeMemberTeng, Danielen_US
dc.creatorSun, Jianen_US
dc.date.accessioned2013-07-31T12:00:11Z
dc.date.available2013-07-31T12:00:11Z
dc.date.created2013-04en_US
dc.date.issued2013-07-30en_US
dc.date.submittedApril 2013en_US
dc.description.abstractTandem mass spectrometry, also known as MS/MS, is an analytical technique to measure the mass-to-charge ratio of charged ions and widely used in genomics, proteomics and metabolomics areas. There are two types of automatic ways to interpret tandem mass spectra: de novo methods and database searching methods. Both of them need to use massive computational resources and complicated comparison algorithms. The real-time peptide-spectrum matching (RT-PSM) algorithm is a database searching method to interpret tandem mass spectra with strict time constraints. Restricted by the hardware and architecture of an individual workstation the RT-PSM algorithm has to sacrifice the level of accuracy in order to provide prerequisite processing speed. The peptide-spectrum similarity scoring module is the most time-consuming part out of four modules in the RT-PSM algorithm, which is also the core of the algorithm. In this study, a multi-core computing algorithm is developed for individual workstations. Moreover, a distributed computing algorithm is designed for a cluster. The improved algorithms can achieve the speed requirement of RT-PSM without sacrificing the accuracy. With some expansion, this distributed computing algorithm can also support different PSM algorithms. Simulation results show that compared with the original RT-PSM, the parallelization version achieves 25 to 34 times speed-up based on different individual workstations. A cluster with 240 CPU cores could accelerate the similarity score module 210 times compare with the single-thread similarity score module and the whole peptide identification process 85 times compare with the single-thread peptide identification process.en_US
dc.identifier.urihttp://hdl.handle.net/10388/ETD-2013-04-1115en_US
dc.language.isoengen_US
dc.subjectreal-time peptide-spectrum matching (RT-PSM) algorithmen_US
dc.subjecttandem mass spectrumen_US
dc.subjectparallel computing algorithmen_US
dc.subjectmulti-core computing algorithmen_US
dc.subjectdistributed computing algorithmen_US
dc.subjectpeptide identificationen_US
dc.titlePARALLEL COMPUTING ALGORITHMS FOR TANDEMen_US
dc.type.genreThesisen_US
dc.type.materialtexten_US
thesis.degree.departmentBiomedical Engineeringen_US
thesis.degree.disciplineBiomedical Engineeringen_US
thesis.degree.grantorUniversity of Saskatchewanen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Science (M.Sc.)en_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
SUN-THESIS.pdf
Size:
1.1 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1001 B
Format:
Plain Text
Description: