S. Dawson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
S. Dawson has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Joao A. Paulo
Department of Cell Biology, Harvard Medical School, Boston, MA, USA
2 shared publications - Nathan R. Zuniga
Department of Cell Biology, Harvard Medical School, Boston, MA, USA
2 shared publications - Steven P. Gygi
Department of Cell Biology, Harvard Medical School, Boston, MA, USA
2 shared publications - Brandon M. Gassaway
Department of Cell Biology, Harvard Medical School, Boston, USA
1 shared publication C. R. Ramakrishnan
Dept. of Computer Science, SUNY at Stony Brook, Stony Brook, NY
1 shared publicationCharlotte R. Beard
Mental Illness Research Education and Clinical Center (MIRECC), Veterans Affairs Palo Alto Health Care System, Palo Alto, CA, USA
1 shared publication
Latest Publications
- Open Access
Next-Generation Multiplexed Targeted Proteomics Quantifies Post-Translational Modifications, Compound-Protein Interactions, and Disease Biomarkers with High Throughput
The GoDig platform enables sensitive, multiplexed targeted pathway proteomics without manual scheduling or synthetic standards. Here we present GoDig 2.0, which increases sample multiplexing to 35-fold, improves time efficiency and reduces scan delays for higher success rates, and allows flexible spectral and elution library generation from different mass spectrometry data types. GoDig 2.0 measures 2.4× more targets than GoDig 1.0, quantifying >99% of 800 peptides in a single run. We compiled a library of 23,989 human phosphorylation sites from a phosphoproteomic dataset and used it to profile kinase signaling differences across cell lines. In human brain tissue, we established a hyperphosphorylated tau assay including pTau127, revealing potential biomarkers for Alzheimer’s disease. We also quantified diglycyl-lysine peptides to assess polyubiquitin branching. Finally, we built a library of 20,946 reactive cysteines and profiled covalent compound-protein interactions spanning diverse pathways. GoDig 2.0 enables high-throughput analyses of site-specific protein modifications across many biological contexts.
Open AccessNext-Generation Multiplexed Targeted Proteomics Quantifies Post-Translational Modifications, Compound-Protein Interactions, and Disease Biomarkers with High Throughput
The GoDig platform enables sensitive, multiplexed targeted pathway proteomics without manual scheduling or synthetic standards. Here we present GoDig 2.0, which increases sample multiplexing to 35-fold, improves time efficiency and reduces scan delays for higher success rates, and allows flexible spectral and elution library generation from different mass spectrometry data types. GoDig 2.0 measures 2.4× more targets than GoDig 1.0, quantifying >99% of 800 peptides in a single run. We compiled a library of 23,989 human phosphorylation sites from a phosphoproteomic dataset and used it to profile kinase signaling differences across cell lines. In human brain tissue, we established a hyperphosphorylated tau assay including pTau127, revealing potential biomarkers for Alzheimer’s disease. We also quantified diglycyl-lysine peptides to assess polyubiquitin branching. Finally, we built a library of 20,946 reactive cysteines and profiled covalent compound-protein interactions spanning diverse pathways. GoDig 2.0 enables high-throughput analyses of site-specific protein modifications across many biological contexts.
- 9 October 2024
- Published by American Chemical Society (ACS) in Journal of Proteome Research
- Vol. 23 (11) , 5153-5165
Achieving a 35-Plex Tandem Mass Tag Reagent Set through Deuterium Incorporation
Mass spectrometry-based sample multiplexing with isobaric tags permits the development of high-throughput and precise quantitative biological assays with proteome-wide coverage and minimal missing values. Here, we nearly doubled the multiplexing capability of the TMTpro reagent set to a 35-plex through the incorporation of one deuterium isotope into the reporter group. Substituting deuterium frequently results in suboptimal peak coelution, which can compromise the accuracy of reporter ion-based quantification. To counteract the deuterium effect on quantitation, we implemented a strategy that necessitated the segregation of nondeuterium and deuterium-containing channels into distinct subplexes during normalization procedures, with reassembly through a common bridge channel. This multiplexing strategy of "design independent sub-plexes but acquire together" (DISAT) was used to compare protein expression differences between human cell lines and in a cysteine-profiling (i.e., chemoproteomics) experiment to identify compounds binding to cysteine-113 of Pin1.
- 9 October 2024
- Published by American Chemical Society (ACS) in Journal of Proteome Research
- Vol. 23 (11) , 5153-5165
Achieving a 35-Plex Tandem Mass Tag Reagent Set through Deuterium Incorporation
Mass spectrometry-based sample multiplexing with isobaric tags permits the development of high-throughput and precise quantitative biological assays with proteome-wide coverage and minimal missing values. Here, we nearly doubled the multiplexing capability of the TMTpro reagent set to a 35-plex through the incorporation of one deuterium isotope into the reporter group. Substituting deuterium frequently results in suboptimal peak coelution, which can compromise the accuracy of reporter ion-based quantification. To counteract the deuterium effect on quantitation, we implemented a strategy that necessitated the segregation of nondeuterium and deuterium-containing channels into distinct subplexes during normalization procedures, with reassembly through a common bridge channel. This multiplexing strategy of "design independent sub-plexes but acquire together" (DISAT) was used to compare protein expression differences between human cell lines and in a cysteine-profiling (i.e., chemoproteomics) experiment to identify compounds binding to cysteine-113 of Pin1.
- 22 August 2014
- Published by Springer Nature in Osteoporosis International
- Vol. 26 (1) , 407-410
Rapid access imaging for occult fractured neck of femur
We completed a full audit cycle to assess waiting times for inpatients with suspected occult femoral neck fracture to get MRI scan, identify the causes of delay and implement the changes to reduce the waiting times. We have proved that inpatient MRI waiting times can significantly be reduced by a targeted approach.
- 22 August 2014
- Published by Springer Nature in Osteoporosis International
- Vol. 26 (1) , 407-410
Rapid access imaging for occult fractured neck of femur
We completed a full audit cycle to assess waiting times for inpatients with suspected occult femoral neck fracture to get MRI scan, identify the causes of delay and implement the changes to reduce the waiting times. We have proved that inpatient MRI waiting times can significantly be reduced by a targeted approach.
- 7 November 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 308-322
Secure access wrapper: mediating security between heterogeneous databases
Organizations today are faced with an ever-increasing need to become more efficient in their methods for exchange of information with consumers, collaborators, and partners. Unfortunately existing mechanisms for such information exchange provide nowhere near the levels of both security and automation required to satisfy this need. Effective information sharing and dissemination can take place only if the data holders have assurance that access constraints on the information they own or manage will be respected and that, while releasing information, disclosure of sensitive information is not a risk. The Secure Access Wrapper (SAW) project is a collaborative effort between SRI International and Stanford University to develop techniques that provide substantially more automation and assurance than has previously been available for secure, selective information sharing. The SAW project is sponsored by DARPA ITO under the Wrappers and Composition focus area of the Information Survivability program.
- 7 November 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 308-322
Secure access wrapper: mediating security between heterogeneous databases
Organizations today are faced with an ever-increasing need to become more efficient in their methods for exchange of information with consumers, collaborators, and partners. Unfortunately existing mechanisms for such information exchange provide nowhere near the levels of both security and automation required to satisfy this need. Effective information sharing and dissemination can take place only if the data holders have assurance that access constraints on the information they own or manage will be respected and that, while releasing information, disclosure of sensitive information is not a risk. The Secure Access Wrapper (SAW) project is a collaborative effort between SRI International and Stanford University to develop techniques that provide substantially more automation and assurance than has previously been available for secure, selective information sharing. The SAW project is sponsored by DARPA ITO under the Wrappers and Composition focus area of the Information Survivability program.
- Open Access
- 1 January 1995
- Published by Association for Computing Machinery (ACM)
- p. 247-258
Unification factoring for efficient execution of logic programs
The efficiency of resolution-based logic programming languages, such as Prolog, depends critically on selecting and executing sets of applicable clause heads to resolve against subgoals. Traditional approaches to this problem have focused on using indexing to determine the smallest possible applicable set. Despite their usefulness, these approaches ignore the non-determinism inherent in many programming languages to the extent that the
- 1 January 1995
- Published by Association for Computing Machinery (ACM)
- p. 247-258
Open AccessUnification factoring for efficient execution of logic programs
The efficiency of resolution-based logic programming languages, such as Prolog, depends critically on selecting and executing sets of applicable clause heads to resolve against subgoals. Traditional approaches to this problem have focused on using indexing to determine the smallest possible applicable set. Despite their usefulness, these approaches ignore the non-determinism inherent in many programming languages to the extent that the