Correct classification of genes into gene families is important for understanding gene function and evolution. Although gene families of many species have been resolved both computationally and experimentally with high accuracy, gene family classification in most newly sequenced genomes has not been done with the same high standard. This project has been designed to develop a strategy to effectively and accurately classify gene families across genomes. We first examine and compare the performance of computer programs developed for automated gene family classification. We demonstrate that some programs, including the hierarchical average-linkage clustering algorithm MC-UPGMA and the popular Markov clustering algorithm TRIBE-MCL, can reconstruct manual curation of gene families accurately. However, their performance is highly sensitive to parameter setting, i.e. different gene families require different program parameters for correct resolution. To circumvent the problem of parameterization, we have developed a comparative strategy for gene family classification. This strategy takes advantage of existing curated gene families of reference species to find suitable parameters for classifying genes in related genomes. To demonstrate the effectiveness of this novel strategy, we use TRIBE-MCL to classify chemosensory and ABC transporter gene families in C. elegans and its four sister species. We conclude that fully automated programs can establish biologically accurate gene families if parameterized accordingly. Comparative gene family classification finds optimal parameters automatically, thus allowing rapid insights into gene families of newly sequenced species.
Citation: Frech C, Chen N (2010) Genome-Wide Comparative Gene Family Classification. PLoS ONE 5(10): e13409. https://doi.org/10.1371/journal.pone.0013409
Editor: Robert DeSalle, American Museum of Natural History, United States of America
Received: June 9, 2010; Accepted: September 21, 2010; Published: October 15, 2010
Copyright: © 2010 Frech, Chen. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: This study is supported by a NSERC (Canada) Discovery Grant (to NC). NC is a Michael Smith Foundation for Health Research (MSFHR) Scholar and a Canadian Institutes of Health Research (CIHR) New Investigator. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
There are more than 20,000 protein-coding genes in a typical metazoan genome . Although genes differ in sequence, size, and functional domains, they can be grouped into families based on their homology . Genes of the same family usually share similar sequences, functional domains, and even interacting partners. While some gene families are more dynamic in evolution and show species-specific gene members, others are more conserved and found in distantly related species or even across complete kingdoms of life. For example, RFX transcription factors can be found in all mammalian species and each species has exactly seven RFX genes . In contrast, the srz chemosensory gene family has different sizes in closely related Caenorhabditis species .
Gene family classification, i.e. the grouping of genes or proteins into families, often yields important insights into gene evolution and gene function , . Indeed, arguably the first task biologists do after having cloned a new gene is to examine whether it belongs to a predefined gene family. Ever since the first protein database was established in the 1970s, grant efforts have been made to classify proteins into families for insight into their functional significance. As a result, a large number of gene families, such as the glutamate receptor family , the ABC transporter family , and many gene families of the G-protein coupled receptor (GPCR) superfamily , have been curated primarily experimentally. While the accurate definition of gene families is pivotal for their functional studies, it is very demanding to curate gene families in all sequenced genomes, which often carry similar but different gene families. Thus, automatic classification of gene families is highly desirable.
Necessitated by tens of thousands of genes revealed by genome sequencing projects like the Human Genome Project , , many sequence-based methods for automated gene family classification have been developed within the last 20 years. These methods can be divided into three major categories. The first category use phylogenetic trees to infer gene families. Phylogenetic tree construction is not easily automated and computationally expensive, which limits its application for genome-wide gene family classification, although recently tree-based methods have been successfully scaled up to multi-genome data sets –. Methods of the second category group genes according to similarities with known sequence signatures like motifs or domains. Sequence signatures are typically derived from manually curated multiple sequence alignments and stored in public databases, such as PROSITE , Pfam , or SMART . Signature-based methods are routinely used for gene function annotation, but, depending on the method, have different limitations, for example the correct resolution of gene family substructures or the classification of gene families with yet uncharacterized motifs or domains . Methods of the third category, which are in the focus of this project, are based on pairwise comparisons of full-length protein sequences and typically involve the use of clustering techniques , . Clustering methods can be applied to classify many sequences in short time, in an automated manner, and most importantly, with reasonable accuracy . Although clustering programs for gene family classification can perform reasonably well in generating gene families, they need to be parameterized for optimal performance. For example, in TRIBE-MCL , the inflation value is an important parameter that controls cluster granularity and thus gene family size. However, how to find the right inflation value for the correct resolution of gene families is not intuitively clear. Thus, strategies for using TRIBE-MCL range from simply using program defaults  or arbitrary user-defined values  to the generation of multiple classifications using different parameter values  and the use of parameter values found to be globally optimal with respect to some empirical quality measure . It is expected that different gene families require different cluster granularities for correct resolution. Consequently, neither of the above strategies ensures the quality of classified gene families.
In this paper, we first demonstrate how parameters impact the outcome of clustering-based gene family classification programs, using two sets of highly curated Caenorhabditis elegans gene families, the chemosensory and the ABC transporter gene families as example. We find that many programs can indeed achieve very accurate results, but their performance requires careful fine-tuning of parameters to both gene families and data set size. We propose a novel strategy called comparative gene family classification, which takes advantage of the existing gene family classification knowledge by automatically calibrating program parameters on reference gene families from well-studied species to classify genes of the same families in related, newly sequenced species. Finally, the effectiveness of this approach is demonstrated by classifying chemosensory and ABC transporter genes across all five sequenced Caenorhabditis species and some practical guidelines are given to users interested in comparative gene family classification.
To appreciate the performance of gene family classification programs, we obtained all published programs for which a stand-alone version was available. Altogether, among 20 published methods, eight were downloaded from websites , –, while two programs were requested from developers , . Of these 10 programs, three were excluded from further analysis because they do not scale well and could not finish the analysis in time (>20 days on one desktop computer) , the program is no longer maintained for newer operating systems (Fedora Core 7, kernel 18.104.22.168–88, gcc 4.1.2) , or the program requires a license . Thus, the following seven programs were selected for performance assessment (Table 1): TRIBE-MCL , gSPC , CLUSS , FORCE , MC-UPGMA , HomoClust , and BLASTClust .
Gene family classification performance was tested using two C. elegans gene families that have been extensively curated. The first data set comprises the 22 C. elegans chemosensory gene families (Table S1). Chemosensory genes play an important role in the chemosensation of soil nematodes and constitute the largest known gene superfamily in C. elegans with about 1,300 putatively functional genes . Chemosensory genes belong to the broader class of G protein-coupled receptors (GPCRs) and share the universal characteristic of a seven transmembrane domain (7-TM) structure . Chemosensory gene families in C. elegans have undergone extensive bioinformatics analysis. Indeed, all chemosensory gene families in C. elegans have been extensively and manually curated by many groups in the last decade , , –. Twenty-two different C. elegans chemosensory gene families have been curated, ranging from the large srh and str families that comprise about 200 putative functional genes ,  to the single-gene family srn . Comparative analysis of chemosensory genes in C. elegans and C. briggsae suggests that chemosensory genes are very dynamic in evolution and many genes are species-specific. The second data set consists of the eight C. elegans ABC transporter gene families (Table S2). In contrast to the actively evolving chemosensory gene families, ABC transporter gene families are highly conserved and are found in many species. These genes are mostly involved in substrate transport across membranes. ABC transporters are classified into eight families (A to H) based on number and order of transmembrane and ATP-binding domains . In C. elegans, 60 ABC transporter genes have been identified , .
Gene family classification programs successfully reconstruct curated classifications
We tested these seven programs for their ability to reconstruct the classification of both chemosensory genes and ABC transporter genes. Each program was run with the complete C. elegans proteome (WS180) as input, which contains 20,140 protein products. Only the longest isoform for each gene was classified, since different isoforms belong to the same gene family. To allow for a fair performance assessment, all programs except CLUSS were provided with an identical pair-wise protein sequence similarity matrix for clustering. We computed pair-wise similarities in an all-vs-all BLAST search with an E-value cut-off value of 1e-10. CLUSS implements an alignment-independent similarity measure  and therefore was run directly with the C. elegans protein sequences as input. To achieve the best performance for both chemosensory gene families and ABC transporter gene families for each program, we systematically tested a range of different parameters (see Materials and Methods). The best result was considered as those that gave the best overlap with all gene families in a reference data set in terms of the highest weighted average Jaccard index  (Figure S1). The Jaccard index accounts for both sensitivity and specificity of a classification result and was used previously for performance evaluation , , .
For the chemosensory genes, three programs, MC-UPGMA, TRIBE-MCL, and gSPC, reproduce the manual classification with high quality and clearly outperform other programs (Figure 1). In particular, MC-UPGMA performs best on the chemosensory gene data set (weighted average Jaccard index = 0.85), followed by TRIBE-MCL (0.84), gSPC (0.83), FORCE (0.76), HomoClust and BLASTClust (both 0.70). CLUSS performs poorly on chemosensory genes, with a weighted average Jaccard index of 0.50. For the ABC transporter genes, four programs, HomoClust, MC-UPGMA, TRIBE-MCL, and BLASTClust, clearly outperform others (Figure 2). The best result is achieved by HomoClust, which groups ABC transporter genes almost perfectly (weighted average Jaccard index 0.99). HomoClust is followed by MC-UPGMA (0.97), TRIBE-MCL (0.93), BLASTClust (0.92), gSPC (0.82), FORCE (0.46), and CLUSS (0.24). Thus, we conclude from this analysis that fully automated computer programs can fairly faithfully reconstruct most of the highly curated chemosensory and ABC transporter gene families.
MC-UPGMA shows best performance on average, closely followed by TRIBE-MCL and gSPC. For each method, the complete C. elegans proteome (WS180, 20,140 proteins) was clustered with different parameters, and the result with the highest weighted average Jaccard index over all 22 chemosensory gene families is shown here. Filled circles correspond to adjacent Jaccard indices: full = Jac >0.75; three-quarter = Jac >0.5; half = Jac >0.25; quarter = Jac >0.1; empty = Jac ≤0.1. Avg refers to the unweighted average (arithmetic mean) of family-specific performance values, and Weighted Avg refers to averages weighted by family size. Abbreviations: Sensitivity (Sen); Specificity (Spe); Jaccard index (Jac).
HomoClust performs best in terms of weighted average Jaccard index, closely followed by MC-UPGMA and TRIBE-MCL. Classification procedure was the same as in Figure 1, except that program parameters were optimized for ABC transporter gene families. Legend and abbreviations as in Figure 1.
Considering classification results on chemosensory genes (Figure 1) and on ABC transporter genes (Figure 2) together, we can see that certain programs tend to outperform others. In particular, MC-UPGMA and TRIBE-MCL give good results on both reference sets. For chemosensory genes, MC-UPGMA performs significantly better than FORCE (p = 0.033, one-sided paired t-test), HomoClust (p = 0.001), BLASTClust (p = 0.001), and CLUSS (p = 2.1e-7). TRIBE-MCL significantly outperforms BLASTClust (p = 0.044) and CLUSS (p = 1.5e-6). For ABC transporter genes, both MC-UPGMA and TRIBE-MCL significantly outperform FORCE (p = 0.0048 and 0.02, respectively) and CLUSS (p = 5.6e-7 and 7.7e-5, respectively). TRIBE-MCL and MC-UPGMA perform similarly well on both data sets (chemosensory genes: p = 0.27; ABC transporter genes: p = 0.184). 13 chemosensory gene families are grouped equally well by both methods, six (including the single-gene family srn) are grouped slightly better by MC-UPGMA, and three are grouped slightly better by TRIBE-MCL (Figure 1). Four chemosensory gene families (srg, srj, srv, and str) remain poorly grouped by both MC-UPGMA and TRIBE-MCL, from which one gene family (srv) represents a challenge for all evaluated methods (see Text S1 as well as Figure S2 and Figure S3). TRIBE-MCL tends to produce larger clusters that contain more than one gene family, as is exemplified by the chemosensory single-gene family srn, which is grouped together with the large srh family. Similarly, TRIBE-MCL grouped the two ABC transporter gene families G and H together.
Overall, both MC-UPGMA and TRIBE-MCL can fairly faithfully reconstruct most chemosensory and ABC transporter gene families. In addition, these two methods perform better than others on two very different data sets. In the following experiments, we will use MC-UPGMA and TRIBE-MCL to illustrate the idea that parameter tuning of gene family classification programs is essential for their performance.
Program parameters need tuning for different gene families
Although MC-UPGMA and TRIBE-MCL nicely reproduce manually curated gene families from both data sets, quite different parameters were required to achieve optimal performance. For chemosensory genes, MC-UPGMA performs best if the cluster hierarchy (the tree) is cut at E-value 9.6. TRIBE-MCL achieves best results on the same data set with inflation value 1.2. In contrast, for ABC transporter gene families, the optimal tree cut-off value for MC-UPGMA is at E-value 1e-14, and the optimal inflation value for TRIBE-MCL is 2.6.
The performance of both programs deteriorates if we use parameters tuned for one data set for classifying the respective other (Figure 3). The weighted average Jaccard index for MC-UPGMA drops from 0.85 to 0.42 on chemosensory genes and from 0.97 to 0.31 on ABC transporter genes. Similarly, TRIBE-MCL drops from 0.84 to 0.75 on chemosensory genes and from 0.93 to 0.31 on ABC transporter genes. Clearly, there is no single parameter set that performs well on both data sets, which suggests that the performance of both programs depends on the tuning of parameters for different types of gene families.
The left panel shows classification performance achieved by MC-UPGMA on both chemosensory genes and ABC transporters if parameters optimal for chemosensory genes (grey bars; tree-cutoff = 9.6) and ABC transporters (black bars; tree-cutoff = 1e-14) are used. The right panel shows the same for TRIBE-MCL, with grey bars and black bars corresponding to inflation values of 1.2 and 2.6, respectively. For both programs performance drops significantly if parameters are optimized on the respective other data set.
Performance of gene family classification programs also depends on data set size
The performance of gene family classification programs depends not only on gene families, but also on the size of the data set. This phenomenon becomes evident when we run MC-UPGMA and TRIBE-MCL on a larger data set consisting of proteomes of five nematode species, including C. elegans, C. briggsae, C. remanei, C. japonica, and C. brenneri (130,208 proteins in total).
Using MC-UPGMA with parameters optimal for classifying chemosensory genes in the C. elegans data set only, we observe a drop in performance when classifying the same genes in the context of the larger, five-species data set (Figure 4). The weighted average Jaccard index drops from 0.85 to 0.75 (p = 0.016, one-sided paired t-test). For example, the chemosensory gene family sre is now split into two families, one with 15 sre genes and the other with 38 genes. Similarly, gene family srsx classified almost perfectly on the C. elegans-only data set before (Jaccard index 0.97) is now roughly split into half, with 17 srsx genes in one family and 19 in the other. The performance decrease of MC-UPGMA is even more pronounced on ABC transporters, where the average weighted Jaccard index drops from 0.97 to 0.73 (p = 0.009, one-sided paired t-test) on the five-species data set. A similar problem is observed for TRIBE-MCL, which drops in performance from 0.84 to 0.74 on chemosensory genes (p = 0.146, one-sided paired t-test), and from 0.97 to 0.89 on ABC transporter genes (p = 0.052).
Left and right panel show the best classification performance achieved by MC-UPGMA and TRIBE-MCL, respectively, if clustering is performed on the C. elegans proteome in isolation (white bars), on the Caenorhabditis five-species data set with unchanged parameters (grey bars), and on the Caenorhabditis five-species data set with readjusted parameters (black bars). Optimal clustering parameters shown within bars. A range of parameter values indicates that multiple parameter settings achieved equal top performance. Note that for this comparison we treated the BLAST E-value threshold used for filtering protein sequence similarities prior to classification as an additional parameter that was allowed to vary (between 1e-50 and 0.1).
However, the lower performance of both programs can be improved by further parameter tuning for both types of genes. After readjusting program parameters to the larger data set, the performance of both programs, MC-UPGMA and TRIBE-MCL, improves to similar levels as seen before on the C. elegans proteome (Figure 4).
Comparative gene family classification—proposing a new gene classification strategy
We have demonstrated that fully automated programs for gene family classification can reproduce curated gene families. However, program parameters are critical for classification performance and need tuning for optimal results. Since there is no “one-parameter-fits-all” strategy in gene family classification, and optimal parameters are not known a priori, how should we use gene family classification programs?
Here, we propose a comparative gene family classification strategy that takes advantage of the availability of curated, high-quality gene families in well-studied species to classify proteins of these families in related, less-studied species. For example, we can classify gene families in the Caenorhabditis species by taking advantage of the curated gene families in C. elegans. In the first step of this strategy, proteins of one or more species of interest are pooled into one large data set. This data set is then classified with parameters chosen such that classification performance is maximized on the curated, known gene families. Proteins of different species found in identical clusters are then classified as belonging to the same families.
To demonstrate the usability of this approach, we used TRIBE-MCL to classify both chemosensory genes and ABC transporter genes in a combined data set containing proteins from all five sequenced Caenorhabditis species, which are available at WormBase (http://www.wormbase.org) release WS204 (130,208 proteins in total). We identified parameters that generate the best classification of C. elegans chemosensory gene families, which we found to be E-value threshold = 0.001 and inflation value = 1.2. Notably, these parameters are different from those that generated the best classification of C. elegans chemosensory genes for the C. elegans proteome alone (Figure 4). Using TRIBE-MCL and these parameters, we classified chemosensory genes in all five Caenorhabditis species (Table 2 and Table S3).
As expected, large numbers of chemosensory genes are found in all five sequenced Caenorhabditis species. As previously reported, there are more chemosensory genes in C. elegans (1,414 genes) compared to C. briggsae (1,114 genes) , . In addition, our comparative gene family identification strategy suggests that C. remanei (1,684 genes) has more chemosensory genes than any other Caenorhabditis species whose genomes has been sequenced, with some pronounced family size increases relative to C. elegans, such as srb (+50%) and sru (+150%). C. brenneri (1,211 genes) has a similar number of chemosensory genes as C. briggsae, while C. japonica (558 genes) has the least chemosensory genes compared to the other four Caenorhabditis species. Some of the chemosensory gene family sizes in C. remanei may be overestimated since it has been demonstrated that genome sequences used for sequencing were extracted from heterozygotes . The sequenced C. brenneri genome might contain heterozygosity as well. The low number of chemosensory genes in the C. japonica genome partly reflects that the genome sequence contains gaps, which cover ∼20% of the genome. These missing regions may be enriched with chemosensory genes. An interesting difference for C. japonica is observed for the previously mentioned srz gene family, which it seems to lack entirely. Another potentially confounding factor that should be kept in mind is that the gene models predicted for the three Caenorhabditis species C. remanei, C. brenneri, and C. japonica are preliminary and have not been examined closely. Therefore, many gene models may not be accurate and many others might still be missing.
Using the same strategy, we classified ABC transporter genes in all five Caenorhabditis species (Table 3 and Table S4). Contrary to chemosensory genes, C. elegans shows the lowest number of ABC transporter genes overall (61 genes), which is slightly less than C. briggsae (73 genes) and C. remanei (73 genes). C. brenneri has the highest number of genes (102 genes; +67% relative to C. elegans). C. japonica shows also an increased gene content for most ABC transporter gene families relative to C. elegans (87 genes in total; +43%).
Comparative gene family classification gives novel insights into well-studied gene families
Here we demonstrate that automatically generated classification results provide an excellent starting point for further in-depth analysis of genes and gene families. The expansion and contraction of some gene families may be genuine, while others may reflect defective curation, thus incorrect classification. For example, the ABC transporter family C, which was analyzed extensively by Zhao and colleagues among the three nematode species C. elegans, C. briggsae, and C. remanei , showed some conspicuous differences between our classification and previous analysis. Zhao et al. found nine genes in each of these species with clear one-to-one orthology relationships. In contrast, our analysis suggested a larger number of putative ABC transporter C genes: 10 in C. elegans, 14 in C. briggsae, and 13 in C. remanei (Table 3). These differences in gene numbers motivated us to investigate the automatic classification result of ABC transporter family C in more detail.
Analysis of these differences revealed novel bona fide ABC transporters (Figure 5), as well as defective gene models in current gene annotations of Caenorhabditis genomes. Three genes classified by TRIBE-MCL as ABC transporters have all necessary domains (CBG08354 in C. briggsae and CRE14222 and CRE25095 in C. remanei). These three genes were missed in previous analyses likely because of improved C. briggsae and C. remanei contig assembly after the work of Zhao et al. was finished (personal communication). In a phylogenetic analysis, the three new genes group nicely within known ABC transporters of family C (Figure 5C). Comparing three C. briggsae gene models CBG00493, CBG00494, and CBG00495, which were identified by TRIBE-MCL as ABC genes, with known ABC genes suggests that these three models represent fragments of one single ABC gene. Thus these gene models are defective. By running genBlastG, a newly developed comparative gene predictor in our lab (She, Chu, Wang, and Chen, unpublished), we predicted a new gene model that merges these three genes nicely into one gene model (Figure 5A). Similarly, C. remanei gene model CRE17132 (503 aa) is a predicted 3′ gene fragment of known ABC transporter gene Cre-mrp-1 (CRE17131; 893 aa) (Figure 5B).
Panel A shows the current gene model of C. briggsae gene CBG000495 (Cbr-mrp-8) as well as the improved gene model obtained by running genBlastG with default parameters using C. elegans ortholog Y75B8A.26 as query (http://genome.sfu.ca/genblast/). Panel B shows both current and improved gene model for the C. remanei gene CRE17131 (Cre-mrp-1) using C. elegans ortholog F57C12.5c (longest confirmed isoforms) as query. The phylogenetic tree shows the evolutionary relationship of the three new ABC transporter genes CBG08354, CRE25095, and CRE14222 (indicated by arrows) with known C. elegans, C. briggsae, and C. remanei ABC transporters of family C. Tree is drawn to scale (number of substitutions per site). Numbers at branch points represent bootstrap values from 1,000 iterations.
The remaining difference of 4 genes in the ABC transporter C family between our automatically generated results and those from Zhao et al. can be explained by potential errors in the current gene annotation of C. briggsae. We encountered a trio of orthologous genes present in family C that are clearly not ABC transporters (C06G4.4, CBG22944, and CRE06748). Inspection of the BLAST similarity matrix revealed that none of these three genes exhibits sequence similarity with known ABC transporters in family C, which raised the question why TRIBE-MCL assigned these three genes to this family. Closer investigation revealed that one C. briggsae gene (CBG24505) in the TRIBE-MCL cluster exhibits local sequence similarity both to ABC transporter genes (N-terminal) and to this orthologous trio (C-terminal). Thus CBG24505 functions as linker gene that prompts TRIBE-MCL to pull two otherwise unrelated gene families together. The existence of two alternative, shorter gene models at the locus of CBG24505 suggests that the current gene model of CBG24505 is in fact a fused gene that should be split. One shorter version of CBG24505 encodes for an ABC transporter transmembrane region that has high sequence similarity to C. elegans gene mrp-7 (data not shown). Interestingly, the current (non-adjacent) C. briggsae ortholog of mrp-7, CBG23578, lacks this 5′ transmembrane region, which suggests either a chromosomal rearrangement or an assembly error in the C. briggsae genome that split the mrp-7 ortholog CBG23578 into separate genes.
Taken together, our comparative gene family classification approach could successfully reproduce previously established gene numbers of the ABC transporter C family in C. elegans, C. briggsae, and C. remanei. In addition, it led to the discovery of both defective gene models and previously missed ABC transporter genes. This confirms the feasibility of this approach and highlights its potential for giving novel and rapid insights into gene families across multiple species.
Guidelines for tuning parameters for comparative gene family classification
Some practical guidelines can be followed for tuning parameters. Comparative gene family classification is useful if gene families are to be compared across species and if reference classifications exist for at least one of the species. TRIBE-MCL and MC-UPGMA are two programs that are both efficient and accurate for gene family classification in eukaryotes. The Jaccard index is an easy to compute and yet effective measure of cluster quality that can be used to find optimal program parameters. The two main parameters to tune are the inflation value in case of TRIBE-MCL and the E-value tree-cutoff in case of MC-UPGMA. After trying different parameter values the one that yields the highest Jaccard index should be used for classification. For larger datasets, the computation of the pair-wise similarity matrix with BLAST might be the computationally most expensive step of the analysis, but can be easily parallelized if required.
Based on our assessment of publicly available gene family classification programs, we conclude that many are performing well. MC-UPGMA and TRIBE-MCL performed exceptionally well in our comparison and nicely reconstructed most manual classifications of both chemosensory and ABC transporter genes. We attribute the overall outperformance of MC-UPGMA and TRIBE-MCL to beneficial intrinsic properties of the two clustering algorithms. MC-UPGMA utilizes average-linkage clustering, which determines the relatedness of two clusters by taking the mean similarity across all data points in those clusters. Average-linkage clustering is known to be more robust against outliers . We could clearly observe this phenomenon, where for example in comparison to MC-UPGMA the single-linkage clustering algorithm BLASTClust produced clusters of much lower specificity (i.e. too large clusters) at similar levels of sensitivity (data not shown). Similarly, the iterative graph-based clustering procedure implemented in TRIBE-MCL is robust against merging clusters that share only few edges, which allows the robust identification of true gene families even in the presence of lower-quality BLAST hits or promiscuous domains . Additional information about clustering methodology and performance of all seven tested programs is provided in Text S1.
Nevertheless, the good performance of gene family classification programs depended on the tuning of program parameters. For example, the overall good performance of both TRIBE-MCL and MC-UPGMA required parameter adjustment for both types of gene families and proteome size. Parameters optimal for classifying one type of gene family yielded poor performance when used for classifying the other (Figure 3). The optimal inflation value for TRIBE-MCL was 2.6 for the ABC transporter genes instead of 1.2 for the chemosensory genes, because lower inflation values cause TRIBE-MCL to incorrectly cluster the more conserved ABC transporter genes into fewer and bigger clusters. An equally dramatic difference was seen for MC-UPGMA in terms of the optimal E-value tree-cutoff for classifying chemosensory genes (E = 9.6) and ABC transporter genes (E = 1e-14), which again reflects the higher sequence divergence among chemosensory genes than among ABC transporter genes. The influence of data set size on classification performance was less pronounced but still substantial (Figure 4). Keeping the E-value for constructing the BLAST similarity matrix constant, we observed the tendency that the larger data set required less stringent clustering parameters for the correct resolution of our gene families; that is, higher inflation values in case of TRIBE-MCL and lower E-value tree-cutoffs in case of MC-UPGMA (data not shown). One possible explanation is that the inclusion of divergent family members from other species leads to more sparsely connected clusters that need less stringent parameters for correct resolution. Thus, taken together, despite the encouraging finding that fully automated programs can reconstruct manually established gene families with good quality in principle, the question remained how these programs should be parameterized in practice.
We proposed a novel, comparative approach to automated gene family classification that takes advantage of already established gene family classifications in one species (reference gene families) to classify genes of the same families in other, related species. Many model organisms are well studied today, and many gene families of these species have been curated in great detail. This existing knowledge of gene families can be readily leveraged for what we call ‘comparative gene family classification’: complete proteomes of well-studied and related species are pooled together and classification parameters are chosen such that classification performance is maximized on the reference gene families. Genes found within identical clusters are then considered as members of the same family. This strategy can be completely automated and thus provides a convenient shortcut to gene family classification within the fast growing body of fully sequenced species, at least at a first approximation. It is worth mentioning that the reference gene families used for parameter calibration must not necessarily be complete, in which case our classification strategy should reveal missing family members within the reference gene family itself. Also, in principal, there is no minimum phylogenetic distance of compared species required for this approach. Comparative gene family classification will consider genes from other species as family members as long as those genes are as closely related to the reference gene family as existing family members are related among each other.
We applied this comparative gene family classification approach to chemosensory genes and ABC transporter genes across all five sequenced Caenorhabditis species (Table 2 and 3). We observed a less dramatic increase of chemosensory gene content in C. elegans relative to C. briggsae than reported previously (+30% instead of +70% in  and +40% in ), probably due to a constantly improving annotation of the C. briggsae genome. Results from other studies that carefully worked up the differential chemosensory gene content between C. elegans and C. briggsae in selected chemosensory gene families are in good agreement with our results, suggesting that our strategy works well. The reported numbers for the sra and srab gene families in  match almost perfectly with our results, and we observe a similar increase in C. elegans srz gene numbers relative to C. briggsae (+80%) as reported in  (+106%). However, the increased number of chemosensory genes in C. remanei relative to C. elegans is inconsistent with previous findings  and demands explanation. First, we noticed that C. remanei has in general an elevated number of predicted genes in its genome (31,518; WS204) relative to C. elegans (20,140; WS180, only longest isoforms) and C. briggsae (21,978), which is probably attributable to many partial genes at contig boundaries of its largely unfinished genome sequence and which could account for a larger artificial chemosensory gene content in C. remanei. Second, genome assembly of C. remanei and C. brenneri is hampered by high levels of heterozygosity , which can also lead to inflated gene numbers due to multiple alleles. Third, and this applies to all non-C. elegans genomes, gene models are currently of considerably less quality for the newly sequenced species, which means that gene numbers reported here might change significantly in the near future and should be interpreted with caution. Indeed, our detailed study of the ABC transporter gene family C (Figure 5) suggests that imperfect gene models are a major problem in the newly sequenced Caenorhabditis species. Guided by our comparative gene family classification strategy, we identified six gene models in C. briggsae and C. remanei that are likely defective, causing artificially inflated numbers of ABC transporter genes reported by TRIBE-MCL in these species.
As more genomes are sequenced and genes annotated, more users will search for appropriate methods and strategies for genome-wide gene family classification. We showed that currently available programs for automatic sequence-based gene family classification can reconstruct manually curated gene families quite accurately. However, even the best performing programs need to be adjusted for different protein families and data sets to yield optimal performance. We demonstrated that a comparative approach is helpful in this context: by adjusting program parameters such that reference gene families of well-studies species are classified correctly, it is possible to simultaneously and correctly classify genes of the same families in other, less-studied (or newly sequenced) species. Many gene families have been worked up with great detail and large efforts in the past, providing a rich substrate for comparative gene family classification to work with. We predict this approach to be very useful in the future when many newly sequenced species will become available.
Materials and Methods
Search and selection of gene family classification programs
The search for gene family classification programs was mainly conducted within the body of PubMed-listed literature. Additional methods were identified by Internet search via Google, looking for terms including “protein family classification”, “gene family classification”, and “sequence clustering”.
Three programs were not considered for performance comparison albeit a stand-alone program was available. GeneRAGE  was excluded because of long runtimes on our system. Our attempt to cluster the C. elegans proteome (20,140 proteins, WS180) with GeneRAGE failed for an unknown reason after 20 days of runtime. The second program ProClust ,  did not compile on our system (Linux version 22.214.171.124–88.fc7 (email@example.com), gcc version 4.1.2 20070925 (Red Hat 4.1.2–27) due to compiler incompatibilities. ProClust source code was obtained from http://promoter.mi.uni-koeln.de/~proclust/(version 1.0.1). BAG  was excluded due to license requirements.
Reference data sets (benchmarks)
Reference classification for C. elegans chemosensory genes was obtained from WS180 gene class annotations. Gene family names, family sizes, and references are shown in Table S1. We noticed a small increase in gene numbers for most chemosensory gene families in the WS180 release (release date September 17, 2007) in comparison to gene numbers reported by Robertson and Thomas , probably due to refined annotation. C. elegans ABC transporter gene families were derived from Zhao et al.  by mapping gene names reported by Zhao et al. to the WS180 data set. ABC transporter families and their sizes are shown in Table S2.
Measurement of classification performance
To assess the performance of a given classification result, we compute sensitivity, specificity, and Jaccard index for each known gene family in our reference set as a function of its overlap with predicted gene families (Figure S1). The overlap is quantified in terms of number of genes that are found both in the known and the predicted gene family (TP = true-positives), number of genes that are found in the predicted but not in the known gene family (FP = false-positives), and the number of genes that are found in the known but not in the predicted gene family (FN = false-negative). Note that we count genes not assigned to a known family in the reference classification as false-positives. Sensitivity is computed as TP/(TP+FN) and is high if most genes of a known gene family are found within a predicted gene family. Specificity is computed as TP/(TP+FP) and is high if most genes of a predicted gene family are found within a known gene family. High Jaccard index is computed as TP/(TP+FP+FN) and is high if known and predicted families roughly contain identical genes. If a known gene family overlaps with multiple predicted gene families, sensitivity, specificity, and Jaccard index for that known gene family correspond to the overlapping family with the highest Jaccard index (“maximum overlap” rule).
To reflect classification performance across all gene families in a reference set, we computed both the unweighted and the weighted average Jaccard index. The weighted average Jaccard index is weighted by family size and gives more weight to larger gene families and less weight to smaller gene families. High weighted averages are only achieved if the absolute number of misclassified genes is low.
BLAST all-vs-all comparison
C. elegans protein sequences were obtained from WormBase WS180 (23,511 proteins). Only longest isoforms were kept (20,140 proteins). BLASTP all-vs-all comparison was performed with the NCBI BLAST package v2.2.19 with default parameters (E-value ≤10, filter query sequence = on). For the Caenorhabditis five-species comparison, additional protein sequences of C. briggsae (21,978), C. remanei (31,518), C. brenneri (30,702), and C. japonica (25,870) were obtained from WormBase WS204 and pooled with C. elegans WS180 protein sequences in one FASTA file. No filtering for longest isoforms was performed for non-C. elegans proteins. BLASTP all-vs-all comparison was performed on the combined FASTA file (130,208 proteins; same parameters as for C. elegans comparison).
MCL version 08-312 was obtained from http://www.micans.org/mcl/. Results in Figure 1 and 2 were generated by the following procedure: C. elegans all-vs-all BLAST hits with E-value ≤ 1e-10 were inputted to mcxload as suggested by the MCL manual (-abc - —stream-neg-log -stream-tf ‘mul(0.4343), ceil(200)’ —stream-mirrorlist). The resulting. mci file was clustered with mcl at varying inflation values, ranging from 1.1 to 5.0 (step size 0.1). Maximum number of iterations (-L) was set to 500 to prevent overly long runtimes for some inflation values. The number of processors (-te) was set to 4 to speed up computation. All other mcl parameters were left default. The average runtime of mcl on the C. elegans-only data set was 34 seconds.
The same procedure was applied for clustering the larger, five-species data set (Figure 4; Table 2 and 3), but here the E-value threshold used for filtering the BLAST output prior to clustering was allowed to varybetween 1e-50 and 0.1. We ran TRIBE-MCL with all possible combinations of E-value and inflation value (32 E-values ×39 inflation values = 1,248 runs). The combined five-species data set comprised 130,208 proteins in total, including proteins from C. elegans (WS180, 20,140 proteins), C. briggsae (WS204, 21,978 proteins), C.remanei (WS204, 31,518 proteins), C. brenneri (WS204, 30,702 proteins), and C. japonica (WS204, 25,870 proteins). The inclusion of C. elegans WS180 instead of the latest WS204 allowed us to assess classification performance against our C. elegans benchmark data set.
MC-UPGMA version 1.0.0 was downloaded from http://www.protonet.cs.huji.ac.il/mcupgma/. Results in Figure 1 and 2 were generated by the following procedure: C. elegans BLAST all-vs-all hits were filtered for hits with E-value ≤ 1e-10. Reciprocal hits were symmetrified by considering only the one with the lower E-value (better hit). Sparse values in the similarity matrix (i.e. proteins that had no similarity with E-value ≤ 1e-10) were assigned a similarity value of 10.0 (-max-distance parameter of the program). After clustering, the produced hierarchical tree was cut at varying but uniform similarity thresholds ( = E-value tree-cutoff), ranging from 1e-50 to 9.9. All proteins found in sub-trees below that similarity threshold were assigned to the same final cluster. The same procedure was applied for clustering the larger five-species data set, but, as in the case of TRIBE-MCL, the E-value threshold for filtering the five-species BLAST output was now allowed to vary between 1e-50 and 0.1. All combinations of BLAST E-values and E-value tree-cutoffs were tested. Average runtime for clustering the C. elegans proteome with MC-UPGMA was 6 seconds.
The gSPC program version 1.15 was obtained from the authors upon request. As before, C. elegans BLAST all-vs-all hits were filtered for hits with E-value ≤ 1e-10. Reciprocal hits were symmetrified by considering only the one with the lower E-value (better hit). gSPC requires distances instead of similarities for clustering, which we computed as 200-(min(200,-log10(E-value))). The distance between identical proteins and between proteins with an E-value of 0 was defined as 0. The kNN parameter was varied between 10 and 300 with step size 10. The temperature parameter ranged between 1e-05 (minimum) and 0.1 (maximum) with step size 0.005. Other clustering parameters were kept constant (iterations = 2000; spins = 20;parallel = 4;joint = 1;gamma = 0.5;symmetric = 1). The average runtime of gSPC per parameter setting was 12 s. Best result on chemosensory genes (Figure 1) was achieved at temperature = 0.02001 and kNN = 40. Best result on ABC transporters (Figure 2) was achieved at temperature = 0.05001 and kNN = 20.
A stand-alone JAVA implementation of FORCE was obtained from http://gi.cebitec.uni-bielefeld.de/comet/force/(v1.0 beta5). FORCE incorporates a genetic algorithm that finds optimal values for parameters automatically. No parameters were thus set by us except the –cutoff parameter, which was set to m3.4 as suggested in the manual. Input data were again BLAST pair-wise protein sequence similarities, which were generated as described previously (E-value ≤ 1e-10). Self-similarities of proteins were excluded. FORCE required 3.5 GB of RAM assigned to the JAVA virtual machine to be run successfully. A more time and space efficient cost matrix calculator is available at http://gi.cebitec.uni-bielefeld.de/comet/force/, which we did not use in this analysis. Time required for clustering the C. elegans proteome was 25 hours. We tested all three different cost models and obtained identical results.
Linux executables version 1.1 were downloaded from http://mars.csie.ntu.edu.tw/~cychen/HC/HomoClust.htm. The input file for HomoClust was generated from the same C. elegans BLAST all-vs-all comparison as used previously. Only hits with E-value ≤ 1e-10 were considered. Self-similarities were ignored. Similarity values corresponded directly to E-values as determined by BLAST. No symmetrification of similarity values was performed as this was not required by HomoClust. The two key parameters of HomoClust are Simdown-th and Simup-th, which specify the minimum and maximum sequence similarity, respectively, used for evaluating the homogeneity of clusters in the first phase of the algorithm. For both parameters, we tested values ranging from 0 to 250 with step size 10. Other fixed parameters were ‘–s evalue’ and ‘–a HomoClust’. All other parameters were left default. Reported homogeneous clusters were interpreted as putative gene families. Cutting the reported cluster hierarchy at other, varying similarity thresholds (as was done for MC-UPGMA) was not possible in case of HomoClust, because no cluster similarity or distance values were provided in the program output. The average runtime per parameter set tested was 9 seconds.
CLUSS version 3.0 was downloaded from http://prospectus.usherbrooke.ca/CLUSS/Download/SRC/CLUSS_3.0/CLUSS.rar. CLUSS 3.0 allows selecting older program version (1.0 and 2.0) at startup and we tested all three of them (the Kmer program version was not tested). CLUSS was run directly with C. elegans WS180 protein sequences as input without prior BLAST comparison (no external similarity measure required by the program). Other parameters were: substitution matrix = BLOSOM62; redundant sequences = withdraw; phylogenetic tree = one tree for each subfamily. CLUSS 2.0 gave slightly better results than CLUSS 1.0 and thus CLUSS 2.0 results were used. CLUSS 3.0 crashed twice after one week runtime with the error ‘too many iterations in eigenvectors searches’. Execution time was 12 and 55 hours for CLUSS 1.0 and CLUSS 2.0, respectively. Note that this time includes the generation of pairwise sequence similarities, because CLUSS was not run with precomputed BLAST results.
BLASTClust is part of the NCBI BLAST package and was downloaded from http://www.ncbi.nlm.nih.gov/BLAST/download.shtml (version 2.2.19). Minimum sequence similarity threshold was specified in terms of percent identity (-S parameter) and varied between 10 and 80 with step size 10. Minimum alignment length coverage (-L parameter) varied between 0.1 and 0.9 with step size 0.1. E-value threshold in the BLASTClust config file (-e parameter) was set to 1e-10. Other fixed command line parameters were –p T (input is protein sequence) and –a 5 (number of CPUs). All other parameters default. We generated a hit-list file (containing neighboring proteins above threshold) at first run of BLASTClust (-s parameter) and used this file for subsequent runs to speed up computation (-r parameter). The first run of BLASTClust took 30 minutes (including the generation of the hit-list file). Subsequent runs of BLASTClust finished in fewer than one second.
The phylogenetic tree in Figure 5C was produced with MEGA4 . We used ClustalW  to construct a multiple alignment (default parameters) of both known and putative new ABC transporter family C genes. For the identified split gene models (Figure 5A and 5B) we included the protein sequence encoded by the corrected, longer gene models. Columns containing gaps as well as immediately adjacent columns were removed from the alignment before tree construction. The phylogenetic tree was produced by the minimum evolution method and 1000 bootstrap iteration.
Classification performance measures as a function of overlap between known and predicted gene families. False-positives, true-positives, and false-negatives refer to number of genes. Genes not assigned to a family in the reference classification are counted as false-positives.
(0.18 MB TIF)
Heat-map revealing low sequence similarities between srv family members. The lower-left half of the matrix shows pair-wise sequence similarities determined by BLAST (E-value threshold 10). The upper-right half of the matrix shows pair-wise sequence similarity determined by PSI-BLAST. Only PSI-BLAST finds sequence similarity among all proteins within that family. Numbers within squares correspond to -log10(E-value). Dark red indicates high sequence similarity, light red indicates low sequence similarity. White (empty) squares indicate that no sequence similarity has been reported.
(0.97 MB TIF)
Heat-map showing reduced but existing sequence similarity between str and srj family members. Figure produced with MultiExperiment Viewer .
(0.95 MB TIF)
Brief review and results summary of the seven selected programs for performance comparison
(0.04 MB DOC)
C. elegans chemosensory gene families used as reference classification for performance evaluation.
(0.13 MB DOC)
C. elegans ABC transporter gene families used as reference classification for performance evaluation.
(0.03 MB DOC)
Five-species TRIBE-MCL classification result of Caenorhabditis chemosensory genes. This table contains all genes found in chemosensory gene clusters (defined as TRIBE-MCL clusters that contain at least one annotated C. elegans chemosensory gene).
(0.74 MB XLS)
Five-species TRIBE-MCL classification result of Caenorhabditis ABC transporter genes. This table contains all genes found in ABC transporter gene clusters (defined as TRIBE-MCL clusters that contain at least one annotated C. elegans ABC transporter gene).
(0.06 MB XLS)
We thank the authors of gene family classification programs for programs and support. We thank David Baillie for his input on ABC transporter genes, and Zhongying Zhao for examining potential novel cases of ABC transporter genes. We thank John Spieth and Erich Schwarz for making the various nematode genome sequences available before publication. We thank all members of the Chen laboratory, especially Ismael Vergara for BLAST data sets and fruitful discussions, and Jeffrey Shih-Chieh Chu for genBlastG support.
Conceived and designed the experiments: CF NC. Performed the experiments: CF. Analyzed the data: CF NC. Wrote the paper: CF NC.
- 1. Ponting CP (2008) The functional repertoires of metazoan genomes. Nat Rev Genet 9: 689–698.
- 2. Dayhoff MO (1976) The origin and evolution of protein superfamilies. Fed Proc 35: 2132–2138.
- 3. Aftab S, Semenec L, Chu JS, Chen N (2008) Identification and characterization of novel human tissue-specific RFX transcription factors. BMC Evol Biol 8: 226.
- 4. Thomas JH, Kelley JL, Robertson HM, Ly K, Swanson WJ (2005) Adaptive evolution in the SRZ chemoreceptor families of Caenorhabditis elegans and Caenorhabditis briggsae. Proc Natl Acad Sci U S A 102: 4476–4481.
- 5. Demuth JP, De Bie T, Stajich JE, Cristianini N, Hahn MW (2006) The evolution of mammalian gene families. PLoS One 1: e85.
- 6. Wu CH, Huang H, Yeh L-SL, Barker WC (2003) Protein family classification and functional annotation. Comput Biol Chem 27: 37–47.
- 7. Nakanishi S (1992) Molecular diversity of glutamate receptors and implications for brain function. Science 258: 597–603.
- 8. Higgins CF (1992) ABC transporters: from microorganisms to man. Annu Rev Cell Biol 8: 67–113.
- 9. Jacoby E, Bouhelal R, Gerspacher M, Seuwen K (2006) The 7 TM G-protein-coupled receptor target family. ChemMedChem 1: 761–782.
- 10. Lander ES, Linton LM, Birren B, Nusbaum C, Zody MC, et al. (2001) Initial sequencing and analysis of the human genome. Nature 409: 860–921.
- 11. Venter JC, Adams MD, Myers EW, Li PW, Mural RJ, et al. (2001) The sequence of the human genome. Science 291: 1304–1351.
- 12. Huerta-Cepas J, Bueno A, Dopazo J, Gabaldon T (2008) PhylomeDB: a database for genome-wide collections of gene phylogenies. Nucleic Acids Res 36: D491–496.
- 13. Li H, Coghlan A, Ruan J, Coin LJ, Heriche JK, et al. (2006) TreeFam: a curated database of phylogenetic trees of animal gene families. Nucleic Acids Res 34: D572–580.
- 14. Vilella AJ, Severin J, Ureta-Vidal A, Heng L, Durbin R, et al. (2009) EnsemblCompara GeneTrees: Complete, duplication-aware phylogenetic trees in vertebrates. Genome Res 19: 327–335.
- 15. Hulo N, Bairoch A, Bulliard V, Cerutti L, De Castro E, et al. (2006) The PROSITE database. Nucleic Acids Res 34: D227–230.
- 16. Finn RD, Tate J, Mistry J, Coggill PC, Sammut SJ, et al. (2008) The Pfam protein families database. Nucleic Acids Res 36: D281–288.
- 17. Schultz J, Milpetz F, Bork P, Ponting CP (1998) SMART, a simple modular architecture research tool: identification of signaling domains. Proc Natl Acad Sci U S A 95: 5857–5864.
- 18. Kriventseva EV, Biswas M, Apweiler R (2001) Clustering and analysis of protein families. Curr Opin Struct Biol 11: 334–339.
- 19. Kriventseva EV (2005) Classification of proteins by clustering techniques. Encyclopedia of Genetics, Genomics, Proteomics and Bioinformatics 6: Article 92.
- 20. Rahman SA, Bakar A, Hussein Z (2008) A Review on Protein Sequence Clustering Research: Springer Berlin Heidelberg.
- 21. Enright AJ, Dongen SV, Ouzounis CA (2002) An efficient algorithm for large-scale detection of protein families. Nucleic Acids Res 30: 1575–1584.
- 22. Tekaia F, Latge JP (2005) Aspergillus fumigatus: saprophyte or pathogen? Curr Opin Microbiol 8: 385–392.
- 23. Stein LD, Bao Z, Blasiar D, Blumenthal T, Brent MR, et al. (2003) The genome sequence of Caenorhabditis briggsae: a platform for comparative genomics. PLoS Biol 1: E45.
- 24. Wall PK, Leebens-Mack J, Muller KF, Field D, Altman NS, et al. (2008) PlantTribes: a gene and gene family resource for comparative genomics in plants. Nucleic Acids Res 36: D970–976.
- 25. Lee D, Grant A, Marsden RL, Orengo C (2005) Identification and distribution of protein families in 120 completed genomes using Gene3D. Proteins 59: 603–615.
- 26. NCBI (2008) BLASTCLUST v2.2.19 (ftp://ftp.ncbi.nlm.nih.gov/blast/executables/release/2.2.19/).
- 27. Bolten E, Schliep A, Schneckener S, Schomburg D, Schrader R (2001) Clustering protein sequences—structure prediction by transitive homology. Bioinformatics 17: 935–941.
- 28. Chen C-Y, Chung W-C, Su C-T (2006) Exploiting homogeneity in protein sequence clusters for construction of protein family hierarchies. Pattern Recognition 39: 2356–2369.
- 29. Kelil A, Wang S, Brzezinski R, Fleury A (2007) CLUSS: clustering of protein sequences based on a new similarity measure. BMC Bioinformatics 8: 286.
- 30. Kim S, Lee J (2006) BAG: a graph theoretic sequence clustering algorithm. Int J Data Min Bioinform 1: 178–200.
- 31. Loewenstein Y, Portugaly E, Fromer M, Linial M (2008) Efficient algorithms for accurate hierarchical clustering of huge datasets: tackling the entire protein space. Bioinformatics 24: i41–i49.
- 32. Wittkop T, Baumbach J, Lobo FP, Rahmann S (2007) Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing. BMC Bioinformatics 8: 396.
- 33. Enright AJ, Ouzounis CA (2000) GeneRAGE: a robust algorithm for sequence clustering and domain detection. Bioinformatics 16: 451–457.
- 34. Tetko IV, Facius A, Ruepp A, Mewes H-W (2005) Super paramagnetic clustering of protein sequences. BMC Bioinformatics 6: 82.
- 35. Pipenbacher P, Schliep A, Schneckener S, Schönhuth A, Schomburg D, et al. (2002) ProClust: improved clustering of protein sequences with an extended graph-based approach. Bioinformatics 18: Suppl 2S182–S191.
- 36. Robertson HM, Thomas JH (2006) The putative chemoreceptor families of C. elegans. WormBook 1–12.
- 37. Thomas JH, Robertson HM (2008) The Caenorhabditis chemoreceptor gene families. BMC Biol 6: 42.
- 38. Chen N, Pai S, Zhao Z, Mah A, Newbury R, et al. (2005) Identification of a nematode chemosensory gene family. Proc Natl Acad Sci U S A 102: 146–151.
- 39. Robertson HM (1998) Two large families of chemoreceptor genes in the nematodes Caenorhabditis elegans and Caenorhabditis briggsae reveal extensive gene duplication, diversification, movement, and intron loss. Genome Res 8: 449–463.
- 40. Robertson HM (2000) The large srh family of chemoreceptor genes in Caenorhabditis nematodes reveals processes of genome evolution involving large duplications and deletions and intron gains and losses. Genome Res 10: 192–203.
- 41. Robertson HM (2001) Updating the str and srj (stl) families of chemoreceptors in Caenorhabditis nematodes reveals frequent gene movement within and between chromosomes. Chem Senses 26: 151–159.
- 42. Thomas JH (2006) Analysis of homologous gene clusters in Caenorhabditis elegans reveals striking regional cluster domains. Genetics 172: 127–143.
- 43. Troemel ER, Chou JH, Dwyer ND, Colbert HA, Bargmann CI (1995) Divergent seven transmembrane receptors are candidate chemosensory receptors in C. elegans. Cell 83: 207–218.
- 44. Sheps JA, Ralph S, Zhao Z, Baillie DL, Ling V (2004) The ABC transporter gene family of Caenorhabditis elegans has implications for the evolutionary dynamics of multidrug resistance in eukaryotes. Genome Biol 5: R15.
- 45. Zhao Z, Thomas JH, Chen N, Sheps JA, Baillie DL (2007) Comparative genomics and adaptive selection of the ATP-binding-cassette gene family in caenorhabditis species. Genetics 175: 1407–1418.
- 46. Jaccard A (1908) Nouvelles recherches sur la distribution florale. Bull Soc Vaudoises Sci Nat 44:
- 47. Chen Y, Reilly KD, Sprague AP, Guan Z (2006) SEQOPTICS: a protein sequence clustering system. BMC Bioinformatics 7: Suppl 4S10.
- 48. Krause A, Stoye J, Vingron M (2005) Large scale hierarchical clustering of protein sequences. BMC Bioinformatics 6: 15.
- 49. Barriere A, Yang SP, Pekarek E, Thomas CG, Haag ES, et al. (2009) Detecting heterozygosity in shotgun genome assemblies: Lessons from obligately outcrossing nematodes. Genome Res 19: 470–480.
- 50. Tamura K, Dudley J, Nei M, Kumar S (2007) MEGA4: Molecular Evolutionary Genetics Analysis (MEGA) software version 4.0. Mol Biol Evol 24: 1596–1599.
- 51. Thompson JD, Higgins DG, Gibson TJ (1994) CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res 22: 4673–4680.
- 52. Krause A, Vingron M (1998) A set-theoretic approach to database searching and clustering. Bioinformatics 14: 430–438.
- 53. Meinel T, Krause A, Luz H, Vingron M, Staub E (2005) The SYSTERS Protein Family Database in 2005. Nucleic Acids Res 33: D226–D229.
- 54. Kaplan N, Sasson O, Inbar U, Friedlich M, Fromer M, et al. (2005) ProtoNet 4.0: a hierarchical classification of one million protein sequences. Nucleic Acids Res 33: D216–D218.
- 55. Yona G, Linial N, Linial M (1999) ProtoMap: automatic classification of protein sequences, a hierarchy of protein families, and local maps of the protein space. Proteins 37: 360–378.
- 56. Kriventseva EV, Fleischmann W, Zdobnov EM, Apweiler R (2001) CluSTr: a database of clusters of SWISS-PROT+TrEMBL proteins. Nucleic Acids Res 29: 33–36.
- 57. Heger A, Holm L (2001) Picasso: generating a covering set of protein family profiles. Bioinformatics 17: 272–279.
- 58. Abascal F, Valencia A (2002) Clustering of proximal sequence space for the identification of protein families. Bioinformatics 18: 908–921.
- 59. Paccanaro A, Casbon JA, Saqi MAS (2006) Spectral clustering of protein sequences. Nucleic Acids Res 34: 1571–1580.
- 60. Harlow TJ, Gogarten JP, Ragan MA (2004) A hybrid clustering approach to recognition of protein families in 114 microbial genomes. BMC Bioinformatics 5: 45.
- 61. Sperisen P, Pagni M (2005) JACOP: a simple and robust method for the automated classification of protein sequences with modular architecture. BMC Bioinformatics 6: 216.
- 62. Ma Q, Chirn G-W, Cai R, Szustakowski JD, Nirmala NR (2005) Clustering protein sequences with a novel metric transformed from sequence similarity scores and sequence alignments with neural networks. BMC Bioinformatics 6: 242.