Predicting genes for orphan metabolic activities using phylogenetic profiles
© Chen and Vitkup; licensee BioMed Central Ltd. 2006
Received: 1 September 2005
Accepted: 12 January 2006
Published: 15 February 2006
Homology-based methods fail to assign genes to many metabolic activities present in sequenced organisms. To suggest genes for these orphan activities we developed a novel method that efficiently combines local structure of a metabolic network with phylogenetic profiles. We validated our method using known metabolic genes in Saccharomyces cerevisiae and Escherichia coli. We show that our method should be easily transferable to other organisms, and that it is robust to errors in incomplete metabolic networks.
It is hard to overestimate the potential impact of accurate network reconstruction algorithms on systems biology. Accurate models of biological networks will be essential in diverse areas from genetics of common human diseases to synthetic biology. Current computational methods of metabolic network reconstruction can directly benefit from many decades of experimental biochemical studies [1, 2]. Available homology-based annotation methods assign metabolic functions to sequences by establishing sequence similarity to known enzymes. State of the art homology approaches use different types of sequence and structural similarity, such as the overall sequence homology [3–5], presence of conserved functional motifs and blocks , specific spatial positions of functional residues [7, 8], or a combination of the above . Unfortunately, in spite of the overall success, homology-based methods fail to annotate metabolic genes with poor homology to known enzymes. This has resulted in partially reconstructed metabolic networks, such as for Escherichia coli  and Saccharomyces cerevisiae .
The inability to annotate all enzymes using homology-based methods leaves members of metabolic pathways 'missing' . That is, although biochemical evidence may indicate that a certain group of reactions takes place in an organism, we do not know which genes encode the enzymes responsible for the catalyses. It is perhaps natural to call these 'missing' genes orphan metabolic activities, to emphasize the fact that certain metabolic activities are not assigned to any sequences. As suggested by Osterman et al. , we can classify orphan metabolic activities as 'local' or 'global'. Global orphan activities do not have a single representative sequence in any organism . In contrast, local orphan activities represent reactions for which we do not have a representative sequence in an organism of interest, although one or several sequences catalyzing the reaction may be known in other organisms. The problem of assigning sequences to orphan activities is conceptually conjugate to the problem of assigning activities (functions) to hypothetical sequences. Although progress in solving the former problem will necessarily improve solution of the latter, optimal methods and algorithms for these two problems may be different.
Several non-homology methods have been developed in order to establish functional links between proteins [14, 15]. These so-called context-based approaches include gene phylogenetic profiles (measuring co-occurrence of gene pairs across genomes) [16, 17], the protein fusion (Rosetta Stone) method (detecting fusion events between genes) [18–20], gene co-expression [21, 22], and conserved gene neighborhoods (measuring chromosomal co-localization between genes) [23–25]. It was demonstrated that the functional links generated by the context-based methods recover members of protein complexes, functional modules, molecular pathways and gene-phenotype relationships [26–28].
Previously, Osterman et al.  illustrated how context-based methods can be successfully used to fill the remaining gaps in the metabolic networks, while Green et al.  proposed a Bayesian method for identifying missing enzymes using primarily sequence homology and chromosomal proximity information. In contrast to Green, the approach reported here uses exclusively non-homology information. Consequently, our method should be particularly useful when the gene encoding the enzyme catalyzing a particular orphan function has little or no sequence similarity to any known enzymes.
Recently, we used mRNA co-expression data and local structure of a metabolic network to fill metabolic gaps in a partially reconstructed network of S. cerevisiae . Using exclusively co-expression information, for 20% of all metabolic reactions it was possible to rank a correct gene within the top 50 out of 5,594 candidate yeast genes.
In this study, we demonstrate that it is possible to significantly improve prediction of sequences responsible for orphan metabolic activities by using gene phylogenetic profiles. Importantly, in contrast to mRNA co-expression data, which are usually available only for several model organisms, phylogenetic profiles can be readily calculated for any sequenced organism. The accuracy of phylogenetic profiles will increase as genomic pipelines reveal more protein sequences. In comparison to previous studies that demonstrated that it is possible to cluster proteins from annotated biochemical pathways using phylogenetic profiles [17, 27, 30], our goal is significantly more specific in that we want to predict genes responsible for particular orphan activities. By directly taking into account the structure of a partially reconstructed metabolic network (for example, giving more weight to genes closer to a network gap) our method is able to combine the information of a 'known core' of the network with phylogenetic correlations to the remaining gaps. We show that our method is readily applicable to less-studied organisms with partially known metabolic networks.
Results and discussion
The main approach
The idea behind our method is similar to that used by us previously in the context of mRNA co-expression networks . We used a heuristic cost function to determine how a test gene 'fits' into a network gap. The 'fit' of a test gene in a network gap is determined by its phylogenetic correlations with network genes close to the gap. The parameters of the cost function were optimized to achieve the best predictive ability by minimizing the log sum of the ranks for all correct metabolic enzymes. Several functional forms of the cost function were tested (see Equations 1 to 3 below).
Equation 1 represents a cost function similar to the one used previously , where x is the candidate gene, n is a gene from the network neighborhood of the gap, c(x, n) is the phylogenetic correlation between genes x and n, is the vector of layer weights, and p1 is the power factor for the phylogenetic correlations. The summation in Equation 1 is, first, over all genes in a given layer N i around the gap and, second, over all layers up to the layer R. Only three layers around the network gaps were used in all calculations in the paper. |N| is the total number of genes in all three layers.
Equation 3 represents an exponential cost function, which is used to increase the sensitivity to differences between phylogenetic correlations. A set of new parameters (β i ) was introduced to account for different weighting of the exponent in different layers.
We found that the functions with connection specificity adjustment (Equations 2 and 3) significantly outperform the function without specificity adjustment (Equation 1). However, we found no difference in predictive power between Equation 2 and 3 (Additional data file 4). In the text below, unless otherwise specified, we present results obtained using Equation 2.
Self-consistent test and parameter optimization
The optimal values for the cost function parameters were determined by minimizing the log sum of the ranks of all known metabolic enzymes in their correct network positions (see Materials and methods). Two types of parameter optimization algorithm were used: a deterministic Nelder-Mead simplex algorithm  and a stochastic global optimization by simulated annealing (SA) . The best performance was obtained from the SA optimizations and is reported below.
The functional information present in the currently available phylogenetic profiles allows us to significantly improve the performance in comparison to a similar method based on gene co-expression. Using mRNA co-expression, we predicted 4.1%, 12.7% and 23.8% of the correct enzyme-encoding genes to be top ranked, within the top 10, and within the top 50, respectively . The improved performance reflects larger coverage of the available phylogenetic profiles, which can be calculated for many sequences in various genomes; in contrast, mRNA co-expression data are mostly available for model organisms and genes with significant mRNA expression changes. Another important improvement of the current approach is the use of the connection specificity adjustment. The specificity adjusted cost functions (Equations 2 and 3) predict 5% to 18% more correct genes within the top ranks compared to functions without specificity adjustment (Equation 1; Figure 3b).
It is interesting to investigate the relative contribution of different layers around a network gap to the cost function. As only the relative difference in layer weights impact the algorithm performance, the weight of the first layer was always set to 1. The best performance of the algorithm based on Equation 2 was achieved with the following weights for the second and third layers around the gap: w2 = 0.0085 (95% CI: 0.0051-0.0120) and w3 = 0.0024 (95% CI: 0.0011-0.0037). Smaller values for the weights w2 and w3 indicate that the phylogenetic correlations at the distances 2 and 3 from the gap are not as informative as the correlations of the first layer neighbors. But, as there are 5 and 13 times more genes in the second and third layers, respectively, their contribution to the cost function values is around 5% to 10% for the highly ranked genes and more than 10% for enzymes ranked between 200 and 600. As we show below, the contribution of the second and third layers roughly doubles for predictions on partially known networks.
Performance based on phylogenetic profiles generated using COG
As described in Materials and methods, BLAST searches were used in this work to calculate phylogenetic profiles. In contrast, a number of previous studies [27, 35] relied on the Cluster of Orthologous Groups (COG) database  to obtain phylogenetic profiles. We investigated the performance of our algorithm on COG-based phylogenetic profiles. Using the same algorithm and the COG-based profiles, we predicted 34.1%, 56.2% and 69.0% of the correct yeast metabolic genes to be the top ranked, within the top 10 and within the top 50, respectively. This indicates an improvement of about 50% over the results based on the BLAST searches; however, this result is unlikely to indicate superior performance. First, the current coverage of the COG database is significantly biased towards genes encoding known metabolic enzymes. For example, 72% (443 out of 615) of known metabolic genes have COG profiles while only 19% (1,148 out of 6,093) of non-metabolic genes have COG profiles. This bias leads to a significant overestimation of the 'real-world' performance of the COG-based profiles. Second, the COG database has a very limited set of hypothetical proteins, making it impractical to predict hypothetical genes responsible for orphan activities using COG.
Performance using hypotheticals as candidate genes
In practice, it is logical to test only hypothetical genes for orphan metabolic activities in a given organism. To simulate this for the yeast metabolic network, we repeated our self-consistent test procedure using only hypothetical yeast genes as gap candidates. We identified 1,514 hypothetical yeast open reading frames (ORFs) for this analysis. As the number of hypothetical genes is smaller than the total number of genes (usually 30% to 70% smaller), the performance of our method should improve. Indeed, testing only hypothetical genes improved the algorithm performance: 30.4%, 48.0% and 57.1% correct enzymes were ranked as the top 1, within the top 10 and within the top 50 among all candidate sequences, respectively (Figure 3c). We note that the observed 25% improvement in performance is not due to a better discrimination against hypothetical genes. Similar improvement was observed when a candidate set of 1,514 randomly selected genes with known functions was used (Additional data file 6).
Performance on the E. colimetabolic network
To understand the transferability of our approach to other organisms, we repeated our analysis using the E. coli metabolic network. The same procedures were used to construct the metabolic network for E. coli (see Materials and methods). First, the optimal parameters obtained for the S. cerevisiae metabolic network, without further modifications, were applied to rank E. coli metabolic genes. As a result, the algorithm predicts 13.3%, 30.0%, and 41.3.% of known E. coli metabolic genes to be top ranked, within the top 10 and within the top 50, respectively, out of 3,578 non-metabolic E. coli genes. Second, the simulated annealing optimization was performed to optimize the cost function specifically for the E. coli network. Based on the optimized parameters slightly better results were obtained: 18.0%, 33.8%, and 45.6% of the correct genes were ranked as the top candidate, within the top 10, and within the top 50, respectively (Figure 3d). The optimal E. coli parameters for the cost function are generally similar to the optimal parameters for the S. cerevisiae metabolic network. This suggests that parameters obtained on several model organisms can be directly used for predictions in other organisms, although an organism-specific optimization will slightly improve the algorithm performance.
Performance based on genes without independent homology information
Our prediction method is designed primarily for enzymatic activities without good homology information. Above, we validated the approach using all known metabolic enzymes from E. coli and S. cerevisiae. In addition, it is interesting to identify a set of enzymes for which independent homology information is not available (that is, the biochemical experiments have been conducted only in E. coli, for example) and test the performance on this subset.
We obtained a subset of E. coli enzymatic EC numbers without representative sequences in other organisms. The subset, identified using the SWISS-PROT database , includes EC numbers with representative sequences exclusively from E. coli. We also included EC numbers with representative sequences in the TrEMBL database (a computer-annotated complement to the SWISS-PROT), but only if these were computationally annotated from E. coli sequences and, consequently, cannot provide independent homology information. Each identified EC number was then manually checked.
Performance of our method with Escherichia coli orphan activities without independent sequence homology information
Fructose 6-phosphate aldolase
2,3-Dihydroxybenzoate adenylate synthase
Importance of the neighborhood
We found that an important feature that separates the informative and non-informative gaps is the availability of accurate phylogenetic correlations for the neighborhood genes around the gaps. Clearly, if accurate phylogenetic correlations cannot be calculated - because, for example, the corresponding genes exist only in several related genomes - the cost function will not be able to discriminate between correct and incorrect genes. Figure 4b illustrates this point by showing the relationship between the average phylogenetic correlation between the first layer genes and the fraction of well-predicted gaps. For gaps with a first layer correlation of at least 0.5, 95% of the correct genes are ranked within the top 50. In contrast, less than 20% of the correct genes are ranked within the top 50 if the average first layer correlation is below 0.1. In practice, the discrimination ratio can be used to estimate the predictive ability of different gaps.
Performance based on a partially known networks
The relative insensitivity of our method to the network completeness suggests that the algorithm based on phylogenetic profiles will be useful not only for metabolic networks of model organisms, such as S. cerevisiae and E. coli, but also for networks of less studied organisms.
Predictions for orphan activities in S. cerevisiae and E. coli
As the metabolic networks of E. coli and S. cerevisiae are relatively well studied, it is likely that the developed algorithm will be most useful in less studied species with a larger fraction of orphan metabolic activities. Nevertheless, we investigated in detail several predictions for orphan activities in the E. coli and S. cerevisiae networks.
Although considered as gaps in the originally reconstructed E. coli  and S. cerevisiae networks , a number of orphan activities have been recently identified. For example, the yeast enzyme 5-formyltetrahydrofolate cyclo-ligase (EC 220.127.116.11) appears as a gap in the network model by Forster et al. . However, the gene responsible for this activity, YER183C/FAU1, has been cloned and characterized by Holmes and Appling . This gene is present in the updated model by Duarte et al. . In the E. coli iJR904 model, the arabinose-5-phosphate isomerase (API, EC 18.104.22.168) is listed as an orphan activity. However, the yrbH/b3197 gene has been recently characterized as encoding the enzyme responsible for this metabolic reaction . Significantly, without any sequence homology information, our algorithm was able to rank the S. cerevisiae FAU1 gene and the E. coli yrbH gene as the number 10 and number 1 candidate, respectively, for their corresponding enzymatic activities. More examples for recently identified orphan activities and predictions can be found in Additional file 9.
Several orphan activities in S. cerevisiae and E. coli remain unassigned to any gene. We found several interesting predictions for the NAD+ dependent succinate-semialdehyde dehydrogenase (EC 22.214.171.124) in E. coli. E. coli seems to possess two different types of succinate semialdehyde dehydrogenases : one is NAD(P)+ dependent and is encoded by the b2661/gabD gene (EC 126.96.36.199); the other is specific for NAD+ only (EC 188.8.131.52). One E. coli gene, b1525/yneI, was predicted as the top candidate for this orphan activity. We believe yneI is a good candidate for the orphan activity because of the following additional functional clues. It has 32% sequence identity (E-value 5*10-61) to the other E. coli succinate semialdehyde dehydrogenase encoded by gabD and 30% sequence identity to the human enzyme ALDH5A1 (EC 184.108.40.206, E-value 7*10-59). In addition, yneI is adjacent on the bacterial chromosome to the gene yneH/glsA2/b3512, which encodes glutaminase 2 (EC 220.127.116.11). The gene yneH is involved in the same glutamate metabolism pathway as EC 18.104.22.168. The closeness of yneI and yneH on the chromosome suggests that they are involved in related functions.
We demonstrate in this work that genes encoding orphan metabolic activities can be effectively identified by integrating phylogenetic profiles with a partially known network. The reported approach is significantly more accurate in comparison to a similar method based on mRNA co-expression . We are able to predict five times more correct genes as the top candidates and two times more within the top 50 candidates out of about 6,000 unrelated yeast genes. It is likely that the improvement in performance reflects larger functional coverage of the available phylogenetic profiles over mRNA co-expression data. Indeed, the performances of the algorithms based on mRNA co-expression and phylogenetic profiles are similar when only well-perturbed network neighborhoods, the neighborhoods with large changes in gene expression, are considered.
The larger functional coverage of phylogenetic profiles allows our approach to be extended to organisms with no or little expression data. As we demonstrate, the optimized parameters are likely to be directly transferable between organisms. Importantly, the incompleteness of the currently available metabolic networks is not a major hindrance to the application of our algorithm.
The performance of our algorithm significantly improves if the specificity of the connections established by different metabolites is taken into consideration. To account for the connection specificity, the algorithm assigns smaller cost function weights to connections established by widely used (that is, non-specific) metabolites. Similar specificity corrections should be useful for calculations based on other context-based descriptors, such as mRNA expression.
Materials and methods
Construction of metabolic networks
While any metabolite can be used to establish connections between metabolic genes, common metabolites and cofactors, such as ATP, water or hydrogen, are not likely to connect genes with similar metabolic functions. Indeed, the performance of our algorithm on the network in which all connections were present was significantly worse than on the network in which highly connected metabolites were excluded . In order to determine an exclusion threshold, we gradually removed the most highly connected metabolites while monitoring the overall performances of the algorithm. We found that the best performance was achieved when the 15 most highly connected metabolites were excluded from the network reconstruction. Exclusion of more than the 15 most connected metabolites increases prediction accuracy by a slight margin, although the coverage of metabolic genes in the network is reduced significantly. For instance, 20% and 50% metabolic genes lost all their network connections when 120 and 240 most frequent metabolites were excluded, respectively, while the network retains more than 99% of all metabolic genes when only the 15 most frequent metabolites were excluded. The results presented in this paper are thus based on the metabolic network constructed without these 15 most frequent metabolites: ATP, ADP, AMP, CO2, CoA, glutamate, H, NAD, NADH, NADP, NADPH, NH3, GLC, orthophosphate and pyrophosphate.
The reconstructed yeast network contains 615 known metabolic genes and 230 orphan activities. On average, a metabolic gene has 15.8, 76.2 and 200.0 neighbors on its first, second and third layers in the neighborhood, respectively. The average distance between a pair of metabolic genes in the yeast network (network radius) is 3.48. In a similar manner as for S. cerevisiae, we constructed the metabolic network for E. coli from the iJR904 model by Reed et al. . Again, the 15 most frequent metabolites were excluded. The E. coli network contains 613 known metabolic enzymes and 136 orphan activities with a network radius of 3.81.
Phylogenetic profile measures
Binary phylogenetic profiles
We constructed phylogenetic profiles for all 6,708 S. cerevisiae and 4,199 E. coli ORFs using automated BLAST searches against a collection of 70 prokaryotic and eukaryotic genomes (Additional data file 1). Our collection of genomes is similar to the one used by Bowers et al. . We deliberately filtered evolutionarily similar genomes. To calculate phylogenetic profile correlations between genes we used a 70-dimensional binary vector representing presence or absence of homologs of a target yeast or E. coli gene in query genomes. The Pearson's correlation between the profile vectors (31) was calculated using Equation 4:
where N is the total number of the lineages considered. For genes X and Y, x is the number of times X occurs in the N lineages, y is the number of times Y occurs in the N lineages, and z is the number of times X and Y occur together.
Naturally, our calculations of phylogenetic profiles rely on the BLAST E-value threshold used for considering protein homology of target genes. In the study by Bower et al. an E-value of 10-10 was used . We tried different E-value cutoffs (10-2 to 10-12) looking for the best algorithm performance. We found that an E-value of 10-3 gave significantly better results in comparison with either more (10-10) or less stringent (10-2) thresholds; 3 and 5 times better, respectively. In this report, unless otherwise specified, the binary phylogenetic profile correlations were calculated using E = 10-3 as the homology threshold.
Normalized phylogenetic profiles and mutual information
Date et al.  introduced the use of normalized phylogenetic profiles to infer functional associations. Instead of using a predetermined E-value threshold to determine the presence of a homolog for a protein i in a genome j, they proposed using the value -1/logE ij , where E ij is the BLAST E-value of the top-scoring sequence alignment hit for the target protein i in the query genome j. In this way different degrees of sequence divergence are captured without a predefined cutoff. We calculated the Pearson's correlation coefficients between the normalized phylogenetic profiles for all S. cerevisiae and E. coli genes.
The study by Wu et al. , together with the study by Date et al. , also suggested using mutual information (MI) to assess protein functional association. We calculated MI according to Equation 5:
MI(A, B) = H(A) + H(B) - H(A, B) (5)
where H(A) = -∑p(a)lnp(a) represents the marginal entropy of the probability distribution p(a) of gene A of occurring among all query genomes and H(A, B) = -∑p(a, b)lnp(a, b) represents the relative entropy of the joint probability distribution p(a, b) of the genes A and B occurring across all the query genomes used in this study. Two sets of MI, based on the binary and normalized phylogenetic profiles described above, were generated and used in our prediction.
We tested the effect of normalized phylogenetic profiles as well as mutual information in our algorithm but did not detect any significant improvements compared to binary profiles (Additional data file 8). Since the procedure of generating binary phylogenetic profiles is more straightforward, in this report, unless otherwise specified, we use the correlations generated using binary phylogenetic profiles (E = 10-3).
COG-based phylogenetic profile
In addition to using BLAST searches to generate phylogenetic profiles, we also utilize the COG database  as the source of orthology information to create phylogenetic profiles. We used the January 2005 version of the COG database consisting of 44 genomes. We consider that an ortholog of a target ORF exists in a query genome if a sequence from that genome co-occurs in the same COG as the target gene. Based on the COG orthology information, a binary phylogenetic profile string was calculated for each gene and pair-wise correlations were calculated using Equation 4.
Cost function optimization
Two methods were used to optimize the parameters of the cost functions. First, following our previous analysis , the layer weights were optimized using the Nelder-Mead simplex algorithm . The simplex optimization usually took 6 to 8 hours to converge on a Dell PowerEdge 1750 with Dual CPUs at 2.8 GHz and 2 GB DDR SDRAM memory. We usually carried out the simplex optimizations starting from many (10 to 15) randomly chosen starting points to check the sensitivity towards initial conditions. Second, because the simplex algorithm is deterministic and may miss a global parameter minimum, we also used a global SA algorithm . We used the SA algorithm to optimize all parameters used in the cost functions, including the layer weights and the power factors for both phylogenetic correlations and connection specificities. Several annealing schedules were tried. Naturally, the SA algorithm took much longer (usually >20 hours on the same machine) to converge.
Using the SA optimization we obtained lower average ranks for correct metabolic genes and thus better overall performance. For this reason, the results reported in the paper are based on the SA optimization. However, we want to point out that these two algorithms (SA and the simplex) have comparable performance on highly ranked genes (ranked 1 to 100; Additional data file 3). Since our ultimate goal is to generate a list of highly probable candidates for orphan activities to be tested experimentally, the number of candidate genes for each gap should probably not exceed 50 to 100. Thus, the simplex algorithm, although not optimal, is probably sufficient for this purpose.
We carried out a ten-fold cross-validation to estimate the accuracy of our method and generalization errors. The set of the known enzymes was randomly split into ten groups. One such group of enzymes was left out each time and designated as the test group. We then trained our method on the remaining 90% of the enzymes and used the obtained parameters to evaluate the performance on the test group.
Performance on partially known network
To evaluate the performance on incomplete metabolic networks, we deliberately deleted up to 50% of the enzyme nodes in the S. cerevisiae metabolic network. The deleted nodes were added to the candidate gene set, and the performance of the algorithm was evaluated using the incomplete network. This experiment was repeated ten times and the results averaged.
Additional data files
The following additional data are available with the online version of this paper. Additional data file 1 is a table showing the genomes used in this study to generate phylogenetic profiles. Additional data file 2 is a table showing the effect of connection specificity adjustment. Additional data file 3 is a figure comparing the performance of the simplex and simulated annealing algorithms. Additional data file 4 is a figure comparing the predictions based on Equations 2 and 3. Additional data file 5 is a figure showing 10-fold cross-validation of the algorithm. Additional data file 6 is a figure comparing the predictions based on all yeast non-metabolic genes as the candidate gene set, all hypothetical genes or a randomly selected subset of yeast non-metabolic genes. Additional data file 7 is a figure showing context-based association as a function of metabolic network distance in E. coli. Additional data file 8 compares predictions based on normalized gene phylogenetic profiles, mutual information, and the method reported in the paper. Additional data file 9 is a dataset of sample predictions for E. coli and S. cerevisiae orphan activities.
We thank Drs Peter Kharchenko and Andrey Rzhetsky for valuable discussions. We also thank anonymous reviewers for helpful suggestions.
- Krieger CJ, Zhang P, Mueller LA, Wang A, Paley S, Arnaud M, Pick J, Rhee SY, Karp PD: MetaCyc: a multiorganism database of metabolic pathways and enzymes. Nucleic Acids Res. 2004, D438-442. 10.1093/nar/gkh100. 32 DatabaseGoogle Scholar
- Schomburg I, Chang A, Ebeling C, Gremse M, Heldt C, Huhn G, Schomburg D: BRENDA, the enzyme database: updates and major new developments. Nucleic Acids Res. 2004, D431-433. 10.1093/nar/gkh081. 32 DatabaseGoogle Scholar
- Rost B: Enzyme function less conserved than anticipated. J Mol Biol. 2002, 318: 595-608. 10.1016/S0022-2836(02)00016-5.PubMedView ArticleGoogle Scholar
- Tian W, Skolnick J: How well is enzyme function conserved as a function of pairwise sequence identity?. J Mol Biol. 2003, 333: 863-882. 10.1016/j.jmb.2003.08.057.PubMedView ArticleGoogle Scholar
- Wilson CA, Kreychman J, Gerstein M: Assessing annotation transfer for genomics: quantifying the relations between protein sequence, structure and function through traditional and probabilistic scores. J Mol Biol. 2000, 297: 233-249. 10.1006/jmbi.2000.3550.PubMedView ArticleGoogle Scholar
- Henikoff JG, Pietrokovski S, Henikoff S: Recent enhancements to the Blocks Database servers. Nucleic Acids Res. 1997, 25: 222-225. 10.1093/nar/25.1.222.PubMedPubMed CentralView ArticleGoogle Scholar
- Fetrow JS, Skolnick J: Method for prediction of protein function from sequence using the sequence-to-structure-to-function paradigm with application to glutaredoxins/thioredoxins and T1 ribonucleases. J Mol Biol. 1998, 281: 949-968. 10.1006/jmbi.1998.1993.PubMedView ArticleGoogle Scholar
- Wallace AC, Borkakoti N, Thornton JM: TESS: a geometric hashing algorithm for deriving 3D coordinate templates for searching structural databases. Application to enzyme active sites. Protein Sci. 1997, 6: 2308-2323.PubMedPubMed CentralView ArticleGoogle Scholar
- Tian W, Arakaki AK, Skolnick J: EFICAz: a comprehensive approach for accurate genome-scale enzyme function inference. Nucleic Acids Res. 2004, 32: 6226-6239. 10.1093/nar/gkh956.PubMedPubMed CentralView ArticleGoogle Scholar
- Reed JL, Vo TD, Schilling CH, Palsson BO: An expanded genome-scale model of Escherichia coli K-12 (iJR904 GSM/GPR). Genome Biol. 2003, 4: R54-10.1186/gb-2003-4-9-r54.PubMedPubMed CentralView ArticleGoogle Scholar
- Forster J, Famili I, Fu P, Palsson BO, Nielsen J: Genome-scale reconstruction of the Saccharomyces cerevisiae metabolic network. Genome Res. 2003, 13: 244-253. 10.1101/gr.234503.PubMedPubMed CentralView ArticleGoogle Scholar
- Osterman A, Overbeek R: Missing genes in metabolic pathways: a comparative genomics approach. Curr Opin Chem Biol. 2003, 7: 238-251. 10.1016/S1367-5931(03)00027-9.PubMedView ArticleGoogle Scholar
- Karp PD: Call for an enzyme genomics initiative. Genome Biol. 2004, 5: 401-10.1186/gb-2004-5-8-401.PubMedPubMed CentralView ArticleGoogle Scholar
- Bork P, Jensen LJ, von Mering C, Ramani AK, Lee I, Marcotte EM: Protein interaction networks from yeast to human. Curr Opin Struct Biol. 2004, 14: 292-299. 10.1016/j.sbi.2004.05.003.PubMedView ArticleGoogle Scholar
- Eisenberg D, Marcotte EM, Xenarios I, Yeates TO: Protein function in the post-genomic era. Nature. 2000, 405: 823-826. 10.1038/35015694.PubMedView ArticleGoogle Scholar
- Huynen MA, Bork P: Measuring genome evolution. Proc Natl Acad Sci USA. 1998, 95: 5849-5856. 10.1073/pnas.95.11.5849.PubMedPubMed CentralView ArticleGoogle Scholar
- Pellegrini M, Marcotte EM, Thompson MJ, Eisenberg D, Yeates TO: Assigning protein functions by comparative genome analysis: protein phylogenetic profiles. Proc Natl Acad Sci USA. 1999, 96: 4285-4288. 10.1073/pnas.96.8.4285.PubMedPubMed CentralView ArticleGoogle Scholar
- Enright AJ, Iliopoulos I, Kyrpides NC, Ouzounis CA: Protein interaction maps for complete genomes based on gene fusion events. Nature. 1999, 402: 86-90. 10.1038/47056.PubMedView ArticleGoogle Scholar
- Marcotte EM, Pellegrini M, Ng HL, Rice DW, Yeates TO, Eisenberg D: Detecting protein function and protein-protein interactions from genome sequences. Science. 1999, 285: 751-753. 10.1126/science.285.5428.751.PubMedView ArticleGoogle Scholar
- Yanai I, Derti A, DeLisi C: Genes linked by fusion events are generally of the same functional category: a systematic analysis of 30 microbial genomes. Proc Natl Acad Sci USA. 2001, 98: 7940-7945. 10.1073/pnas.141236298.PubMedPubMed CentralView ArticleGoogle Scholar
- DeRisi JL, Iyer VR, Brown PO: Exploring the metabolic and genetic control of gene expression on a genomic scale. Science. 1997, 278: 680-686. 10.1126/science.278.5338.680.PubMedView ArticleGoogle Scholar
- Wu LF, Hughes TR, Davierwala AP, Robinson MD, Stoughton R, Altschuler SJ: Large-scale prediction of Saccharomyces cerevisiae gene function using overlapping transcriptional clusters. Nat Genet. 2002, 31: 255-265. 10.1038/ng906.PubMedView ArticleGoogle Scholar
- Dandekar T, Snel B, Huynen M, Bork P: Conservation of gene order: a fingerprint of proteins that physically interact. Trends Biochem Sci. 1998, 23: 324-328. 10.1016/S0968-0004(98)01274-2.PubMedView ArticleGoogle Scholar
- Lee JM, Sonnhammer EL: Genomic gene clustering analysis of pathways in eukaryotes. Genome Res. 2003, 13: 875-882. 10.1101/gr.737703.PubMedPubMed CentralView ArticleGoogle Scholar
- Overbeek R, Fonstein M, D'Souza M, Pusch GD, Maltsev N: The use of gene clusters to infer functional coupling. Proc Natl Acad Sci USA. 1999, 96: 2896-2901. 10.1073/pnas.96.6.2896.PubMedPubMed CentralView ArticleGoogle Scholar
- Bowers PM, Pellegrini M, Thompson MJ, Fierro J, Yeates TO, Eisenberg D: Prolinks: a database of protein functional linkages derived from coevolution. Genome Biol. 2004, 5: R35-10.1186/gb-2004-5-5-r35.PubMedPubMed CentralView ArticleGoogle Scholar
- von Mering C, Zdobnov EM, Tsoka S, Ciccarelli FD, Pereira-Leal JB, Ouzounis CA, Bork P: Genome evolution reveals biochemical networks and functional modules. Proc Natl Acad Sci USA. 2003, 100: 15428-15433. 10.1073/pnas.2136809100.PubMedPubMed CentralView ArticleGoogle Scholar
- Korbel JO, Doerks T, Jensen LJ, Perez-Iratxeta C, Kaczanowski S, Hooper SD, Andrade MA, Bork P: Systematic association of genes to phenotypes by genome and literature mining. PLoS Biol. 2005, 3: e134-10.1371/journal.pbio.0030134.PubMedPubMed CentralView ArticleGoogle Scholar
- Green ML, Karp PD: A Bayesian method for identifying missing enzymes in predicted metabolic pathway databases. BMC Bioinformatics. 2004, 5: 76-10.1186/1471-2105-5-76.PubMedPubMed CentralView ArticleGoogle Scholar
- Wu J, Kasif S, DeLisi C: Identification of functional links between genes using phylogenetic profiles. Bioinformatics. 2003, 19: 1524-1530. 10.1093/bioinformatics/btg187.PubMedView ArticleGoogle Scholar
- Kharchenko P, Vitkup D, Church GM: Filling gaps in a metabolic network using expression information. Bioinformatics. 2004, 20 (Suppl 1): I178-I185. 10.1093/bioinformatics/bth930.PubMedView ArticleGoogle Scholar
- Kharchenko P, Church GM, Vitkup D: Expression dynamics of a cellular metabolic network. Mol Systems Biol. 2005, doi:10.1038/msb4100023.Google Scholar
- Nelder JA, Mead R: A simplex method for function minimization. Comput J. 1965, 7: 308-313.View ArticleGoogle Scholar
- Kirkpatrick S, Gelatt CD, Vecchi MP: Optimization by simulated annealing. Science. 1983, 220: 671-680.PubMedView ArticleGoogle Scholar
- von Mering C, Jensen LJ, Snel B, Hooper SD, Krupp M, Foglierini M, Jouffre N, Huynen MA, Bork P: STRING: known and predicted protein-protein associations, integrated and transferred across organisms. Nucleic Acids Res. 2005, D433-437. 33 DatabaseGoogle Scholar
- Tatusov RL, Fedorova ND, Jackson JD, Jacobs AR, Kiryutin B, Koonin EV, Krylov DM, Mazumder R, Mekhedov SL, Nikolskaya AN, et al: The COG database: an updated version includes eukaryotes. BMC Bioinformatics. 2003, 4: 41-10.1186/1471-2105-4-41.PubMedPubMed CentralView ArticleGoogle Scholar
- Apweiler R, Bairoch A, Wu CH, Barker WC, Boeckmann B, Ferro S, Gasteiger E, Huang H, Lopez R, Magrane M, et al: UniProt: the Universal Protein knowledgebase. Nucleic Acids Res. 2004, D115-119. 10.1093/nar/gkh131. 32 DatabaseGoogle Scholar
- Holmes WB, Appling DR: Cloning and characterization of methenyltetrahydrofolate synthetase from Saccharomyces cerevisiae. J Biol Chem. 2002, 277: 20205-20213. 10.1074/jbc.M201242200.PubMedView ArticleGoogle Scholar
- Duarte NC, Herrgard MJ, Palsson BO: Reconstruction and validation of Saccharomyces cerevisiae iND750, a fully compartmentalized genome-scale metabolic model. Genome Res. 2004, 14: 1298-1309. 10.1101/gr.2250904.PubMedPubMed CentralView ArticleGoogle Scholar
- Meredith TC, Woodard RW: Escherichia coli YrbH is a D-arabinose 5-phosphate isomerase. J Biol Chem. 2003, 278: 32771-32777. 10.1074/jbc.M303661200.PubMedView ArticleGoogle Scholar
- Donnelly MI, Cooper RA: Two succinic semialdehyde dehydrogenases are induced when Escherichia coli K-12 Is grown on gamma-aminobutyrate. J Bacteriol. 1981, 145: 1425-1427.PubMedPubMed CentralGoogle Scholar
- Date SV, Marcotte EM: Discovery of uncharacterized cellular systems by genome-wide analysis of functional linkages. Nat Biotechnol. 2003, 21: 1055-1062. 10.1038/nbt861.PubMedView ArticleGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.