{"id":{"repo_id":"etsu","oai_identifier":"oai:dc.etsu.edu:etd-4631"},"canonical_url":"https://search.ndltd.org/etd/etsu/oai:dc.etsu.edu:etd-4631","repository":{"repo_id":"etsu","name":"East Tennessee State University","base_url":"https://dc.etsu.edu/do/oai/"},"display":{"title":"Peptide Identification: Refining a Bayesian Stochastic Model","abstract":"Notwithstanding the challenges associated with different methods of peptide identification, other methods have been explored over the years. The complexity, size and computational challenges of peptide-based data sets calls for more intrusion into this sphere. By relying on the prior information about the average relative abundances of bond cleavages and the prior probability of any specific amino acid sequence, we refine an already developed Bayesian approach in identifying peptides. The likelihood function is improved by adding additional ions to the model and its size is driven by two overall goodness of fit measures. In the face of the complexities associated with our posterior density, a Markov chain Monte Carlo algorithm coupled with simulated annealing is used to simulate candidate choices from the posterior distribution of the peptide sequence, where the peptide with the largest posterior density is estimated as the true peptide.","abstract_html":"Notwithstanding the challenges associated with different methods of peptide identification, other methods have been explored over the years. The complexity, size and computational challenges of peptide-based data sets calls for more intrusion into this sphere. By relying on the prior information about the average relative abundances of bond cleavages and the prior probability of any specific amino acid sequence, we refine an already developed Bayesian approach in identifying peptides. The likelihood function is improved by adding additional ions to the model and its size is driven by two overall goodness of fit measures. In the face of the complexities associated with our posterior density, a Markov chain Monte Carlo algorithm coupled with simulated annealing is used to simulate candidate choices from the posterior distribution of the peptide sequence, where the peptide with the largest posterior density is estimated as the true peptide.","abstract_has_math":false,"creators":["Acquah, Theophilus Barnabas Kobina"],"institution":"East Tennessee State University","degree_name":"MS (Master of Science)","degree_level":"Thesis - unrestricted","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017-05-01T07:00:00Z","date_published":"2017-05-01T07:00:00Z","updated_at":"2026-11-19T07:55:17Z","subjects":["Bayesian","Protein Identification","MCMC","Peptides","Ions","Mathematics","Statistics and Probability"],"languages":["eng"],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/3211","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dc.etsu.edu/etd/3211","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":"https://dc.etsu.edu/context/etd/article/4631/viewcontent/AcquahT042417f.pdf","download_label":"Download PDF","download_source":"dc:identifier","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://dc.etsu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adc.etsu.edu%3Aetd-4631","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Acquah, Theophilus Barnabas Kobina"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2017-03-30T07:00:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2017-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["East Tennessee State University"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - unrestricted"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS (Master of Science)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["East Tennessee State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Bayesian","Protein Identification","MCMC","Peptides","Ions","Mathematics","Statistics and Probability"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright by the authors."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.etsu.edu/context/etd/article/4631/viewcontent/AcquahT042417f.pdf","https://dc.etsu.edu/etd/3211"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Notwithstanding the challenges associated with different methods of peptide identification, other methods have been explored over the years. The complexity, size and computational challenges of peptide-based data sets calls for more intrusion into this sphere. By relying on the prior information about the average relative abundances of bond cleavages and the prior probability of any specific amino acid sequence, we refine an already developed Bayesian approach in identifying peptides. The likelihood function is improved by adding additional ions to the model and its size is driven by two overall goodness of fit measures. In the face of the complexities associated with our posterior density, a Markov chain Monte Carlo algorithm coupled with simulated annealing is used to simulate candidate choices from the posterior distribution of the peptide sequence, where the peptide with the largest posterior density is estimated as the true peptide."]},{"key":"dc:title","label":"Title","values":["Peptide Identification: Refining a Bayesian Stochastic Model"]}]}],"canonical_facts":{"dc:creator":["Acquah, Theophilus Barnabas Kobina"],"dc:date.available":["2017-03-30T07:00:00Z"],"dc:date.issued":["2017-05-01T07:00:00Z"],"dc:description.abstract":["Notwithstanding the challenges associated with different methods of peptide identification, other methods have been explored over the years. The complexity, size and computational challenges of peptide-based data sets calls for more intrusion into this sphere. By relying on the prior information about the average relative abundances of bond cleavages and the prior probability of any specific amino acid sequence, we refine an already developed Bayesian approach in identifying peptides. The likelihood function is improved by adding additional ions to the model and its size is driven by two overall goodness of fit measures. In the face of the complexities associated with our posterior density, a Markov chain Monte Carlo algorithm coupled with simulated annealing is used to simulate candidate choices from the posterior distribution of the peptide sequence, where the peptide with the largest posterior density is estimated as the true peptide."],"dc:identifier":["https://dc.etsu.edu/context/etd/article/4631/viewcontent/AcquahT042417f.pdf","https://dc.etsu.edu/etd/3211"],"dc:language":["eng"],"dc:publisher":["East Tennessee State University"],"dc:rights":["Copyright by the authors."],"dc:subject":["Bayesian","Protein Identification","MCMC","Peptides","Ions","Mathematics","Statistics and Probability"],"dc:title":["Peptide Identification: Refining a Bayesian Stochastic Model"],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis - unrestricted"],"thesis:degree_name":["MS (Master of Science)"],"thesis:institution_name":["East Tennessee State University"]},"updated_at":"2026-11-19T07:55:17Z"}