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

Patricia C. Babbitt

dblp:76/64 · DBLP profile ↗
← Back
18ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0003-0375-9015ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 18

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
7 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
protein function prediction
0.422019
Effusion: prediction of protein function from sequence similarity networks · Bioinform. 2019
Automated discovery of 3D motifs for protein function annotation · Bioinform. 2006
Bioinformatics and computational biology › protein function prediction › sequence-based protein function prediction
homology-based function transfer
0.412019
Effusion: prediction of protein function from sequence similarity networks · Bioinform. 2019
Bioinformatics and computational biology
protein sequence analysis
0.232011
Improving the quality of protein similarity network clustering algorithms using the network edge weight distribution · Bioinform. 2011
Intersect: identification and visualization of overlaps in database search results · Bioinform. 2003
Shotgun: getting more from sequence similarity searches · Bioinform. 1999
Bioinformatics and computational biology
protein analysis
0.112012
Pythoscape: a framework for generation of large protein similarity networks · Bioinform. 2012
Bioinformatics and computational biology › biological network › network biology
protein similarity network
0.112012
Pythoscape: a framework for generation of large protein similarity networks · Bioinform. 2012
Bioinformatics and computational biology › network bioinformatics
biological network analysis
0.112011
Improving the quality of protein similarity network clustering algorithms using the network edge weight distribution · Bioinform. 2011
Bioinformatics and computational biology › network bioinformatics › biological network analysis › network analysis
network clustering
0.112011
Improving the quality of protein similarity network clustering algorithms using the network edge weight distribution · Bioinform. 2011
Bioinformatics and computational biology › protein sequence analysis › protein family analysis
protein family clustering
0.112011
Improving the quality of protein similarity network clustering algorithms using the network edge weight distribution · Bioinform. 2011
Bioinformatics and computational biology › protein function prediction
gene ontology annotation
0.112019
Effusion: prediction of protein function from sequence similarity networks · Bioinform. 2019
Bioinformatics and computational biology › network bioinformatics › biological network analysis › network visualization
biological network visualization
0.112007
structureViz: linking Cytoscape and UCSF Chimera · Bioinform. 2007
Bioinformatics and computational biology › structural bioinformatics › protein structure representation
protein structure visualization
0.112007
structureViz: linking Cytoscape and UCSF Chimera · Bioinform. 2007
Bioinformatics and computational biology
structural bioinformatics
0.112007
structureViz: linking Cytoscape and UCSF Chimera · Bioinform. 2007
Bioinformatics and computational biology › sequence analysis
sequence similarity search
0.122003
Intersect: identification and visualization of overlaps in database search results · Bioinform. 2003
Shotgun: getting more from sequence similarity searches · Bioinform. 1999
Bioinformatics and computational biology
sequence analysis
0.012012
Pythoscape: a framework for generation of large protein similarity networks · Bioinform. 2012
Bioinformatics and computational biology › protein sequence analysis › protein family analysis
protein superfamily identification
0.011999
Shotgun: getting more from sequence similarity searches · Bioinform. 1999
Bioinformatics and computational biology
protein structure analysis
0.012006
Automated discovery of 3D motifs for protein function annotation · Bioinform. 2006

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

probabilistic graphical model · 0.4label propagation · 0.4representative node compression · 0.1network filtering · 0.1edge weight distribution analysis · 0.1network-structure linking · 0.1machine learning · 0.1
YearPublicationVenuePosition
2019 Effusion: prediction of protein function from sequence similarity networks
abstract
Motivation: Critical evaluation of methods for protein function prediction shows that data integration improves the performance of methods that predict protein function, but a basic BLAST-based method is still a top contender. We sought to engineer a method that modernizes the classical approach while avoiding pitfalls common to state-of-the-art methods. Results: We present a method for predicting protein function, Effusion, which uses a sequence similarity network to add context for homology transfer, a probabilistic model to account for the uncertainty in labels and function propagation, and the structure of the Gene Ontology (GO) to best utilize sparse input labels and make consistent output predictions. Effusion's model makes it practical to integrate rare experimental data and abundant primary sequence and sequence similarity. We demonstrate Effusion's performance using a critical evaluation method and provide an in-depth analysis. We also dissect the design decisions we used to address challenges for predicting protein function. Finally, we propose directions in which the framework of the method can be modified for additional predictive power. Availability and implementation: The source code for an implementation of Effusion is freely available at https://github.com/babbittlab/effusion. Supplementary information: Supplementary data are available at Bioinformatics online.
Jeffrey M. Yunes, Patricia C. Babbitt
Bioinform.2
2018 New computational approaches to understanding molecular protein function
abstract
Defining functionFunction is like beauty-its definition lies in the eye of the beholder or, in this case, the researcher.At the broadest level, we define organismal function-the function that the protein plays in the overall organism.This function can be observed by understanding the impact on the organism of deletion or mutation of the protein.Physiological function is the function the protein plays in pathways, such as metabolic or signaling pathways.Another level of function is the cellular level.Approaches to understanding cellular function attempt to identify a protein's interaction partners and its location within the cell.Biochemical or molecular function is another level of function, one that identifies the molecular functional details of a functional site, including reaction mechanism, substrate binding, and molecular details of the binding of regulatory molecules.The International Union of Pure and Applied Chemistry (IUPAC) Enzyme Classification (EC) system was an early approach to identifying molecular function.The Gene Ontology (GO) system of classifying function recognizes ways of defining function, using distinct cellular components, molecular function, and biological process hierarchies [1].The emphasis in the collection of research articles that comprise this Focus Feature is on understanding the different molecular functions that can exist within a protein superfamily and the features that define those differences.
Jacquelyn S. Fetrow, Patricia C. Babbitt
PLoS Comput. Biol.2
2017 An Atlas of Peroxiredoxins Created Using an Active Site Profile-Based Approach to Functionally Relevant Clustering of Proteins
abstract
Peroxiredoxins (Prxs or Prdxs) are a large protein superfamily of antioxidant enzymes that rapidly detoxify damaging peroxides and/or affect signal transduction and, thus, have roles in proliferation, differentiation, and apoptosis. Prx superfamily members are widespread across phylogeny and multiple methods have been developed to classify them. Here we present an updated atlas of the Prx superfamily identified using a novel method called MISST (Multi-level Iterative Sequence Searching Technique). MISST is an iterative search process developed to be both agglomerative, to add sequences containing similar functional site features, and divisive, to split groups when functional site features suggest distinct functionally-relevant clusters. Superfamily members need not be identified initially-MISST begins with a minimal representative set of known structures and searches GenBank iteratively. Further, the method's novelty lies in the manner in which isofunctional groups are selected; rather than use a single or shifting threshold to identify clusters, the groups are deemed isofunctional when they pass a self-identification criterion, such that the group identifies itself and nothing else in a search of GenBank. The method was preliminarily validated on the Prxs, as the Prxs presented challenges of both agglomeration and division. For example, previous sequence analysis clustered the Prx functional families Prx1 and Prx6 into one group. Subsequent expert analysis clearly identified Prx6 as a distinct functionally relevant group. The MISST process distinguishes these two closely related, though functionally distinct, families. Through MISST search iterations, over 38,000 Prx sequences were identified, which the method divided into six isofunctional clusters, consistent with previous expert analysis. The results represent the most complete computational functional analysis of proteins comprising the Prx superfamily. The feasibility of this novel method is demonstrated by the Prx superfamily results, laying the foundation for potential functionally relevant clustering of the universe of protein sequences.
Angela F. Harper, Janelle B. Leuthaeuser, Patricia C. Babbitt, John Scotter Morris, Thomas E. Ferrin, Leslie B. Poole, Jacquelyn S. Fetrow
PLoS Comput. Biol.3
2016 DASP3: identification of protein sequences belonging to functionally relevant groups
abstract
BACKGROUND: Development of automatable processes for clustering proteins into functionally relevant groups is a critical hurdle as an increasing number of sequences are deposited into databases. Experimental function determination is exceptionally time-consuming and can't keep pace with the identification of protein sequences. A tool, DASP (Deacon Active Site Profiler), was previously developed to identify protein sequences with active site similarity to a query set. Development of two iterative, automatable methods for clustering proteins into functionally relevant groups exposed algorithmic limitations to DASP. RESULTS: The accuracy and efficiency of DASP was significantly improved through six algorithmic enhancements implemented in two stages: DASP2 and DASP3. Validation demonstrated DASP3 provides greater score separation between true positives and false positives than earlier versions. In addition, DASP3 shows similar performance to previous versions in clustering protein structures into isofunctional groups (validated against manual curation), but DASP3 gathers and clusters protein sequences into isofunctional groups more efficiently than DASP and DASP2. CONCLUSIONS: DASP algorithmic enhancements resulted in improved efficiency and accuracy of identifying proteins that contain active site features similar to those of the query set. These enhancements provide incremental improvement in structure database searches and initial sequence database searches; however, the enhancements show significant improvement in iterative sequence searches, suggesting DASP3 is an appropriate tool for the iterative processes required for clustering proteins into isofunctional groups.
Janelle B. Leuthaeuser, John Scotter Morris, Angela F. Harper, Thomas E. Ferrin, Patricia C. Babbitt, Jacquelyn S. Fetrow
BMC Bioinform.5
2014 Predicting the Functions and Specificity of Triterpenoid Synthases: A Mechanism-Based Multi-intermediate Docking Approach
abstract
Terpenoid synthases construct the carbon skeletons of tens of thousands of natural products. To predict functions and specificity of triterpenoid synthases, a mechanism-based, multi-intermediate docking approach is proposed. In addition to enzyme function prediction, other potential applications of the current approach, such as enzyme mechanistic studies and enzyme redesign by mutagenesis, are discussed.
Bo-Xue Tian, Frank H. Wallrapp, Gemma L. Holliday, Jeng-Yeong Chow, Patricia C. Babbitt, C. Dale Poulter, Matthew P. Jacobson
PLoS Comput. Biol.5
2013 Biases in the Experimental Annotations of Protein Function and Their Effect on Our Understanding of Protein Function Space
abstract
The ongoing functional annotation of proteins relies upon the work of curators to capture experimental findings from scientific literature and apply them to protein sequence and structure data. However, with the increasing use of high-throughput experimental assays, a small number of experimental studies dominate the functional protein annotations collected in databases. Here, we investigate just how prevalent is the "few articles - many proteins" phenomenon. We examine the experimentally validated annotation of proteins provided by several groups in the GO Consortium, and show that the distribution of proteins per published study is exponential, with 0.14% of articles providing the source of annotations for 25% of the proteins in the UniProt-GOA compilation. Since each of the dominant articles describes the use of an assay that can find only one function or a small group of functions, this leads to substantial biases in what we know about the function of many proteins. Mass-spectrometry, microscopy and RNAi experiments dominate high throughput experiments. Consequently, the functional information derived from these experiments is mostly of the subcellular location of proteins, and of the participation of proteins in embryonic developmental pathways. For some organisms, the information provided by different studies overlap by a large amount. We also show that the information provided by high throughput experiments is less specific than those provided by low throughput experiments. Given the experimental techniques available, certain biases in protein function annotation due to high-throughput experiments are unavoidable. Knowing that these biases exist and understanding their characteristics and extent is important for database curators, developers of function annotation programs, and anyone who uses protein function annotation data to plan experiments.
Alexandra M. Schnoes, David C. Ream, Alexander W. Thorman, Patricia C. Babbitt, Iddo Friedberg
PLoS Comput. Biol.4
2012 Pythoscape: a framework for generation of large protein similarity networks
abstract
Pythoscape is a framework implemented in Python for processing large protein similarity networks for visualization in other software packages. Protein similarity networks are graphical representations of sequence, structural and other similarities among proteins for which pairwise all-by-all similarity connections have been calculated. Mapping of biological and other information to network nodes or edges enables hypothesis creation about sequence-structure-function relationships across sets of related proteins. Pythoscape provides several options to calculate pairwise similarities for input sequences or structures, applies filters to network edges and defines sets of similar nodes and their associated data as single nodes (termed representative nodes) for compression of network information and output data or formatted files for visualization.
Alan E. Barber II, Patricia C. Babbitt
Bioinform.2
2011 Improving the quality of protein similarity network clustering algorithms using the network edge weight distribution
abstract
MOTIVATION: Clustering protein sequence data into functionally specific families is a difficult but important problem in biological research. One useful approach for tackling this problem involves representing the sequence dataset as a protein similarity network, and afterwards clustering the network using advanced graph analysis techniques. Although a multitude of such network clustering algorithms have been developed over the past few years, comparing algorithms is often difficult because performance is affected by the specifics of network construction. We investigate an important aspect of network construction used in analyzing protein superfamilies and present a heuristic approach for improving the performance of several algorithms. RESULTS: We analyzed how the performance of network clustering algorithms relates to thresholding the network prior to clustering. Our results, over four different datasets, show how for each input dataset there exists an optimal threshold range over which an algorithm generates its most accurate clustering output. Our results further show how the optimal threshold range correlates with the shape of the edge weight distribution for the input similarity network. We used this correlation to develop an automated threshold selection heuristic in order to most optimally filter a similarity network prior to clustering. This heuristic allows researchers to process their protein datasets with runtime efficient network clustering algorithms without sacrificing the clustering accuracy of the final results. AVAILABILITY: Python code for implementing the automated threshold selection heuristic, together with the datasets used in our analysis, are available at http://www.rbvi.ucsf.edu/Research/cytoscape/threshold_scripts.zip.
Leonard Apeltsin, John Scotter Morris, Patricia C. Babbitt, Thomas E. Ferrin
Bioinform.3
2010 Quantitative Comparison of Catalytic Mechanisms and Overall Reactions in Convergently Evolved Enzymes: Implications for Classification of Enzyme Function
abstract
Functionally analogous enzymes are those that catalyze similar reactions on similar substrates but do not share common ancestry, providing a window on the different structural strategies nature has used to evolve required catalysts. Identification and use of this information to improve reaction classification and computational annotation of enzymes newly discovered in the genome projects would benefit from systematic determination of reaction similarities. Here, we quantified similarity in bond changes for overall reactions and catalytic mechanisms for 95 pairs of functionally analogous enzymes (non-homologous enzymes with identical first three numbers of their EC codes) from the MACiE database. Similarity of overall reactions was computed by comparing the sets of bond changes in the transformations from substrates to products. For similarity of mechanisms, sets of bond changes occurring in each mechanistic step were compared; these similarities were then used to guide global and local alignments of mechanistic steps. Using this metric, only 44% of pairs of functionally analogous enzymes in the dataset had significantly similar overall reactions. For these enzymes, convergence to the same mechanism occurred in 33% of cases, with most pairs having at least one identical mechanistic step. Using our metric, overall reaction similarity serves as an upper bound for mechanistic similarity in functional analogs. For example, the four carbon-oxygen lyases acting on phosphates (EC 4.2.3) show neither significant overall reaction similarity nor significant mechanistic similarity. By contrast, the three carboxylic-ester hydrolases (EC 3.1.1) catalyze overall reactions with identical bond changes and have converged to almost identical mechanisms. The large proportion of enzyme pairs that do not show significant overall reaction similarity (56%) suggests that at least for the functionally analogous enzymes studied here, more stringent criteria could be used to refine definitions of EC sub-subclasses for improved discrimination in their classification of enzyme reactions. The results also indicate that mechanistic convergence of reaction steps is widespread, suggesting that quantitative measurement of mechanistic similarity can inform approaches for functional annotation.
Daniel E. Almonacid, Emmanuel R. Yera, John B. O. Mitchell, Patricia C. Babbitt
PLoS Comput. Biol.4
2009 A Mapping of Drug Space from the Viewpoint of Small Molecule Metabolism
abstract
Small molecule drugs target many core metabolic enzymes in humans and pathogens, often mimicking endogenous ligands. The effects may be therapeutic or toxic, but are frequently unexpected. A large-scale mapping of the intersection between drugs and metabolism is needed to better guide drug discovery. To map the intersection between drugs and metabolism, we have grouped drugs and metabolites by their associated targets and enzymes using ligand-based set signatures created to quantify their degree of similarity in chemical space. The results reveal the chemical space that has been explored for metabolic targets, where successful drugs have been found, and what novel territory remains. To aid other researchers in their drug discovery efforts, we have created an online resource of interactive maps linking drugs to metabolism. These maps predict the "effect space" comprising likely target enzymes for each of the 246 MDDR drug classes in humans. The online resource also provides species-specific interactive drug-metabolism maps for each of the 385 model organisms and pathogens in the BioCyc database collection. Chemical similarity links between drugs and metabolites predict potential toxicity, suggest routes of metabolism, and reveal drug polypharmacology. The metabolic maps enable interactive navigation of the vast biological data on potential metabolic drug targets and the drug chemistry currently available to prosecute those targets. Thus, this work provides a large-scale approach to ligand-based prediction of drug action in small molecule metabolism.
James Corey Adams, Michael J. Keiser, Li Basuino, Henry F. Chambers, Deok-Sun Lee, Olaf G. Wiest, Patricia C. Babbitt
PLoS Comput. Biol.7
2009 An Atlas of the Thioredoxin Fold Class Reveals the Complexity of Function-Enabling Adaptations
abstract
The group of proteins that contain a thioredoxin (Trx) fold is huge and diverse. Assessment of the variation in catalytic machinery of Trx fold proteins is essential in providing a foundation for understanding their functional diversity and predicting the function of the many uncharacterized members of the class. The proteins of the Trx fold class retain common features-including variations on a dithiol CxxC active site motif-that lead to delivery of function. We use protein similarity networks to guide an analysis of how structural and sequence motifs track with catalytic function and taxonomic categories for 4,082 representative sequences spanning the known superfamilies of the Trx fold. Domain structure in the fold class is varied and modular, with 2.8% of sequences containing more than one Trx fold domain. Most member proteins are bacterial. The fold class exhibits many modifications to the CxxC active site motif-only 56.8% of proteins have both cysteines, and no functional groupings have absolute conservation of the expected catalytic motif. Only a small fraction of Trx fold sequences have been functionally characterized. This work provides a global view of the complex distribution of domains and catalytic machinery throughout the fold class, showing that each superfamily contains remnants of the CxxC active site. The unifying context provided by this work can guide the comparison of members of different Trx fold superfamilies to gain insight about their structure-function relationships, illustrated here with the thioredoxins and peroxiredoxins.
Holly J. Atkinson, Patricia C. Babbitt
PLoS Comput. Biol.2
2009 Annotation Error in Public Databases: Misannotation of Molecular Function in Enzyme Superfamilies
abstract
Due to the rapid release of new data from genome sequencing projects, the majority of protein sequences in public databases have not been experimentally characterized; rather, sequences are annotated using computational analysis. The level of misannotation and the types of misannotation in large public databases are currently unknown and have not been analyzed in depth. We have investigated the misannotation levels for molecular function in four public protein sequence databases (UniProtKB/Swiss-Prot, GenBank NR, UniProtKB/TrEMBL, and KEGG) for a model set of 37 enzyme families for which extensive experimental information is available. The manually curated database Swiss-Prot shows the lowest annotation error levels (close to 0% for most families); the two other protein sequence databases (GenBank NR and TrEMBL) and the protein sequences in the KEGG pathways database exhibit similar and surprisingly high levels of misannotation that average 5%-63% across the six superfamilies studied. For 10 of the 37 families examined, the level of misannotation in one or more of these databases is >80%. Examination of the NR database over time shows that misannotation has increased from 1993 to 2005. The types of misannotation that were found fall into several categories, most associated with "overprediction" of molecular function. These results suggest that misannotation in enzyme superfamilies containing multiple families that catalyze different reactions is a larger problem than has been recognized. Strategies are suggested for addressing some of the systematic problems contributing to these high levels of misannotation.
Alexandra M. Schnoes, Shoshana D. Brown, Igor Dodevski, Patricia C. Babbitt
PLoS Comput. Biol.4
2008 Evolutionarily Conserved Substrate Substructures for Automated Annotation of Enzyme Superfamilies
abstract
The evolution of enzymes affects how well a species can adapt to new environmental conditions. During enzyme evolution, certain aspects of molecular function are conserved while other aspects can vary. Aspects of function that are more difficult to change or that need to be reused in multiple contexts are often conserved, while those that vary may indicate functions that are more easily changed or that are no longer required. In analogy to the study of conservation patterns in enzyme sequences and structures, we have examined the patterns of conservation and variation in enzyme function by analyzing graph isomorphisms among enzyme substrates of a large number of enzyme superfamilies. This systematic analysis of substrate substructures establishes the conservation patterns that typify individual superfamilies. Specifically, we determined the chemical substructures that are conserved among all known substrates of a superfamily and the substructures that are reacting in these substrates and then examined the relationship between the two. Across the 42 superfamilies that were analyzed, substantial variation was found in how much of the conserved substructure is reacting, suggesting that superfamilies may not be easily grouped into discrete and separable categories. Instead, our results suggest that many superfamilies may need to be treated individually for analyses of evolution, function prediction, and guiding enzyme engineering strategies. Annotating superfamilies with these conserved and reacting substructure patterns provides information that is orthogonal to information provided by studies of conservation in superfamily sequences and structures, thereby improving the precision with which we can predict the functions of enzymes of unknown function and direct studies in enzyme engineering. Because the method is automated, it is suitable for large-scale characterization and comparison of fundamental functional capabilities of both characterized and uncharacterized enzyme superfamilies.
Ranyee A. Chiang, Andrej Sali, Patricia C. Babbitt
PLoS Comput. Biol.3
2007 structureViz: linking Cytoscape and UCSF Chimera
abstract
structureViz is a Cytoscape plug-in that links the visualization of biological networks provided by Cytoscape with the visualization and analysis of macromolecular structures and sequences provided by UCSF Chimera. When combined with Cytoscape and Chimera, structureViz provides the first tool that links these two critical aspects of computational analysis in a straightforward manner. structureViz includes commands to open structures in Chimera and align them using Chimera's sequence-structure analysis tools. When a structure is opened, structureViz provides an alternative interface to Chimera: the Cytoscape Molecular Structure Navigator. This interface uses a tree-based paradigm to allow users to select and affect the display of models, chains and residues, mostly through the use of context menus.
John Scotter Morris, Conrad C. Huang, Patricia C. Babbitt, Thomas E. Ferrin
Bioinform.3
2007 Evolution of Function in the "Two Dinucleotide Binding Domains" Flavoproteins
abstract
Structural and biochemical constraints force some segments of proteins to evolve more slowly than others, often allowing identification of conserved structural or sequence motifs that can be associated with substrate binding properties, chemical mechanisms, and molecular functions. We have assessed the functional and structural constraints imposed by cofactors on the evolution of new functions in a superfamily of flavoproteins characterized by two-dinucleotide binding domains, the "two dinucleotide binding domains" flavoproteins (tDBDF) superfamily. Although these enzymes catalyze many different types of oxidation/reduction reactions, each is initiated by a stereospecific hydride transfer reaction between two cofactors, a pyridine nucleotide and flavin adenine dinucleotide (FAD). Sequence and structural analysis of more than 1,600 members of the superfamily reveals new members and identifies details of the evolutionary connections among them. Our analysis shows that in all of the highly divergent families within the superfamily, these cofactors adopt a conserved configuration optimal for stereospecific hydride transfer that is stabilized by specific interactions with amino acids from several motifs distributed among both dinucleotide binding domains. The conservation of cofactor configuration in the active site restricts the pyridine nucleotide to interact with FAD from the re-side, limiting the flow of electrons from the re-side to the si-side. This directionality of electron flow constrains interactions with the different partner proteins of different families to occur on the same face of the cofactor binding domains. As a result, superimposing the structures of tDBDFs aligns not only these interacting proteins, but also their constituent electron acceptors, including heme and iron-sulfur clusters. Thus, not only are specific aspects of the cofactor-directed chemical mechanism conserved across the superfamily, the constraints they impose are manifested in the mode of protein-protein interactions. Overlaid on this foundation of conserved interactions, nature has conscripted different protein partners to serve as electron acceptors, thereby generating diversification of function across the superfamily.
Sunil Ojha, Elaine C. Meng, Patricia C. Babbitt
PLoS Comput. Biol.3
2006 Automated discovery of 3D motifs for protein function annotation
abstract
MOTIVATION: Function inference from structure is facilitated by the use of patterns of residues (3D motifs), normally identified by expert knowledge, that correlate with function. As an alternative to often limited expert knowledge, we use machine-learning techniques to identify patterns of 3-10 residues that maximize function prediction. This approach allows us to test the assumption that residues that provide function are the most informative for predicting function. RESULTS: We apply our method, GASPS, to the haloacid dehalogenase, enolase, amidohydrolase and crotonase superfamilies and to the serine proteases. The motifs found by GASPS are as good at function prediction as 3D motifs based on expert knowledge. The GASPS motifs with the greatest ability to predict protein function consist mainly of known functional residues. However, several residues with no known functional role are equally predictive. For four groups, we show that the predictive power of our 3D motifs is comparable with or better than approaches that use the entire fold (Combinatorial-Extension) or sequence profiles (PSI-BLAST). AVAILABILITY: Source code is freely available for academic use by contacting the authors. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Benjamin J. Polacco, Patricia C. Babbitt
Bioinform.2
2003 Intersect: identification and visualization of overlaps in database search results
abstract
UNLABELLED: The determination of distant evolutionary relationships remains an important biological problem, and distant homologs often appear in statistically insignificant regions of sequence similarity searches. Intersect is a computer program designed to identify and visualize the overlaps between sets of sequences reported by multiple database searches. This capability extends the usefulness of database search results and aids researchers in identifying the individual sequences that best bridge sequence families and superfamilies. AVAILABILITY: The Intersect program is available from the Babbitt laboratory website at http://www.babbittlab.ucsf.edu/software/intersect
Scott C.-H. Pegg, Walter R. P. Novak, Patricia C. Babbitt
Bioinform.3
1999 Shotgun: getting more from sequence similarity searches
abstract
MOTIVATION: As genomic sequencing reveals the range of structural classes generated through the evolution of proteins, analysis of the superfamilies to which they belong can contribute important insights for understanding their structure-function relationships. Current database search techniques fall short of identifying the majority of distant sequence relationships at statistically significant levels. We developed the Shotgun program in an effort to enhance the sensitivity and utility of current database search output. RESULTS: We have developed and used the Shotgun program to identify both new superfamily members and to reconstruct several known enzyme superfamilies using BLAST database searches. An analysis of the false-positive rates generated in the analysis and other control experiments provides evidence that high Shotgun scores indicate real evolutionary relationships. Shotgun is also a useful tool for identifying subgroup relationships within superfamilies and for testing hypotheses about related protein families. AVAILABILITY: By request from the Babbitt lab homepage: http://mako.cgl.ucsf. edu/babbittlab/ CONTACT: [email protected]
Scott C.-H. Pegg, Patricia C. Babbitt
Bioinform.2