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

Arthur R. Salomon

dblp:13/7068 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2010
0000-0002-7223-8996ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1

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%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
proteomics
0.222010
Visual Integration of Quantitative Proteomic Data, Pathways, and Protein Interactions · IEEE Trans. Vis. Comput. Graph. 2010
Discovery of phosphorylation motif mixtures in phosphoproteomics data · Bioinform. 2009
Bioinformatics and computational biology › protein analysis › protein-protein interaction
protein-protein interaction analysis
0.112010
Visual Integration of Quantitative Proteomic Data, Pathways, and Protein Interactions · IEEE Trans. Vis. Comput. Graph. 2010
Visualization and visual analytics
biomedical visualization
0.112010
Visual Integration of Quantitative Proteomic Data, Pathways, and Protein Interactions · IEEE Trans. Vis. Comput. Graph. 2010
Bioinformatics and computational biology › systems bioinformatics
pathway analysis
0.012010
Visual Integration of Quantitative Proteomic Data, Pathways, and Protein Interactions · IEEE Trans. Vis. Comput. Graph. 2010

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

pathway integration · 0.2network visualization · 0.2mixture model · 0.1minimum description length · 0.1
YearPublicationVenuePosition
2010 Visual Integration of Quantitative Proteomic Data, Pathways, and Protein Interactions
abstract
We introduce several novel visualization and interaction paradigms for visual analysis of published protein-protein interaction networks, canonical signaling pathway models, and quantitative proteomic data. We evaluate them anecdotally with domain scientists to demonstrate their ability to accelerate the proteomic analysis process. Our results suggest that structuring protein interaction networks around canonical signaling pathway models, exploring pathways globally and locally at the same time, and driving the analysis primarily by the experimental data, all accelerate the understanding of protein pathways. Concrete proteomic discoveries within T-cells, mast cells, and the insulin signaling pathway validate the findings. The aim of the paper is to introduce novel protein network visualization paradigms and anecdotally assess the opportunity of incorporating them into established proteomic applications. We also make available a prototype implementation of our methods, to be used and evaluated by the proteomic community.
Radu Jianu, Kebing Yu, Lulu Cao, Arthur R. Salomon, David H. Laidlaw
IEEE Trans. Vis. Comput. Graph.5
2009 Discovery of phosphorylation motif mixtures in phosphoproteomics data
abstract
MOTIVATION: Modification of proteins via phosphorylation is a primary mechanism for signal transduction in cells. Phosphorylation sites on proteins are determined in part through particular patterns, or motifs, present in the amino acid sequence. RESULTS: We describe an algorithm that simultaneously discovers multiple motifs in a set of peptides that were phosphorylated by several different kinases. Such sets of peptides are routinely produced in proteomics experiments.Our motif-finding algorithm uses the principle of minimum description length to determine a mixture of sequence motifs that distinguish a foreground set of phosphopeptides from a background set of unphosphorylated peptides. We show that our algorithm outperforms existing motif-finding algorithms on synthetic datasets consisting of mixtures of known phosphorylation sites. We also derive a motif specificity score that quantifies whether or not the phosphoproteins containing an instance of a motif have a significant number of known interactions. Application of our motif-finding algorithm to recently published human and mouse proteomic studies recovers several known phosphorylation motifs and reveals a number of novel motifs that are enriched for interactions with a particular kinase or phosphatase. Our tools provide a new approach for uncovering the sequence specificities of uncharacterized kinases or phosphatases.
Anna M. Ritz, Gregory Shakhnarovich, Arthur R. Salomon, Benjamin J. Raphael
Bioinform.3