PMCC PMCC

Search tips
Search criteria

Advanced
Results 1-20 (20)
 

Clipboard (0)
None

Select a Filter Below

Journals
more »
Year of Publication
1.  The COMBREX Project: Design, Methodology, and Initial Results 
Anton, Brian P. | Chang, Yi-Chien | Brown, Peter | Choi, Han-Pil | Faller, Lina L. | Guleria, Jyotsna | Hu, Zhenjun | Klitgord, Niels | Levy-Moonshine, Ami | Maksad, Almaz | Mazumdar, Varun | McGettrick, Mark | Osmani, Lais | Pokrzywa, Revonda | Rachlin, John | Swaminathan, Rajeswari | Allen, Benjamin | Housman, Genevieve | Monahan, Caitlin | Rochussen, Krista | Tao, Kevin | Bhagwat, Ashok S. | Brenner, Steven E. | Columbus, Linda | de Crécy-Lagard, Valérie | Ferguson, Donald | Fomenkov, Alexey | Gadda, Giovanni | Morgan, Richard D. | Osterman, Andrei L. | Rodionov, Dmitry A. | Rodionova, Irina A. | Rudd, Kenneth E. | Söll, Dieter | Spain, James | Xu, Shuang-yong | Bateman, Alex | Blumenthal, Robert M. | Bollinger, J. Martin | Chang, Woo-Suk | Ferrer, Manuel | Friedberg, Iddo | Galperin, Michael Y. | Gobeill, Julien | Haft, Daniel | Hunt, John | Karp, Peter | Klimke, William | Krebs, Carsten | Macelis, Dana | Madupu, Ramana | Martin, Maria J. | Miller, Jeffrey H. | O'Donovan, Claire | Palsson, Bernhard | Ruch, Patrick | Setterdahl, Aaron | Sutton, Granger | Tate, John | Yakunin, Alexander | Tchigvintsev, Dmitri | Plata, Germán | Hu, Jie | Greiner, Russell | Horn, David | Sjölander, Kimmen | Salzberg, Steven L. | Vitkup, Dennis | Letovsky, Stanley | Segrè, Daniel | DeLisi, Charles | Roberts, Richard J. | Steffen, Martin | Kasif, Simon
PLoS Biology  2013;11(8):e1001638.
Experimental data exists for only a vanishingly small fraction of sequenced microbial genes. This community page discusses the progress made by the COMBREX project to address this important issue using both computational and experimental resources.
doi:10.1371/journal.pbio.1001638
PMCID: PMC3754883  PMID: 24013487
2.  The PhyloFacts FAT-CAT web server: ortholog identification and function prediction using fast approximate tree classification 
Nucleic Acids Research  2013;41(Web Server issue):W242-W248.
The PhyloFacts ‘Fast Approximate Tree Classification’ (FAT-CAT) web server provides a novel approach to ortholog identification using subtree hidden Markov model-based placement of protein sequences to phylogenomic orthology groups in the PhyloFacts database. Results on a data set of microbial, plant and animal proteins demonstrate FAT-CAT’s high precision at separating orthologs and paralogs and robustness to promiscuous domains. We also present results documenting the precision of ortholog identification based on subtree hidden Markov model scoring. The FAT-CAT phylogenetic placement is used to derive a functional annotation for the query, including confidence scores and drill-down capabilities. PhyloFacts’ broad taxonomic and functional coverage, with >7.3 M proteins from across the Tree of Life, enables FAT-CAT to predict orthologs and assign function for most sequence inputs. Four pipeline parameter presets are provided to handle different sequence types, including partial sequences and proteins containing promiscuous domains; users can also modify individual parameters. PhyloFacts trees matching the query can be viewed interactively online using the PhyloScope Javascript tree viewer and are hyperlinked to various external databases. The FAT-CAT web server is available at http://phylogenomics.berkeley.edu/phylofacts/fatcat/.
doi:10.1093/nar/gkt399
PMCID: PMC3692063  PMID: 23685612
3.  Distribution and Properties of the Genes Encoding the Biosynthesis of the Bacterial Cofactor, Pyrroloquinoline Quinone† 
Biochemistry  2012;51(11):2265-2275.
Pyrroloquinoline quinone (PQQ) is a small, redox-active molecule that serves as a cofactor for several bacterial dehydrogenases, introducing pathways for carbon utilization that confer a growth advantage. Early studies had implicated a ribosomally translated peptide as the substrate for PQQ production. This study presents a sequence and structure based analysis of the components of the pqq operon. We find the necessary components for PQQ production are present in 126 prokaryotes, most of which are Gram- negative and a number of which are pathogens. A total of five gene products, PqqA, PqqB, PqqC, PqqD and PqqE, are concluded to be obligatory for PQQ production. Three of the gene products in the pqq operon, PqqB, PqqC and PqqE, are members of large protein superfamilies. By combining evolutionary conservation patterns with information from three-dimensional structures, we are able to differentiate the gene products involved in PQQ biosynthesis from those with divergent functions. The observed persistence of a conserved gene order within analyzed operons strongly suggests a role for protein/protein interactions in the course of cofactor biosynthesis. These studies propose previously unidentified roles for several of the gene products as well as possible new targets for antibiotic design and application.
doi:10.1021/bi201763d
PMCID: PMC3334298  PMID: 22324760
pyrroloquinoline; quinone; pathogenicity; phylogenomic analysis; metallo-beta-lactamase; radical SAM domain; cofactorless oxidase
4.  Toward community standards in the quest for orthologs 
Bioinformatics  2012;28(6):900-904.
The identification of orthologs—genes pairs descended from a common ancestor through speciation, rather than duplication—has emerged as an essential component of many bioinformatics applications, ranging from the annotation of new genomes to experimental target prioritization. Yet, the development and application of orthology inference methods is hampered by the lack of consensus on source proteomes, file formats and benchmarks. The second ‘Quest for Orthologs’ meeting brought together stakeholders from various communities to address these challenges. We report on achievements and outcomes of this meeting, focusing on topics of particular relevance to the research community at large. The Quest for Orthologs consortium is an open community that welcomes contributions from all researchers interested in orthology research and applications.
Contact: dessimoz@ebi.ac.uk
doi:10.1093/bioinformatics/bts050
PMCID: PMC3307119  PMID: 22332236
5.  Taking the First Steps towards a Standard for Reporting on Phylogenies: Minimal Information about a Phylogenetic Analysis (MIAPA) 
In the eight years since phylogenomics was introduced as the intersection of genomics and phylogenetics, the field has provided fundamental insights into gene function, genome history and organismal relationships. The utility of phylogenomics is growing with the increase in the number and diversity of taxa for which whole genome and large transcriptome sequence sets are being generated. We assert that the synergy between genomic and phylogenetic perspectives in comparative biology would be enhanced by the development and refinement of minimal reporting standards for phylogenetic analyses. Encouraged by the development of the Minimum Information About a Microarray Experiment (MIAME) standard, we propose a similar roadmap for the development of a Minimal Information About a Phylogenetic Analysis (MIAPA) standard. Key in the successful development and implementation of such a standard will be broad participation by developers of phylogenetic analysis software, phylogenetic database developers, practitioners of phylogenomics, and journal editors.
doi:10.1089/omi.2006.10.231
PMCID: PMC3167193  PMID: 16901231
6.  Ortholog identification in the presence of domain architecture rearrangement 
Briefings in Bioinformatics  2011;12(5):413-422.
Ortholog identification is used in gene functional annotation, species phylogeny estimation, phylogenetic profile construction and many other analyses. Bioinformatics methods for ortholog identification are commonly based on pairwise protein sequence comparisons between whole genomes. Phylogenetic methods of ortholog identification have also been developed; these methods can be applied to protein data sets sharing a common domain architecture or which share a single functional domain but differ outside this region of homology. While promiscuous domains represent a challenge to all orthology prediction methods, overall structural similarity is highly correlated with proximity in a phylogenetic tree, conferring a degree of robustness to phylogenetic methods. In this article, we review the issues involved in orthology prediction when data sets include sequences with structurally heterogeneous domain architectures, with particular attention to automated methods designed for high-throughput application, and present a case study to illustrate the challenges in this area.
doi:10.1093/bib/bbr036
PMCID: PMC3178056  PMID: 21712343
phylogenomics; orthology; promiscuous domains; multi-domain architecture; function prediction; super-ortholog
7.  ModBase, a database of annotated comparative protein structure models, and associated resources 
Nucleic Acids Research  2010;39(Database issue):D465-D474.
ModBase (http://salilab.org/modbase) is a database of annotated comparative protein structure models. The models are calculated by ModPipe, an automated modeling pipeline that relies primarily on Modeller for fold assignment, sequence–structure alignment, model building and model assessment (http://salilab.org/modeller/). ModBase currently contains 10 355 444 reliable models for domains in 2 421 920 unique protein sequences. ModBase allows users to update comparative models on demand, and request modeling of additional sequences through an interface to the ModWeb modeling server (http://salilab.org/modweb). ModBase models are available through the ModBase interface as well as the Protein Model Portal (http://www.proteinmodelportal.org/). Recently developed associated resources include the SALIGN server for multiple sequence and structure alignment (http://salilab.org/salign), the ModEval server for predicting the accuracy of protein structure models (http://salilab.org/modeval), the PCSS server for predicting which peptides bind to a given protein (http://salilab.org/pcss) and the FoXS server for calculating and fitting Small Angle X-ray Scattering profiles (http://salilab.org/foxs).
doi:10.1093/nar/gkq1091
PMCID: PMC3013688  PMID: 21097780
8.  Arabidopsis thaliana PGR7 Encodes a Conserved Chloroplast Protein That Is Necessary for Efficient Photosynthetic Electron Transport 
PLoS ONE  2010;5(7):e11688.
A significant fraction of a plant's nuclear genome encodes chloroplast-targeted proteins, many of which are devoted to the assembly and function of the photosynthetic apparatus. Using digital video imaging of chlorophyll fluorescence, we isolated proton gradient regulation 7 (pgr7) as an Arabidopsis thaliana mutant with low nonphotochemical quenching of chlorophyll fluorescence (NPQ). In pgr7, the xanthophyll cycle and the PSBS gene product, previously identified NPQ factors, were still functional, but the efficiency of photosynthetic electron transport was lower than in the wild type. The pgr7 mutant was also smaller in size and had lower chlorophyll content than the wild type in optimal growth conditions. Positional cloning located the pgr7 mutation in the At3g21200 (PGR7) gene, which was predicted to encode a chloroplast protein of unknown function. Chloroplast targeting of PGR7 was confirmed by transient expression of a GFP fusion protein and by stable expression and subcellular localization of an epitope-tagged version of PGR7. Bioinformatic analyses revealed that the PGR7 protein has two domains that are conserved in plants, algae, and bacteria, and the N-terminal domain is predicted to bind a cofactor such as FMN. Thus, we identified PGR7 as a novel, conserved nuclear gene that is necessary for efficient photosynthetic electron transport in chloroplasts of Arabidopsis.
doi:10.1371/journal.pone.0011688
PMCID: PMC2908147  PMID: 20657737
9.  SATCHMO-JS: a webserver for simultaneous protein multiple sequence alignment and phylogenetic tree construction 
Nucleic Acids Research  2010;38(Web Server issue):W29-W34.
We present the jump-start simultaneous alignment and tree construction using hidden Markov models (SATCHMO-JS) web server for simultaneous estimation of protein multiple sequence alignments (MSAs) and phylogenetic trees. The server takes as input a set of sequences in FASTA format, and outputs a phylogenetic tree and MSA; these can be viewed online or downloaded from the website. SATCHMO-JS is an extension of the SATCHMO algorithm, and employs a divide-and-conquer strategy to jump-start SATCHMO at a higher point in the phylogenetic tree, reducing the computational complexity of the progressive all-versus-all HMM–HMM scoring and alignment. Results on a benchmark dataset of 983 structurally aligned pairs from the PREFAB benchmark dataset show that SATCHMO-JS provides a statistically significant improvement in alignment accuracy over MUSCLE, Multiple Alignment using Fast Fourier Transform (MAFFT), ClustalW and the original SATCHMO algorithm. The SATCHMO-JS webserver is available at http://phylogenomics.berkeley.edu/satchmo-js. The datasets used in these experiments are available for download at http://phylogenomics.berkeley.edu/satchmo-js/supplementary/.
doi:10.1093/nar/gkq298
PMCID: PMC2896197  PMID: 20430824
10.  Getting Started in Structural Phylogenomics 
PLoS Computational Biology  2010;6(1):e1000621.
doi:10.1371/journal.pcbi.1000621
PMCID: PMC2813252  PMID: 20126522
11.  Active site prediction using evolutionary and structural information 
Bioinformatics  2010;26(5):617-624.
Motivation: The identification of catalytic residues is a key step in understanding the function of enzymes. While a variety of computational methods have been developed for this task, accuracies have remained fairly low. The best existing method exploits information from sequence and structure to achieve a precision (the fraction of predicted catalytic residues that are catalytic) of 18.5% at a corresponding recall (the fraction of catalytic residues identified) of 57% on a standard benchmark. Here we present a new method, Discern, which provides a significant improvement over the state-of-the-art through the use of statistical techniques to derive a model with a small set of features that are jointly predictive of enzyme active sites.
Results: In cross-validation experiments on two benchmark datasets from the Catalytic Site Atlas and CATRES resources containing a total of 437 manually curated enzymes spanning 487 SCOP families, Discern increases catalytic site recall between 12% and 20% over methods that combine information from both sequence and structure, and by ≥50% over methods that make use of sequence conservation signal only. Controlled experiments show that Discern's improvement in catalytic residue prediction is derived from the combination of three ingredients: the use of the INTREPID phylogenomic method to extract conservation information; the use of 3D structure data, including features computed for residues that are proximal in the structure; and a statistical regularization procedure to prevent overfitting.
Contact: kimmen@berkeley.edu
Supplementary information: Supplementary data are available at Bioinformatics online.
doi:10.1093/bioinformatics/btq008
PMCID: PMC2828116  PMID: 20080507
12.  ResBoost: characterizing and predicting catalytic residues in enzymes 
BMC Bioinformatics  2009;10:197.
Background
Identifying the catalytic residues in enzymes can aid in understanding the molecular basis of an enzyme's function and has significant implications for designing new drugs, identifying genetic disorders, and engineering proteins with novel functions. Since experimentally determining catalytic sites is expensive, better computational methods for identifying catalytic residues are needed.
Results
We propose ResBoost, a new computational method to learn characteristics of catalytic residues. The method effectively selects and combines rules of thumb into a simple, easily interpretable logical expression that can be used for prediction. We formally define the rules of thumb that are often used to narrow the list of candidate residues, including residue evolutionary conservation, 3D clustering, solvent accessibility, and hydrophilicity. ResBoost builds on two methods from machine learning, the AdaBoost algorithm and Alternating Decision Trees, and provides precise control over the inherent trade-off between sensitivity and specificity. We evaluated ResBoost using cross-validation on a dataset of 100 enzymes from the hand-curated Catalytic Site Atlas (CSA).
Conclusion
ResBoost achieved 85% sensitivity for a 9.8% false positive rate and 73% sensitivity for a 5.7% false positive rate. ResBoost reduces the number of false positives by up to 56% compared to the use of evolutionary conservation scoring alone. We also illustrate the ability of ResBoost to identify recently validated catalytic residues not listed in the CSA.
doi:10.1186/1471-2105-10-197
PMCID: PMC2713229  PMID: 19558703
13.  INTREPID: a web server for prediction of functionally important residues by evolutionary analysis 
Nucleic Acids Research  2009;37(Web Server issue):W390-W395.
We present the INTREPID web server for predicting functionally important residues in proteins. INTREPID has been shown to boost the recall and precision of catalytic residue prediction over other sequence-based methods and can be used to identify other types of functional residues. The web server takes an input protein sequence, gathers homologs, constructs a multiple sequence alignment and phylogenetic tree and finally runs the INTREPID method to assign a score to each position. Residues predicted to be functionally important are displayed on homologous 3D structures (where available), highlighting spatial patterns of conservation at various significance thresholds. The INTREPID web server is available at http://phylogenomics.berkeley.edu/intrepid.
doi:10.1093/nar/gkp339
PMCID: PMC2703888  PMID: 19443452
14.  Berkeley PHOG: PhyloFacts orthology group prediction web server 
Nucleic Acids Research  2009;37(Web Server issue):W84-W89.
Ortholog detection is essential in functional annotation of genomes, with applications to phylogenetic tree construction, prediction of protein–protein interaction and other bioinformatics tasks. We present here the PHOG web server employing a novel algorithm to identify orthologs based on phylogenetic analysis. Results on a benchmark dataset from the TreeFam-A manually curated orthology database show that PHOG provides a combination of high recall and precision competitive with both InParanoid and OrthoMCL, and allows users to target different taxonomic distances and precision levels through the use of tree-distance thresholds. For instance, OrthoMCL-DB achieved 76% recall and 66% precision on this dataset; at a slightly higher precision (68%) PHOG achieves 10% higher recall (86%). InParanoid achieved 87% recall at 24% precision on this dataset, while a PHOG variant designed for high recall achieves 88% recall at 61% precision, increasing precision by 37% over InParanoid. PHOG is based on pre-computed trees in the PhyloFacts resource, and contains over 366 K orthology groups with a minimum of three species. Predicted orthologs are linked to GO annotations, pathway information and biological literature. The PHOG web server is available at http://phylofacts.berkeley.edu/orthologs/.
doi:10.1093/nar/gkp373
PMCID: PMC2703887  PMID: 19435885
15.  INTREPID—INformation-theoretic TREe traversal for Protein functional site IDentification 
Bioinformatics  2008;24(21):2445-2452.
Motivation: Identification of functionally important residues in proteins plays a significant role in biological discovery. Here, we present INTREPID—an information–theoretic approach for functional site identification that exploits the information in large diverse multiple sequence alignments (MSAs). INTREPID uses a traversal of the phylogeny in combination with a positional conservation score, based on Jensen–Shannon divergence, to rank positions in an MSA. While knowledge of protein 3D structure can significantly improve the accuracy of functional site identification, since structural information is not available for a majority of proteins, INTREPID relies solely on sequence information. We evaluated INTREPID on two tasks: predicting catalytic residues and predicting specificity determinants.
Results: In catalytic residue prediction, INTREPID provides significant improvements over Evolutionary Trace, ConSurf as well as over a baseline global conservation method on a set of 100 manually curated enzymes from the Catalytic Site Atlas. In particular, INTREPID is able to better predict catalytic positions that are not globally conserved and hence, attains improved sensitivity at high values of specificity. We also investigated the performance of INTREPID as a function of the evolutionary divergence of the protein family. We found that INTREPID is better able to exploit the diversity in such families and that accuracy improves when homologs with very low sequence identity are included in an alignment. In specificity determinant prediction, when subtype information is known, INTREPID-SPEC, a variant of INTREPID, attains accuracies that are competitive with other approaches for this task.
Availability: INTREPID is available for 16919 families in the PhyloFacts resource (http://phylogenomics.berkeley.edu/phylofacts).
Contact: sriram_s@cs.berkeley.edu
Supplementary information: Relevant online supplementary material is available at http://phylogenomics.berkeley.edu/INTREPID.
doi:10.1093/bioinformatics/btn474
PMCID: PMC2572704  PMID: 18776193
16.  Automated Protein Subfamily Identification and Classification 
PLoS Computational Biology  2007;3(8):e160.
Function prediction by homology is widely used to provide preliminary functional annotations for genes for which experimental evidence of function is unavailable or limited. This approach has been shown to be prone to systematic error, including percolation of annotation errors through sequence databases. Phylogenomic analysis avoids these errors in function prediction but has been difficult to automate for high-throughput application. To address this limitation, we present a computationally efficient pipeline for phylogenomic classification of proteins. This pipeline uses the SCI-PHY (Subfamily Classification in Phylogenomics) algorithm for automatic subfamily identification, followed by subfamily hidden Markov model (HMM) construction. A simple and computationally efficient scoring scheme using family and subfamily HMMs enables classification of novel sequences to protein families and subfamilies. Sequences representing entirely novel subfamilies are differentiated from those that can be classified to subfamilies in the input training set using logistic regression. Subfamily HMM parameters are estimated using an information-sharing protocol, enabling subfamilies containing even a single sequence to benefit from conservation patterns defining the family as a whole or in related subfamilies. SCI-PHY subfamilies correspond closely to functional subtypes defined by experts and to conserved clades found by phylogenetic analysis. Extensive comparisons of subfamily and family HMM performances show that subfamily HMMs dramatically improve the separation between homologous and non-homologous proteins in sequence database searches. Subfamily HMMs also provide extremely high specificity of classification and can be used to predict entirely novel subtypes. The SCI-PHY Web server at http://phylogenomics.berkeley.edu/SCI-PHY/ allows users to upload a multiple sequence alignment for subfamily identification and subfamily HMM construction. Biologists wishing to provide their own subfamily definitions can do so. Source code is available on the Web page. The Berkeley Phylogenomics Group PhyloFacts resource contains pre-calculated subfamily predictions and subfamily HMMs for more than 40,000 protein families and domains at http://phylogenomics.berkeley.edu/phylofacts/.
Author Summary
Predicting the function of a gene or protein (gene product) from its primary sequence is a major focus of many bioinformatics methods. In this paper, the authors present a three-stage computational pipeline for gene functional annotation in an evolutionary framework to reduce the systematic errors associated with the standard protocol (annotation transfer from predicted homologs). In the first stage, a functional hierarchy is estimated for each protein family and subfamilies are identified. In the second stage, hidden Markov models (HMMs) (a type of statistical model) are constructed for each subfamily to model both the family-defining and subfamily-specific signatures. In the third stage, subfamily HMMs are used to assign novel sequences to functional subtypes. Extensive experimental validation of these methods shows that predicted subfamilies correspond closely to functional subtypes identified by experts and to conserved clades in phylogenetic trees; that subfamily HMMs increase the separation between homologs and non-homologs in sequence database discrimination tests relative to the use of a single HMM for the family; and that specificity of classification of novel sequences to subfamilies using subfamily HMMs is near perfect (1.5% error rate when sequences are assigned to the top-scoring subfamily, and <0.5% error rate when logistic regression of scores is employed).
doi:10.1371/journal.pcbi.0030160
PMCID: PMC1950344  PMID: 17708678
17.  Berkeley Phylogenomics Group web servers: resources for structural phylogenomic analysis 
Nucleic Acids Research  2007;35(Web Server issue):W27-W32.
Phylogenomic analysis addresses the limitations of function prediction based on annotation transfer, and has been shown to enable the highest accuracy in prediction of protein molecular function. The Berkeley Phylogenomics Group provides a series of web servers for phylogenomic analysis: classification of sequences to pre-computed families and subfamilies using the PhyloFacts Phylogenomic Encyclopedia, FlowerPower clustering of proteins sharing the same domain architecture, MUSCLE multiple sequence alignment, SATCHMO simultaneous alignment and tree construction and SCI-PHY subfamily identification. The PhyloBuilder web server provides an integrated phylogenomic pipeline starting with a user-supplied protein sequence, proceeding to homolog identification, multiple alignment, phylogenetic tree construction, subfamily identification and structure prediction. The Berkeley Phylogenomics Group resources are available at http://phylogenomics.berkeley.edu.
doi:10.1093/nar/gkm325
PMCID: PMC1933202  PMID: 17488835
18.  FlowerPower: clustering proteins into domain architecture classes for phylogenomic inference of protein function 
BMC Evolutionary Biology  2007;7(Suppl 1):S12.
Background
Function prediction by transfer of annotation from the top database hit in a homology search has been shown to be prone to systematic error. Phylogenomic analysis reduces these errors by inferring protein function within the evolutionary context of the entire family. However, accuracy of function prediction for multi-domain proteins depends on all members having the same overall domain structure. By contrast, most common homolog detection methods are optimized for retrieving local homologs, and do not address this requirement.
Results
We present FlowerPower, a novel clustering algorithm designed for the identification of global homologs as a precursor to structural phylogenomic analysis. Similar to methods such as PSIBLAST, FlowerPower employs an iterative approach to clustering sequences. However, rather than using a single HMM or profile to expand the cluster, FlowerPower identifies subfamilies using the SCI-PHY algorithm and then selects and aligns new homologs using subfamily hidden Markov models. FlowerPower is shown to outperform BLAST, PSI-BLAST and the UCSC SAM-Target 2K methods at discrimination between proteins in the same domain architecture class and those having different overall domain structures.
Conclusion
Structural phylogenomic analysis enables biologists to avoid the systematic errors associated with annotation transfer; clustering sequences based on sharing the same domain architecture is a critical first step in this process. FlowerPower is shown to consistently identify homologous sequences having the same domain architecture as the query.
Availability
FlowerPower is available as a webserver at .
doi:10.1186/1471-2148-7-S1-S12
PMCID: PMC1796606  PMID: 17288570
19.  PhyloFacts: an online structural phylogenomic encyclopedia for protein functional and structural classification 
Genome Biology  2006;7(9):R83.
PhyloFacts, a structural phylogenomic database for protein functional and structural classification, is described.
The Berkeley Phylogenomics Group presents PhyloFacts, a structural phylogenomic encyclopedia containing almost 10,000 'books' for protein families and domains, with pre-calculated structural, functional and evolutionary analyses. PhyloFacts enables biologists to avoid the systematic errors associated with function prediction by homology through the integration of a variety of experimental data and bioinformatics methods in an evolutionary framework. Users can submit sequences for classification to families and functional subfamilies. PhyloFacts is available as a worldwide web resource from .
doi:10.1186/gb-2006-7-9-r83
PMCID: PMC1794543  PMID: 16973001
20.  Functional Classification Using Phylogenomic Inference 
PLoS Computational Biology  2006;2(6):e77.
doi:10.1371/journal.pcbi.0020077
PMCID: PMC1484587  PMID: 16846248

Results 1-20 (20)