Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Edward L. Huttlin

dblp:44/1591 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-1822-1173ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › protein analysis
protein-protein interaction
0.712023
BioPlexR and BioPlexPy: integrated data products for the analysis of human protein interactions · Bioinform. 2023
Bioinformatics and computational biology › protein analysis › protein-protein interaction
protein-protein interaction network analysis
0.712023
BioPlexR and BioPlexPy: integrated data products for the analysis of human protein interactions · Bioinform. 2023
Bioinformatics and computational biology › proteomics
mass spectrometry quantification
0.112008
Matching isotopic distributions from metabolically labeled samples · ISMB 2008
Bioinformatics and computational biology
proteomics
0.112008
Matching isotopic distributions from metabolically labeled samples · ISMB 2008
Bioinformatics and computational biology
metabolomics
0.012008
Matching isotopic distributions from metabolically labeled samples · ISMB 2008

Methods — techniques the papers use, named apart from their topics

maximum scoring sub-network analysis · 0.7domain-domain association analysis · 0.7probabilistic classifier · 0.1dynamic programming · 0.1
YearPublicationVenuePosition
2023 BioPlexR and BioPlexPy: integrated data products for the analysis of human protein interactions
abstract
SUMMARY: The BioPlex project has created two proteome scale, cell-line-specific protein-protein interaction (PPI) networks: the first in 293T cells, including 120k interactions among 15k proteins; and the second in HCT116 cells, including 70k interactions between 10k proteins. Here, we describe programmatic access to the BioPlex PPI networks and integration with related resources from within R and Python. Besides PPI networks for 293T and HCT116 cells, this includes access to CORUM protein complex data, PFAM protein domain data, PDB protein structures, and transcriptome and proteome data for the two cell lines. The implemented functionality serves as a basis for integrative downstream analysis of BioPlex PPI data with domain-specific R and Python packages, including efficient execution of maximum scoring sub-network analysis, protein domain-domain association analysis, mapping of PPIs onto 3D protein structures and analysis of BioPlex PPIs at the interface of transcriptomic and proteomic data. AVAILABILITY AND IMPLEMENTATION: The BioPlex R package is available from Bioconductor (bioconductor.org/packages/BioPlex), and the BioPlex Python package is available from PyPI (pypi.org/project/bioplexpy). Applications and downstream analyses are available from GitHub (github.com/ccb-hms/BioPlexAnalysis).
Ludwig Geistlinger, Roger Vargas, Tyrone Lee, Joshua Pan, Edward L. Huttlin, Robert Gentleman
Bioinform.5
2008 Matching isotopic distributions from metabolically labeled samples
abstract
MOTIVATION: In recent years stable isotopic labeling has become a standard approach for quantitative proteomic analyses. Among the many available isotopic labeling strategies, metabolic labeling is attractive for the excellent internal control it provides. However, analysis of data from metabolic labeling experiments can be complicated because the spacing between labeled and unlabeled forms of each peptide depends on its sequence, and is thus variable from analyte to analyte. As a result, one generally needs to know the sequence of a peptide to identify its matching isotopic distributions in an automated fashion. In some experimental situations it would be necessary or desirable to match pairs of labeled and unlabeled peaks from peptides of unknown sequence. This article addresses this largely overlooked problem in the analysis of quantitative mass spectrometry data by presenting an algorithm that not only identifies isotopic distributions within a mass spectrum, but also annotates matches between natural abundance light isotopic distributions and their metabolically labeled counterparts. This algorithm is designed in two stages: first we annotate the isotopic peaks using a modified version of the IDM algorithm described last year; then we use a probabilistic classifier that is supplemented by dynamic programming to find the metabolically labeled matched isotopic pairs. Such a method is needed for high-throughput quantitative proteomic metabolomic experiments measured via mass spectrometry. RESULTS: The primary result of this article is that the dynamic programming approach performs well given perfect isotopic distribution annotations. Our algorithm achieves a true positive rate of 99% and a false positive rate of 1% using perfect isotopic distribution annotations. When the isotopic distributions are annotated given 'expert' selected peaks, the same algorithm gets a true positive rate of 77% and a false positive rate of 1%. Finally, when annotating using machine selected peaks, which may contain noise, the dynamic programming algorithm gives a true positive rate of 36% and a false positive rate of 1%. It is important to mention that these rates arise from the requirement of exact annotations of both the light and heavy isotopic distributions. In our evaluations, a match is considered 'entirely incorrect' if it is missing even one peak or containing an extraneous peak. If we only require that the 'monoisotopic' peaks exist within the two matched distributions, our algorithm obtains a positive rate of 45% and a false positive rate of 1% on the 'machine' selected data. Changes to the algorithm's scoring function and training example generation improves our 'monoisotopic' peak score true positive rate to 65% while obtaining a false positive rate of 2%. All results were obtained within 10-fold cross-validation of 41 mass spectra with a mass-to-charge range of 800-4000 m/z. There are a total of 713 isotopic distributions and 255 matched isotopic pairs that are hand-annotated for this study. AVAILABILITY: Programs are available via http://www.cs.wisc.edu/~mcilwain/IDM/.
Sean McIlwain, David Page, Edward L. Huttlin, Michael R. Sussman
ISMB3