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

Carlos J. Camacho

dblp:63/3304 · DBLP profile ↗
← Back
10ranked-venue papers
2as first author
0since 2021 · last 2018
0000-0003-1741-8529ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 9 · 2 first-authorDatabases, data management, data science and information retrieval · 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
6 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › protein analysis
protein-protein interaction
0.222012
Small-molecule inhibitor starting points learned from protein-protein interaction inhibitor structure · Bioinform. 2012
FastContact: rapid estimate of contact and binding free energies · Bioinform. 2005
Bioinformatics and computational biology › gene regulation
binding site prediction
0.112012
Small-molecule inhibitor starting points learned from protein-protein interaction inhibitor structure · Bioinform. 2012
Bioinformatics and computational biology
drug discovery
0.112012
Small-molecule inhibitor starting points learned from protein-protein interaction inhibitor structure · Bioinform. 2012
Bioinformatics and computational biology › structural bioinformatics
protein structure
0.112012
Small-molecule inhibitor starting points learned from protein-protein interaction inhibitor structure · Bioinform. 2012
Bioinformatics and computational biology › gene regulation
protein-DNA interaction modeling
0.112010
Optimization of minimum set of protein-DNA interactions: a quasi exact solution with minimum over-fitting · Bioinform. 2010
Bioinformatics and computational biology › computational structural biology
binding free energy prediction
0.112005
FastContact: rapid estimate of contact and binding free energies · Bioinform. 2005
Bioinformatics and computational biology
protein structure analysis
0.112005
FastContact: rapid estimate of contact and binding free energies · Bioinform. 2005
Bioinformatics and computational biology › protein analysis
protein complex prediction
0.012004
ClusPro: an automated docking and discrimination method for the prediction of protein complexes · Bioinform. 2004
Bioinformatics and computational biology › protein structure prediction
protein-protein docking
0.012004
ClusPro: an automated docking and discrimination method for the prediction of protein complexes · Bioinform. 2004
Bioinformatics and computational biology
structural bioinformatics
0.012004
ClusPro: an automated docking and discrimination method for the prediction of protein complexes · Bioinform. 2004
Bioinformatics and computational biology › protein structure prediction › template-based modeling
homology modeling
0.012003
Consensus alignment for reliable framework prediction in homology modeling · Bioinform. 2003
Bioinformatics and computational biology
protein structure prediction
0.012003
Consensus alignment for reliable framework prediction in homology modeling · Bioinform. 2003

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

support vector machine · 0.1rule-based classifier · 0.1machine learning · 0.1structural modeling · 0.1mixed-integer programming · 0.1desolvation contact potential · 0.1coulomb electrostatics · 0.1free energy scoring · 0.0clustering · 0.0consensus alignment · 0.0
YearPublicationVenuePosition
2018 Predicting protein targets for drug-like compounds using transcriptomics
abstract
An expanded chemical space is essential for improved identification of small molecules for emerging therapeutic targets. However, the identification of targets for novel compounds is biased towards the synthesis of known scaffolds that bind familiar protein families, limiting the exploration of chemical space. To change this paradigm, we validated a new pipeline that identifies small molecule-protein interactions and works even for compounds lacking similarity to known drugs. Based on differential mRNA profiles in multiple cell types exposed to drugs and in which gene knockdowns (KD) were conducted, we showed that drugs induce gene regulatory networks that correlate with those produced after silencing protein-coding genes. Next, we applied supervised machine learning to exploit drug-KD signature correlations and enriched our predictions using an orthogonal structure-based screen. As a proof-of-principle for this regimen, top-10/top-100 target prediction accuracies of 26% and 41%, respectively, were achieved on a validation of set 152 FDA-approved drugs and 3104 potential targets. We then predicted targets for 1680 compounds and validated chemical interactors with four targets that have proven difficult to chemically modulate, including non-covalent inhibitors of HRAS and KRAS. Importantly, drug-target interactions manifest as gene expression correlations between drug treatment and both target gene KD and KD of genes that act up- or down-stream of the target, even for relatively weak binders. These correlations provide new insights on the cellular response of disrupting protein interactions and highlight the complex genetic phenotypes of drug treatment. With further refinement, our pipeline may accelerate the identification and development of novel chemical classes by screening compound-target interactions.
Nicolas A. Pabon, Samuel K. Estabrooks, Zhaofeng Ye, Amanda K. Herbrand, Evelyn Süß, Ricardo M. Biondi, Victoria A. Assimon, Jason E. Gestwicki, Jeffrey L. Brodsky, Carlos J. Camacho, Ziv Bar-Joseph
PLoS Comput. Biol.11
2015 Indexing volumetric shapes with matching and packing
David Ryan Koes, Carlos J. Camacho
Knowl. Inf. Syst.2
2012 Small-molecule inhibitor starting points learned from protein-protein interaction inhibitor structure
abstract
MOTIVATION: Protein-protein interactions (PPIs) are a promising, but challenging target for pharmaceutical intervention. One approach for addressing these difficult targets is the rational design of small-molecule inhibitors that mimic the chemical and physical properties of small clusters of key residues at the protein-protein interface. The identification of appropriate clusters of interface residues provides starting points for inhibitor design and supports an overall assessment of the susceptibility of PPIs to small-molecule inhibition. RESULTS: We extract Small-Molecule Inhibitor Starting Points (SMISPs) from protein-ligand and protein-protein complexes in the Protein Data Bank (PDB). These SMISPs are used to train two distinct classifiers, a support vector machine and an easy to interpret exhaustive rule classifier. Both classifiers achieve better than 70% leave-one-complex-out cross-validation accuracy and correctly predict SMISPs of known PPI inhibitors not in the training set. A PDB-wide analysis suggests that nearly half of all PPIs may be susceptible to small-molecule inhibition.
David Ryan Koes, Carlos J. Camacho
Bioinform.2
2012 Small-molecule inhibitor starting points learned from protein-protein interaction inhibitor structure
abstract
Bioinformatics (2011) 28(6), 784–791
David Ryan Koes, Carlos J. Camacho
Bioinform.2
2010 Optimization of minimum set of protein-DNA interactions: a quasi exact solution with minimum over-fitting
abstract
MOTIVATION: A major limitation in modeling protein interactions is the difficulty of assessing the over-fitting of the training set. Recently, an experimentally based approach that integrates crystallographic information of C2H2 zinc finger-DNA complexes with binding data from 11 mutants, 7 from EGR finger I, was used to define an improved interaction code (no optimization). Here, we present a novel mixed integer programming (MIP)-based method that transforms this type of data into an optimized code, demonstrating both the advantages of the mathematical formulation to minimize over- and under-fitting and the robustness of the underlying physical parameters mapped by the code. RESULTS: Based on the structural models of feasible interaction networks for 35 mutants of EGR-DNA complexes, the MIP method minimizes the cumulative binding energy over all complexes for a general set of fundamental protein-DNA interactions. To guard against over-fitting, we use the scalability of the method to probe against the elimination of related interactions. From an initial set of 12 parameters (six hydrogen bonds, five desolvation penalties and a water factor), we proceed to eliminate five of them with only a marginal reduction of the correlation coefficient to 0.9983. Further reduction of parameters negatively impacts the performance of the code (under-fitting). Besides accurately predicting the change in binding affinity of validation sets, the code identifies possible context-dependent effects in the definition of the interaction networks. Yet, the approach of constraining predictions to within a pre-selected set of interactions limits the impact of these potential errors to related low-affinity complexes. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
N. A. Temiz, Andrew C. Trapp, Oleg A. Prokopyev, Carlos J. Camacho
Bioinform.4
2008 Structural and Thermodynamic Approach to Peptide Immunogenicity
abstract
In the conventional paradigm of humoral immunity, B cells recognize their cognate antigen target in its native form. However, it is well known that relatively unstable peptides bearing only partial structural resemblance to the native protein can trigger antibodies recognizing higher-order structures found in the native protein. On the basis of sound thermodynamic principles, this work reveals that stability of immunogenic proteinlike motifs is a critical parameter rationalizing the diverse humoral immune responses induced by different linear peptide epitopes. In this paradigm, peptides with a minimal amount of stability (DeltaG(x)<0 kcal/mol) around a proteinlike motif (x) are capable of inducing antibodies with similar affinity for both peptide and native protein, more weakly stable peptides (DeltaG(x)>0 kcal/mol) trigger antibodies recognizing full protein but not peptide, and unstable peptides (DeltaG(x)>8 kcal/mol) fail to generate antibodies against either peptide or protein. Immunization experiments involving peptides derived from the autoantigen histidyl-tRNA synthetase verify that selected peptides with varying relative stabilities predicted by molecular dynamics simulations induce antibody responses consistent with this theory. Collectively, these studies provide insight pertinent to the structural basis of immunogenicity and, at the same time, validate this form of thermodynamic and molecular modeling as an approach to probe the development/evolution of humoral immune responses.
Carlos J. Camacho, Yasuhiro Katsumata, Dana P. Ascherman
PLoS Comput. Biol.1
2005 FastContact: rapid estimate of contact and binding free energies
abstract
UNLABELLED: Interaction free energies are crucial for analyzing binding propensities in proteins. Although the problem of computing binding free energies remains open, approximate estimates have become very useful for filtering potential binding complexes. We report on the implementation of a fast computational estimate of the binding free energy based on a statistically determined desolvation contact potential and Coulomb electrostatics with a distance-dependent dielectric constant, and validated in the Critical Assessment of PRotein Interactions experiment. The application also reports residue contact free energies that rapidly highlight the hotspots of the interaction. AVAILABILITY: The program was written in Fortran. The executable and full documentation is freely available at http://structure.pitt.edu/software/FastContact
Carlos J. Camacho
Bioinform.1
2004 ClusPro: an automated docking and discrimination method for the prediction of protein complexes
abstract
MOTIVATION: Predicting protein interactions is one of the most challenging problems in functional genomics. Given two proteins known to interact, current docking methods evaluate billions of docked conformations by simple scoring functions, and in addition to near-native structures yield many false positives, i.e. structures with good surface complementarity but far from the native. RESULTS: We have developed a fast algorithm for filtering docked conformations with good surface complementarity, and ranking them based on their clustering properties. The free energy filters select complexes with lowest desolvation and electrostatic energies. Clustering is then used to smooth the local minima and to select the ones with the broadest energy wells-a property associated with the free energy at the binding site. The robustness of the method was tested on sets of 2000 docked conformations generated for 48 pairs of interacting proteins. In 31 of these cases, the top 10 predictions include at least one near-native complex, with an average RMSD of 5 A from the native structure. The docking and discrimination method also provides good results for a number of complexes that were used as targets in the Critical Assessment of PRedictions of Interactions experiment. AVAILABILITY: The fully automated docking and discrimination server ClusPro can be found at http://structure.bu.edu
Stephen R. Comeau, David W. Gatchell, Sandor Vajda, Carlos J. Camacho
Bioinform.4
2003 Homology Modeling of Proteins Using Multiple Models and Consensus Sequence Alignment
Jahnavi C. Prasad, Michael Silberstein, Carlos J. Camacho, Sandor Vajda
WABI3
2003 Consensus alignment for reliable framework prediction in homology modeling
abstract
MOTIVATION: Even the best sequence alignment methods frequently fail to correctly identify the framework regions for which backbones can be copied from the template into the target structure. Since the underprediction and, more significantly, the overprediction of these regions reduces the quality of the final model, it is of prime importance to attain as much as possible of the true structural alignment between target and template. RESULTS: We have developed an algorithm called Consensus that consistently provides a high quality alignment for comparative modeling. The method follows from a benchmark analysis of the 3D models generated by ten alignment techniques for a set of 79 homologous protein structure pairs. For 20-to-40% of the targets, these methods yield models with at least 6 A root mean square deviation (RMSD) from the native structure. We have selected the top five performing methods, and developed a consensus algorithm to generate an improved alignment. By building on the individual strength of each method, a set of criteria was implemented to remove the alignment segments that are likely to correspond to structurally dissimilar regions. The automated algorithm was validated on a different set of 48 protein pairs, resulting in 2.2 A average RMSD for the predicted models, and only four cases in which the RMSD exceeded 3 A. The average length of the alignments was about 75% of that found by standard structural superposition methods. The performance of Consensus was consistent from 2 to 32% target-template sequence identity, and hence it can be used for accurate prediction of framework regions in homology modeling.
Jahnavi C. Prasad, Stephen R. Comeau, Sandor Vajda, Carlos J. Camacho
Bioinform.4