This paper proposes a new method to identify communities in generally weighted complex networks and apply it to phylogenetic analysis. In this case, weights correspond to the similarity indexes among protein sequences, which can be used for network construction so that the network structure can be analyzed to recover phylogenetically useful information from its properties. The analyses discussed here are mainly based on the modular character of protein similarity networks, explored through the Newman-Girvan algorithm, with the help of the neighborhood matrix . The most relevant networks are found when the network topology changes abruptly revealing distinct modules related to the sets of organisms to which the proteins belong. Sound biological information can be retrieved by the computational routines used in the network approach, without using biological assumptions other than those incorporated by BLAST. Usually, all the main bacterial phyla and, in some cases, also some bacterial classes corresponded totally (100%) or to a great extent (>70%) to the modules. We checked for internal consistency in the obtained results, and we scored close to 84% of matches for community pertinence when comparisons between the results were performed. To illustrate how to use the network-based method, we employed data for enzymes involved in the chitin metabolic pathway that are present in more than 100 organisms from an original data set containing 1,695 organisms, downloaded from GenBank on May 19, 2007. A preliminary comparison between the outcomes of the network-based method and the results of methods based on Bayesian, distance, likelihood, and parsimony criteria suggests that the former is as reliable as these commonly used methods. We conclude that the network-based method can be used as a powerful tool for retrieving modularity information from weighted networks, which is useful for phylogenetic analysis.
Complex weighted networks have been applied to uncover organizing principles of complex biological, technological, and social systems. We propose herein a new method to identify communities in such structures and apply it to phylogenetic analysis. Recent studies using this theory in genomics and proteomics contributed to the understanding of the structure and dynamics of cellular complex interaction webs. Three main distinct molecular networks have been investigated based on transcriptional and metabolic activity, and on protein interaction. Here we consider the evolutionary relationship between proteins throughout phylogeny, employing the complex network approach to perform a comparative study of the enzymes related to the chitin metabolic pathway. We show how the similarity index of protein sequences can be used for network construction, and how the underlying structure is analyzed by the computational routines of our method to recover useful and sound information for phylogenetic studies. By focusing on the modular character of protein similarity networks, we were successful in matching the identified networks modules to main bacterial phyla, and even some bacterial classes. The network-based method reported here can be used as a new powerful tool for identifying communities in complex networks, retrieving useful information for phylogenetic studies.
Citation: Andrade RFS, Rocha-Neto IC, Santos LBL, de Santana CN, Diniz MVC, Lobão TP, et al. (2011) Detecting Network Communities: An Application to Phylogenetic Analysis. PLoS Comput Biol 7(5): e1001131. doi:10.1371/journal.pcbi.1001131
Editor: Christos Ouzounis, King's College London, United Kingdom
Received: September 22, 2010; Accepted: April 4, 2011; Published: May 5, 2011
Copyright: © 2011 Andrade et al. 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: Roberto F. S. Andrade received a productivity in research grant from the National Council for Scientific and Technological Development (CNPq), Brazil (no. 306052/2007-5) (http://www.cnpq.br). Charles N. de Santana received a JAE Predoctoral Fellowship from Consejo Superior de Investigaciones Cientificas (CSIC), Spain (http://www.csic.es/web/guest/home). Thierry Petit Lobao received a productivity in research grant from the National Council for Scientific and Technological Development (CNPq), Brazil (no. 307140/2009-1) (http://www.cnpq.br). Aristóteles Goés-Neto received a productivity in research grant from the National Council for Scientific and Technological Development (CNPq), Brazil (no. 304831/2007-7) (http://www.cnpq.br). Suani T. R. Pinho received a productivity in research grant from the National Council for Scientific and Technological Development (CNPq), Brazil (no. 305176/2009-9) (http://www.cnpq.br). Charbel N. El-Hani received a productivity in research grant from the National Council for Scientific and Technological Development (CNPq), Brazil (no. 301259/2010-0) (http://www.cnpq.br). We are supported by PRONEX/FAPESB-CNPQ, INCTI-SC and INCT-CITECS programs. 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.
In networks, module or community structure plays a central role when it comes to understand network topology and dynamics. To advance solutions to many problems related to biological networks, we need to identify, thus, the community structure in datasets. Consequently, the introduction of new efficient and robust methods that are able to perform such a task in a variety of situations is of utmost importance.
We are interested, here, in giving a contribution to the complex issue of phylogenetic inference by appealing to the complex network approach, which has been successfully applied to uncover organizing principles that govern the constitution and evolution of various complex biological, technological, and social systems –. Recent studies using complex network approaches in the fields of both genomics and proteomics have contributed to a better knowledge of the structure and dynamics of the complex webs of interactions of a living cell –. Several kinds of biologically relevant networks have been studied in the last years, mainly protein interaction, transcriptional, and metabolic networks . In this study, we work with another set of relationships, namely, the evolutionary relationships between proteins throughout phylogeny, and introduce a new method to identify communities in generally weighted complex networks.
The reliability and overall applicability of a new proposed method is the subject of a long term research program, which necessarily starts with a clear formulation of the key steps of the method, alongside with the analysis of a non trivial problem that has been analyzed before, such as, for instance, phylogenetic inference.
There are four families of methods of phylogenetic analysis that are commonly used, namely: maximum parsimony, distance, maximum likelihood, and Bayesian . Promising prospects of developing new trustful methods to infer phylogenetic relationships are offered by the possibility of using primary information about protein sequences contained in open access databases and the derived protein similarity measures. We introduce here a methodology to identify community structure in such primary data sets, based on the concept of distance between complex networks, and apply it to the specific problem of retrieving useful information that can be used to infer phylogenetic relationships. In this process, we avoid as much as possible the use of any qualitative pre-existing biological information. We show here that a method based on complex network theory can recover information about the evolutionary relationships between organisms, as expressed in the similarities and differences between their protein or DNA sequences.
Depending on the way the nodes are connected within a network, it may be possible to identify one or more subsets of nodes such that the average number of connections among nodes within any of these subsets is distinctly larger than the average number of connections with nodes outside this subset. The identification of such subsets (usually called communities, modules, components, clusters, etc.), a key issue that has not been completely solved within complex network theory, is of utmost importance for biological applications. Indeed, modular properties are found to be very common features in any branch or level of biological network investigations.
Over the past years, the amount of research in identifying communities in networks is really astonishing. There are several review articles discussing this subject, based on mathematical and computational approaches –. Furthermore, comparative analyses of the available methods are also found in the literature , .
Computationally efficient approaches based on similarity matrices and cluster analyses for the exploration of protein databases with little or no prior knowledge are important tools for phylogenetic analysis. A number of approaches are currently being used to infer evolutionary relationships between proteins. For instance, the Markov Cluster (MCL) Algorithm ,  is an unsupervised cluster algorithm that has been applied to the analysis of graphs in several different domains, mostly in bioinformatics. The MCL Algorithm was used, for instance, for the detection of protein families , a major research goal in structural and functional genomics. MCL was also extended to the identification of orthologous groups by OrthoMCL . It was also used to develop phylogenomic analyses of specific taxa, such as the Ascomycota . A hybrid approach to sequence-based clustering of proteins was developed, combining Markov with single-linkage clustering, with the intention of obtaining both specificity (as allowed by MCL) and the preservation of topological information as a function of threshold information about protein families (as in single-linkage clustering) . Another recently developed method for automatic and unsupervised detection of protein families and genome annotation is the Global Super Paramagnetic Clustering (SPC) Algorithm, which showed higher accuracy, specificity and sensitivity of clustering than MCL . Finally, Kóvacs et al.  introduced ModuLand, an integrative network module determination method family, which can determine overlapping network modules as hills of an influence function-based, centrality-type community landscape. The new method to identify communities in generally weighted complex networks proposed here is quite powerful and innovative in the use of a distance δ (to be defined in the next section) to determine an optimal value of the threshold on similarity.
Two main tasks are crucial to derive an objective, mathematically based community identification: First, to define a measure suitable to distinguish non-modular from modular character, and, second, to identify the communities, when this is the case. The distance δ used herein is able to help the identification of the modular character in a very clear way. Therefore, our major contribution, based on complex network theory, is to use this measure together with the protein similarity matrix (in fact, the weight matrix of any weighted network) to identify the minimal set of links that are included in the network in order to preserve the relevant biological information necessary to unveil the modular character within the data set at stake.
Once such optimally chosen network is found, any proposed community detection method may be used to retrieve the existing communities. We use here the Newman Girvan algorithm (NGA) , which, although time consuming, also allows to identify the sequence of branching events, leading to useful and well defined dendrograms.
Since several organic biomolecules are required for basic metabolic purposes, they can be found in large number of organisms, making it possible to use techniques derived from complex network theory to explore information that is useful for phylogenetic inferences. Enzymes that are involved in the synthesis of ubiquitous and metabolically important molecules seem particularly promising for such complex network approach. They are likely to be found in many distinct organisms and, if they are involved in ancient metabolic pathways, they can be found in the three life domains, Archaea, Bacteria, and Eukarya. Even though distinct organisms use their own enzyme variants to produce a given molecule, these variants will tend to look more similar in their amino acid sequences the closer the species are in phylogenetic terms. Thus, species can be gathered in phylogenetically meaningful groups by analyzing the degree of similarity of enzymes involved in some basic metabolic pathway. We show here how the similarity of the amino acid sequences of enzymes derived from completely sequenced genomes of extant organisms can be used for network construction and, subsequently, the network structure can be analyzed so as to recover phylogenetically useful information from its properties and statistics.
The methods described here can be used for any set of proteins involved in basic metabolic pathways. We will work in this paper with data from enzymes involved in chitin synthesis. Chitin, the β-1,4-linked linear homopolymer of N-acetylglucosamine, is a structural endogenous carbohydrate, which is a major component of fungal cell walls , cephalopod beaks , integuments of larvae and young nematodes , and arthropod exoskeletons . Chitin is the second most abundant polysaccharide in nature after cellulose. It occurs only in eukaryotic organisms of the Metazoa-Fungal clade. This suggests that chitin may have evolved before the crown eukaryotic radiation.
Chitin is synthesized by a sequence of six successive reactions: (i) conversion of Glu-6P into Fru-6-P by phosphoglucoisomerases (E.C. 22.214.171.124); (ii) conversion of Fru-6-P into GlcN-6-P by glucosaminephosphate isomerases (E.C. 126.96.36.199); (iii) acetylation of GlcN-6-P generating GlcNAc-6-P by phosphoglucosamine acetylases (E.C. 188.8.131.52), (iv) interconversion of GlcNAc-6-P into GlcNAc-1-P by acetylglucosamine phosphomutases (E.C. 184.108.40.206) or, alternatively, by acetylglucosamine phosphate deacetylases (E.C. 220.127.116.11); (v) uridilation of GlcNAc-1-P by UDP-acetylglucosamine pyrophosphorylases (E.C. 18.104.22.168); and (vi) conversion of UDP-GlcNAc into chitin by chitin synthases (E.C. 22.214.171.124) , .
Chitin degradation is achieved by chitinases (E.C. 126.96.36.199), either by exochitinases, which convert chitin into N-acetylglucosamine residues, or by endochitinases, which convert chitin into chitobiose, which, in turn, may be converted into N-acetylglucosamine residues by hexoaminidases (E.C. 188.8.131.52). N-acetylglucosamine residues may be activated by acetylglucosamine kinases (E.C. 184.108.40.206) to form N-acetylglucosamine-6-P, restoring the precursor of the short feedback cycle of chitin metabolism. Chitin may also be deacetylated by chitin deacetylases (E.C. 220.127.116.11), converted into chitosan, which is degraded by chitosanases (E.C. 18.104.22.168) into glucosaminide, which, when converted into glucosamine, may be activated by hexokinase type IV glucokinases (E.C. 22.214.171.124), which restore the precursor of N-acetylglucosamine-6-P, Glucosamine-6-P, configuring a longer feedback cycle .
Even though chitin itself is found only in the Metazoa-Fungal clade, we can find proteins which are homologous to enzymes involved in chitin synthesis in other clades, including bacterial and archaeobacterial ones. Therefore, the chitin metabolic pathway can be used to recover phylogenetically relevant information in the three life domains.
In this paper, we use the complex network approach as a theoretical and methodological tool to perform a comparative study of the enzymes related to the chitin metabolic pathway in extant organisms of the three life domains, Archaea, Bacteria, and Eukarya. We will show how the information derived from the network structure and statistics can be used to uncover phylogenetically useful modules, retrieving sound biological information by computational routines, without using biological assumptions other than those incorporated by BLAST.
Database and comparative analysis
Our primary database consists of protein sequences of completely sequenced genomes of extant organisms that can be freely accessed at the GenBank - NCBI  (http://www.ncbi.nlm.nih.gov/Genbank/). Protein data provide essential information to the identification of any given organism, as well as to comparative studies on evolutionary paths followed by different organisms. Our data set, downloaded from GenBank at May 19th, 2007, contains information from 1695 organisms. We used completely sequenced genomes to assure that all putative proteins and their isoforms, if any, could be adequately retrieved .
We developed automatic procedures to filter the protein related data in the complete downloaded database. In the first step of the process, we extracted from the primary database the relevant information for the current work, namely, the molecular source of protein sequences, their structural and functional information, and the taxonomic classification of the organisms in which the proteins are found. Next, we scrutinized the secondary database obtained in this manner, in order to identify which proteins (i.e., the organism-specific protein variants that play the same biological function) are present in a large number of organisms. One way to optimize this search, in the sense of finding many organisms with the same protein, is to pre-select a basic biomolecule, such as chitin, and look for the enzymes involved in its metabolism. Indeed, our search revealed that some of the proteins with the largest number of entries in the database are enzymes that take part in the metabolic synthesis or degradation of chitin. In Table 1, we indicate five such enzymes, satisfying the condition of being present in more than 100 organisms from the 1695 original set . The remarkably large number of bacterial records in the database reflects the fact that there are much more completely sequenced organisms of the Bacteria domain than of the Archaea and Eukarya domains.
After identifying the sets of organisms that possessed each of the proteins listed in Table 1, we used BLAST 2.2.15 , with a pairwise alignment, to perform quantitative comparisons among the protein sequences pertaining to each set. From the BLAST outputs, we used in our study the similarity index.
Then, a similarity matrix S was constructed based on the similarity level between protein sequences, where any element of the similarity matrix SijЄ0,100] is the similarity index associated with the protein sequences i and j. Since S is not necessarily symmetric (Sij≠Sji), it is important to consider a symmetric version S, where the elements are defined by Sij = min(Sij,Sji).
The programs were executed both on LINUX- and WINDOWS-running computers. Databases were managed through MySQL. Scripts and auxiliary programs were written in PERL, BASH, C, C++ and FORTRAN 77. PAJEK  was used to generate network images.
In the sub-section Network construction, we describe how we used S to generate complex networks depending on a similarity threshold for each one of the five proteins shown in Table 1. Networks were analyzed by the methods described in the sub-section Network analysis, while the modular patterns generated by complex network approach were biologically interpreted in the light of the phylogenetic relationships of organisms.
Before defining the networks used in this study, let us recall that the most used characterization of network properties is based on a series of measures , including: the number of nodes, N; the shortest path d(i,j) between nodes i and j; the average minimal distance 〈d〉 taken over all pairs of nodes; the network diameter D, defined by the largest value of d(i,j); the node clustering coefficient ci, which measures how strongly connected the neighbors of node i are; the network clustering coefficient C, corresponding to the average value over the ci; the node degree, ki, defined by the number of links of a node i and its average value over all nodes 〈k〉; the functional relationships p(k), the probability distribution of nodes with k links, and C(k), the distribution of node clustering coefficients with respect to the node degree k.
In general, the key step in the construction of a system interaction network is to define a meaningful criterion to place an edge between two nodes, which should be able to identify the presence and strength of the interaction between them. In the current study, the concept of interaction corresponds to protein similarity, which is related, in turn, to the evolutionary relationships between the organisms possessing the proteins at stake . Therefore, the similarity matrix S constitutes the starting point to obtain the protein similarity networks (PSN).
In a PSN, the nodes correspond to the protein sequences, and the presence of edges between two nodes depends on how similar the related proteins are. Each network can be defined by its adjacency matrix (AM) M, for which any matrix element mi,j is set to 1, if the nodes i and j are connected, or to 0, if not. Note that it is straightforward to switch from the AM network description to the list description, in which the network is characterized by a list of L pairs of nodes connected by a link. To be more precise, let us define a network family depending on a threshold value σ, where the elements of its adjacency matrix M(σ) satisfy:(1)
This strategy makes it possible to replace one single weighted network defined in terms of S by a family of unweighted networks, which can be analyzed by a large number of recently developed methods and measures –.
Depending on the value of σ, the interaction network may be completely distinct: for small values of σ it is highly connected, while for large values of σ it is poorly connected. As we will show in the next section, we have performed a detailed investigation of the dependence of the network properties on the value of σ. We are able to establish a well defined criterion for optimal choices of σ, in the sense that the networks generated within a relatively narrow range of values of σ display a modular pattern that can be interpreted in phylogenetic terms, as addressed in the section of results and discussion of the present paper.
To fine tune the value of σ that makes it possible to unveil the modular character, we use the concept of higher order neighborhoods of a node . Two nodes i and j are neighbors of order ℓ when the shortest path between them consists of ℓ edges. In this manner, it is possible to define a ℓ-th order neighborhood of a given network represented by M if we connect all pairs of nodes that are ℓ steps apart. Such networks can be defined in terms of M(ℓ), the corresponding AM of order ℓ. The elements of this matrix are defined as:(2)
The matrix elements of , denoted as i,j, indicate the shortest path between the nodes i and j. If the network is assembled by two or more disjoint clusters, the distance d(i,j) between two nodes, say i and j, belonging to two distinct clusters is ill-defined. In order to sidestep this indeterminacy and continues operating with , we set i,j = 0 whenever this occurs. The importance of for a deeper analysis of the neighborhood structure of a network has been indicated in a series of previous studies –. The utility of ranges from providing an insightful visualization of the neighborhood structure by means of color plots to defining a distance between pairs of networks . This last measure can be used to identify how similar two networks are. For this purpose we define the distance δ(α,β) between any two networks with the same number of nodes (α and β) by:(4)where D(α) represents the diameter of the network α.
In a general comparison process, the obtained value of δ(α,β) depends on the adopted node enumeration for both networks, although the network topology does not depend on it. Therefore, for the purpose of providing a useful measure, the definition (4) can be made more precise by restricting the value of δ(α,β) to the minimal value assumed when all possible node enumerations are taken into account (see ). In the current study, α and β are two distinct protein networks, generated by one same dataset, but where the edges are inserted according to Eq. (1) when we consider α = σ1 = σ and β = σ2 = σ+Δσ. In this definition, we suppose that σ1 and σ2 are two nearby values of σ. Since the nodes represent the same proteins, it is not necessary to consider different enumerations, but just to use the same enumeration to generate both networks. If we plot δ(σ,σ+Δσ) as function of σ, it turns out that the graph is characterized by the presence of sharp peaks. Such series of consecutive values of δ(σ,σ+Δσ) marks the points where the obtained networks are about to suffer important topological changes , i.e., to be split into separate communities.
The value of σ plays a key role in the network definition, which is similar to the probability p to establish an edge in a random Erdös-Rényi network. By varying the value of p, the network changes to an assembly of disconnected edges at p = 0 to a complete graph when p = 1. The most interesting situation, however, occurs in the neighborhood of one critical value pcr≈1/N, which is related to the emergence of a giant cluster that contains the overwhelming majority of nodes.
The investigation reported in this paper is based on the measures defined in the previous subsection, and also in other measures that allow for the identification of modularity properties of the network, if any. Loosely speaking, a module in a network is composed of a sub-set of nodes that are overwhelmingly more connected among themselves than with other network nodes.
The link betweeness degree bij between nodes i and j is the basic concept within the NGA to identify network communities. bij counts the fraction of all shortest paths connecting the N(N−1)/2 pairs of nodes that pass through the (i,j) link, providing a quantitative measure of the relevance of each link for the optimized network information traffic. NGA proceeds by sequentially eliminating the edges with largest value of bij . As a result, it is possible to obtain a network dendrogram where the number of branches increases with the number r of eliminated links. In this way, the dendrogram has one single branch when r = 0 – in the case of a connected network – and N single-node communities when r = L. Each value of r informs the set of nodes that are still connected in a given cluster. Since this is a time consuming program, faster tracks have been proposed to analyze very large networks –, . In the current case, however, we are able to work with this method, given that our networks are not too large.
In our analyses, we used the NGA to identify existing communities for any value of σ. As the detected communities may be quite distinct from one value of σ to another, the NGA results corroborate our claim that the identification of the optimal value of σ using the distance δ is the crucial step of the whole procedure.
To reveal the modular structure of the network, NGA requires a node re-enumeration, a step that is also included in our procedure. Therefore, it is possible to use the re-enumerated form of to visualize the modularity of the protein similarity networks with color plots. The modularity structure becomes quite clear when we draw color plots for the elements of using the same node labeling obtained at the final step of the dendrogram evaluation.
We want to comment further that the concept of distance δ(α,β) can also be used to follow the process of link elimination within NGA. In this particular case, α and β identify two networks characterized by having m and m+1 eliminated links within NGA (see ). A graph of δ(m,m+1) as a function of m indicates, by high peaks, those events of link eliminations that correspond to branching points in the dendrogram. As it was shown in , the distance δ(m,m+1) is able to indicate the branching points in a much clearer way when compared to, e.g., the modularity function Q introduced by Newman and Girvan .
As shown in Table 1, we constructed networks for five enzymes of the chitin metabolic pathway, which provided, in turn, different classifications for the organisms included in the database. In order to quantitatively assess the possible differences between the classification provided by the networks based on different enzymes, say φ and ψ, we evaluated a congruence index G(φ,ψ) according to the following prescription: i) we count the number R(φ,ψ) of common organisms that are present simultaneously in both networks; ii) we look for the correspondence between the different communities from φ and ψ that maximizes the number of matching organisms Q(φ,ψ), i.e., organisms that are placed in the same communities in the two networks. In doing this, we must observe that, if the number of communities in φ and ψ are different, it is necessary to make a correspondence of two or more communities of network φ to the same community in networkψ. The value G(φ,ψ) is defined as the ratio Q(φ,ψ)/R(φ,ψ).
To conclude, the methodology that is applied to generate the results presented in the next section can be summarized in terms of the following steps:
- Select the protein sequences with the relevant information to set up the similarity level between the sequences.
- Compare the protein sequences using BLAST and set up the n×n similarity matrix, being n the number of protein sequences.
- Generate a set of networks associated with the chosen values of the similarity threshold (σ): the nodes correspond to the protein sequences and a link is inserted between a pair of nodes if the similarity between the proteins is larger or equal to σ. In the current case we considered all integer values of σ in the interval [0,100].
- Set up the neighborhood matrix associated with each adjacency matrix.
- Calculate the distance between the networks δ(σ,σ+Δσ), and select for analysis the critical networks, for which the δ(σ,σ+Δσ) assumed the local maximal value.
- For the critical networks, apply the Newman Girvan algorithm (NGA), removing the edges with the maximal value of edge betweenness until there is no link at all.
- In order to detect the modular structure of the network, set up the dendrogram for the critical network as well as the color representation of the neighborhood matrix.
- Calculate the congruence index G(φ,ψ) to quantitatively assess the differences between the classification provided by the distinct networks.
Here, we present and discuss results concerning the modular structure of protein similarity networks provided by our method that are useful for phylogenetic inferences. To be concise, we provide a detailed discussion of the results obtained for two proteins in Table 1: UDP-acetylglucosamine pyrophosphorylase (to which we will refer below as UDP) and acetylglucosamine phosphate deacetylase (Acetyl). Then, we will provide a comparative analysis of the results for the networks of all the five proteins investigated in this study, in order to provide evidence for the classification consistency of the method.
Let us now illustrate how the behavior of δ(σ,σ+Δσ) provides a precise way of characterizing the dependence of the networks on σ (step (E) in the summary of the methodology presented in the previous section). This behavior is illustrated in Figure 1a for the Acetyl network. The results were obtained by making the values of σ differ in Δσ = 1%. The graph shows three well defined maxima of δ(σ,σ+Δσ) for σ in the interval [30%,50%], the largest of which occur at σ = σmax = 42%. These results should be interpreted as follows: if σ = 0, the network consists of a completely connected single cluster. By increasing the value of σ, we restrict the number of bonds in the network, so that 〈d〉 increases together with the values of the matrix elements . Since the distance δ(σ,σ+Δσ) makes a comparison of the influence of changing σ on d(i,j), a sharp increase in its value indicates that the bond removal is leading to large changes in the values of some of d(i,j). This suggests also that important network topological changes are about to occur. The most drastic events, expressed by the first sharp peaks, are usually related to the disassembling of one large set of nodes (module) from the original, completely connected cluster. This network, which we will call the critical network, is selected to be analyzed. Later on, smaller peaks indicate the splitting of larger modules into smaller ones. This occurs when the last bonds linking these modules to the network are removed. The very high peak at σ = σmax = 42% indicates that a large topological change occurred at this particular value.
The same scenario is observed in Figure 1b for the δ(σ,σ+Δσ) results obtained from the UDP network. Note that the peaks occur at higher values of σ, in comparison to the Acetyl network, and a richer structure of peaks of comparable sizes is found. Despite these quantitative changes, the two graphs show similar features, representing the kinds of structural changes in the network due to the variation of the threshold similarity value.
The presented interpretation of the influence of σ on δ(σ,σ+Δσ) is corroborated by other network measures. Let us consider how Nc, the size of the largest connected component in the network, depends on σ. This is illustrated in Figures 2a and 2b for the Acetyl and UDP networks, respectively (see also ). In both figures we notice a rapid decrease of Nc in a relatively narrow interval of values of σ. This effect is related to the detachment of large groups of nodes from the main cluster as the restriction on establishing links between nodes is increased. As anticipated in the previous section, the curves follow the same qualitative features as those for the Erdös-Rényi networks as a function of the attachment probability p close to pc. Figures S1 and S2 illustrates how δ and Nc depend on p for networks with the average size of the analyzed PSN's (N = 256) and also in the limit of large N (see also Text S1).
Hereafter, we will consider the dendrograms, the neighborhood matrices, and the usual representation of the network associated with the proteins listed in Table 1 for the values of σ such that the distance shown in Figures 1a and 1b assumes a maximum value. Concerning UDP, the figures are not shown, since they were already presented in a previous paper , in which the criterion for setting up the range of σ that reveals the modular structure of network was based on the region of transition associated with C and 〈d〉. It is important to call the attention to the fact that the criterion based on the distance δ(σ,σ+Δσ) reveals in a much more precise way, in comparison to C and 〈d〉, the value of σ in which the modular structure is observed.
The influence of σ on the network structure can be better appreciated by comparing two dendrograms in Figure 3 for the Acetyl networks at σ = 30% and σ = σmax = 42%. In the first situation (Figure 3a), the very large number of edges does not allow one to perceive the system modular structure. Accordingly, the NGA based on bij is characterized by a progressive detachment of small groups of nodes from the original giant cluster. In turn, the dendrogram for σ = σmax (Figure 3b) reveals a lot of structure. It starts, at r = 0, with some already isolated clusters, corresponding to the modules that were detached at σ = σmax, σ = 45%, and σ = 48%. Then, we note the separation of a large cluster at a low value of r, which is caused by the elimination of the few bonds with very large betweenness degree connecting nodes of the different modules. Such cluster detachment is exactly the same one produced by increasing the value of σ to 42%, causing the absolute δ(σ,σ+Δσ) maximum in Figure 2a. The subsequent elimination of bonds leads to further branching in the dendrogram, some of which can be related to local maxima in the σ>σmax region of the δ(σ,σ+Δσ)×σ plot.
Dendrograms evaluated at intermediate σ values, e.g., σ = 40%, are able to clearly identify network modules corresponding to those clusters detached from the giant cluster by selecting σ close to this peak value at σmax. However, the picture that emerges for those clusters that detach at larger values is still rather blurred.
As anticipated in the previous section, let us put together supplementary results in the dendrogram construction to display the network modular structure with the help of the neighborhood matrix . To avoid line crossings in the dendrogram, the order at which the isolated nodes are drawn for the largest value of r does not necessarily follow the original numbering. This ordering defines a new node labeling which leaves untouched the network topology. If we now use a color code to represent with relabeled nodes, the modularity structure becomes quite clear, as shown in Figure 4. Running from blue (immediate neighbors) to red (farthest apart nodes), the colors clearly indicate how the nodes are grouped into modules, as well as the existence of sub-clusters within the modules and the average distance between nodes in distinct modules. Note that we use gray to indicate the value d(i,j) = 0, so that the communities that have been detached from the main cluster at lower values of σ appear isolated from one another in the color diagram. We identify 11 modules (C1–C11), the biological significance of which will be discussed below. We note also a number of isolated nodes or small sub-graphs that do not constitute a module on its own. Figure 4 shows the color plot for the neighborhood structure for the Acetyl network at σ = σmax. It is relatively easy to infer the structure of the dendrograms from the position of the modules. It is important to stress that both graphs not only show the modular structure of the network, but also clearly depict how the retrieved communities are related to each other.
The information obtained from the described procedure can be also used for the usual network representation formed by nodes and links. In Figure 5, we draw such representation for the Acetyl network at σ = σmax. Here, the colors used to draw the nodes represent the different communities they belong to. The set of isolated nodes and small sub-graphs is characterized by the C12 label.
We label as C12 the small sub-graphs and isolated nodes that do not constitute a biologically meaningful community.
This discussion shows that the proposed method allows us to find the most relevant networks, namely those at critical values of σcr. These values, where the network topology changes abruptly, correspond to optimal choices between inter-community edge elimination (noise effect) and intra-modules bond preservation (valuable information). They allow us to identify distinct communities, which can be related, then, to the sets of organisms to which the proteins belong (see also Figures S3, S4, S5, S6 and S7). We observe that σmax corresponds to the particular σcr, where δ(σcr,σcr+Δσ) reaches the largest value.
We show in Table 2 the values of σmax, the number of nodes, and the number of communities obtained for each of the five enzyme networks. In the case of UDP, we observe the highest σmax value, indicating that, in the case of this protein, the disassembling of the original, completely connected cluster happen at higher values of similarity. This is a protein with a central role in the chitin synthesis, and, consequently, it is not surprising that it shows the greatest degree of sequence conservation throughout evolution, among the proteins studied in this work. This suggests additional features of the method discussed here, in that there is a relationship between the σmax value, the degree of sequence conservation of proteins (a structural feature), and their centrality in metabolic networks (a functional feature).
It is relevant to notice that, up to this point, all discussed results have been obtained without any previous knowledge of phylogenetic classification. We only constructed computer routines to proceed with the data analysis, network construction, and network analysis, leading to community identification.
If we now interconnect the results discussed above with taxonomic and phylogenetic data, sound biological information can be promptly retrieved by these computational routines, without using biological assumptions other than those incorporated by BLAST in the production of its outputs.
The Acetyl modules that can be identified at σ = σmax (Figure 4) correspond, in a clear and rather precise manner, to bacterial phyla and/or classes (and even orders, in some communities). As already discussed, we restricted our analysis to those phyla due to the fact that most of the protein sequences in the database were derived from this biological domain. All cyanobacterial representatives formed only one and exclusive group retrieved in the module C8(a). Furthermore, there are six communities [C3(a), C4(a), C5(a), C6(a), C7(a), C10(a), C11(a)] that are formed exclusively by representatives of one single bacterial phyla or class and, in some cases, order: community C3(a) is exclusively formed by species of the same bacterial order (Mollicutes); community C4(a) are all composed of representatives of Actinobacteria, high G+C Gram-positive monoderm bacteria, of the same class (Actinomycetales); community C5(a) exclusively includes alpha-proteobacteria of the class Rhodobacterales; and community C11(a) contains only species of Firmicutes, low G+C Gram-positive monoderm bacteria, belonging to the very closely related orders Bacillales and Lactobacillales. Although not entirely composed of representatives of the same phyla, 18 out of 20 nodes (90%) of community C2(a) are from the same bacterial phyla (Proteobacteria) and 16 (80%) are from the most phylogenetically related classes of beta- and gamma-proteobacteria .
Four modules are retrieved in the Glucosaminephosphate isomerase (gluco) network at σ = σmax = 40%, and, as in the case of UDP and Acetyl, most of them correspond to single bacterial phyla and/or classes (and even orders): community C2(g) is exclusively composed by bacterial representatives of phyla Firmicutes of only two classes: Bacillales and Lactobacillales; community C4(g) is entirely formed by sequences of the order Alteromonadales of the class gamma-proteobacteria; and 21 out of 23 sequences (91.3%) of community C3(g) are representatives of the phyla Proteobacteria (Figures S5a, S6a, and S7a).
A total of 9 modules occur in the Hexosaminidase (hexo) network at σ = σmax = 37% and three of them, which contain the greatest number of nodes, are almost exclusively formed by only one bacterial phyla or class: Community C1(h) is composed of 97 nodes, of which 95 (98%) are representatives of phyla Proteobacteria; community C2 is almost exclusively formed by species of the class alpha-proteobacteria; and community C4(h) contains only members of the most phylogenetically related classes of beta- and gamma-proteobacteria . The other communities are all composed by few nodes corresponding to species of distinct phyla (Figures S5b, S6b, and S7b).
Five modules occur in the Phosphoglucoisomerase (phospho) network at σ = σmax = 37% and, similarly to the other enzymes of the chitin metabolic pathway, there is a rather strict correspondence between these modules and bacterial phyla. Community C1(p) is mainly composed by cyanobacterial representatives (71%), community C2(p) is almost exclusively formed by species of Firmicutes (96.4%), and the very large community C5(p), with 328 nodes, is mainly represented by sequences of Proteobacteria (76%) (Figures S5c, S6c, and S7c).
Finally, UDP can be decomposed into 6 clearly identified modules C1(u)–C6(u), as has been shown previously . C1(u) is composed by 16 nodes, 14 (87.5%) of which are protein sequences from representatives of the phylum Cyanobacteria. One of the nodes corresponds to a sequence from a species of Deinococcus-Thermus, a Gram-negative diderm bacterial group of extremophiles that is closely related to Cyanobacteria . C2(u) contains 135 nodes and, among them, 132 (97.8%) are sequences from species of both beta- and gamma-proteobacteria, which are considered to be more closely related to each other than to any other proteobacterial class . C3(u) is entirely constituted by 80 sequences from Firmicutes species, of three phylogenetically related orders: Bacillales, Lactobacillales, and Clostridiales. C4(u) contains 33 vertices, of which 31 (93.4%) are sequences from the presumed monophyletic group of alpha-proteobacteria . C5(u) is entirely formed by sequences from Actinobacteria, all from the same order: Actinomycetales. Finally, C6(u) comprises only nine nodes from the putative monophyletic group of epsilon-proteobacteria , all from the same order: Campylobacterales.
Usually, all the main bacterial phyla (Actinobacteria, Cyanobacteria, Firmicutes, Proteobacteria) and, in some cases, also some bacterial classes (alpha-, beta- and gamma-Proteobacteria), corresponded totally (100%), or with a substantial number of representatives (>70%), to the modules formed as a result of the complex network analysis of the proteins of the chitin metabolic pathway. Even when there were few completely sequenced genomes exhibiting one of the studied proteins, all the representatives of the same phyla were generally grouped together in the same community.
In each of the protein networks, the nodes with the highest degree numbers, or hubs, occurred inside the same community. Although these hubs were not the same in the five different protein networks, many of them were from the same bacterial species for distinct proteins, e.g. Yersinia pestis for gluco, hexo, and UDP; Escherichia coli for acetyl, hexo, and UDP. In contrast to all other proteins, the hubs in the gluco network were mainly archeal representatives.
Internal consistency and comparison with phylogenetic methods
The results for a phylogenetic analysis provided by several distinct methods do not necessarily agree with each other, as one can verify by a direct comparison of the outputs produced by each of them. Although we will not make here a detailed comparison between our method and other procedures used to recover phylogenetically useful information, but limit ourselves to take into account the classification obtained for the original dataset, we are in a position to discuss the internal consistency of our method.
The modules defined by the five different enzymes do not necessarily agree with each other for two distinct reasons: first, because not all organisms possess all the enzymes involved in the chitin pathway. This is already clear by the different number of nodes in each of the five networks. Second, because during the course of evolution some enzymes may have suffered more changes than the corresponding enzyme in other organisms, so that the similarity index Sij between organisms i and j may take distinct values for two different enzymes. Such quantitative changes may alter the way the organisms are arranged into communities in the corresponding networks. In particular, it may happen that different networks produce distinct number of communities because different enzymes may have changed to a different extent in the organisms, so that one organism may belong to different communities in the networks obtained for different enzymes. Since the same protein may have been independently inserted more than once into the database during the process of uploading the recordings available in Genbank, we have found that the number of distinct organisms in each of the 5 networks is always smaller than the number of nodes (Table 2). We avoided, then, to advance biological hypotheses before the elimination of the isoforms.
The congruence of the classification provided by the distinct networks obtained for the five enzymes of the chitin metabolic pathway was evaluated by means of the congruence index G(φ,ψ), defined in the previous section as the ratio Q(φ,ψ)/R(φ,ψ). For instance, if we take into account the classifications provided by acetyl and UDP we notice that they consist, respectively, of 176 and 327 nodes, which actually correspond to 88 and 245 organisms, distributed into 12 and 7 communities (Table 2). The number of common organisms and correct matches are R(φ,ψ) = 44 and Q(φ,ψ) = 40, so that G(φ,ψ) = 0.91. The results for the other pairs of networks are shown in Table 3.
In Figure 6 we display the results obtained from the community identification for all 5 networks (In Figure S8, one can see the same figure with the horizontal axis expanded for better visualization). In this representation we take into account only the number of 382 distinct organisms represented by the original 1695 entries. The used association (number, organism) is available in the Supplementary Information. Each of the five networks is represented by a horizontal sequence of spikes, which identify which organisms are present in each network. Within a given network, the color of the spikes identifies to which community the organism belongs. Since different networks have different numbers of communities, there is no color correspondence between distinct network classifications. Congruence can be measured by the same color criterion: if the spikes corresponding to organisms i and j have the same color in network φ and network ψ, the classification provided by φ and ψ is congruent, even if the common color in φ is different from the common color in ψ.
Along each series of spikes, color identifies the group the organisms belong to. There is no color correspondence between two network classifications.
The subsequent steps of our research program comprise a detailed comparison between the results obtained with the complex network approach reported in this paper and the outcomes of other methods used to analyze phylogenetic relationships based on molecular data. Although this is a computationally complex task , , the results of which need to be discussed in another work, it is possible to advance that preliminary results for a much smaller data set than that used herein are promising – namely, data about chitin synthase, another protein of the chitin metabolic pathway. Using the PAUP 4.0 program  to perform distance, likelihood, and parsimony analyses, and Mr. Bayes 3.02  to perform Bayesian analysis, we provided a comparison between the proposed phylogenetic classification with those based on the Bayesian, distance, likelihood, and parsimony criteria. The results shown in Table 4 are based on the same congruence criterion we used to compare the data in Table 3. In particular, the average congruence of our method with the four other methods reaches 69%, while the average taken over the six pair-wise comparisons among the four methods (B, D, L. P) reaches only 60%. These results allow us to conclude that the methodology reported in this paper is as reliable as those commonly used methods.
This work reports a method based on complex network theory that can recover information about the evolutionary relationships between organisms, as expressed in the similarities and differences between their protein sequences, which is useful for phylogenetic inference. The system interaction network constructed is based on protein similarity as the meaningful criterion to place an edge between two nodes. Each node in the network is a specific protein sequence and the placement of edges depends on a threshold value σ, related to the protein similarity required to such a placement.
We performed a comparative study of the enzymes related to the chitin metabolic pathway in completely sequenced genomes of extant organisms of the three life domains, Archaea, Bacteria, and Eukarya, in order to show how the information derived from the network structure and statistics can uncover phylogenetic patterns. The results concerning phylogenetic classification discussed in this paper are mainly based on the modular character of protein similarity networks. Once the critical value of σ (σcr) using the distance measure δ(α,β) is found, we can choose the optimal network for community detection, namely, that in which the network topology changes abruptly, corresponding to optimal choices between inter-community edge elimination (noise effect) and intra-modules bond preservation (valuable information). Although the NGA can be used to identify communities for any value of σ, it is in this optimal network that the best results can be achieved with regard to the identification of distinct communities, which can be related, in turn, to the sets of organisms to which the proteins belong.
With this method, sound biological information can be promptly retrieved by computational routines, without using biological assumptions other than those incorporated by BLAST. Usually, all the main bacterial phyla and, in some cases, also some bacterial classes corresponded to a great extent (70%–100%) to the modules obtained by means of the complex network analysis of the proteins of the chitin metabolic pathway. Therefore, the method reported here can be used as a powerful tool to reveal relationship patterns among both organisms we have knowledge about and organisms about which we do not have much information available.
We provided results showing the internal consistency of the results obtained through our method for the data corresponding to five different enzymes. Despite the different rates of changes suffered by these enzymes during evolution, we found 84% of matches for community pertinence when comparisons between the results were performed. Moreover, a preliminary comparison between the results obtained with the complex network approach reported here and the outcomes of methods based on Bayesian, distance, likelihood, and parsimony criteria suggests that the methodology reported in this paper is as reliable as these commonly used methods.
There are, however, some possible advantages of the complex network method when compared to these other methods. One of them concerns the fact that we can determine the value of σ in which the complex network retrieve most of the phylogenetic information available in the data set. Second, even though all these methods use substitution matrices – including ours –, the complex network method is not dependent upon patterns inferred from the detailed study of any organisms.
The next steps in our research program will be the application of the method presented here to new sets of protein sequences, a more thorough comparison of the results obtained through our complex network approach with the outcome of other methods employed to retrieve information from molecular data that is useful for phylogenetic inference, and the application of our method to address relevant research questions within different fields of biology.
Graphs of δ(p,p+Δp) as function of p for N-nodes ER networks (G(N,p)), where p indicates the probability of introducing an edge between any pair of nodes. For the sake of a better comparison, p is restricted to the interval [0,5pc = 5/N] for any value of N. The solid line indicates the average behavior (10 samples when N = 256 (a), and 3 samples when N = 4096 (b)), while dashed lines illustrate the typical behavior of a single sample. The values of p where peaks are present are much smaller than the corresponding values of σ in PSN. When N = 256, the typical order of magnitude of the protein networks, distinct modules of comparatively large size are individually formed. The several peaks indicate the values of p at which different modules merges, producing a similar landscape to that observed in the PSN networks. The maximum of the averaged curve occurs at values of p>pc. When N increases (b), the fluctuations in the values of δ(p,p+Δp) decrease and the maximum is displaced to the left, becoming closer and closer to pc. The peak is much sharper, and the slope of the curve in its neighborhood is much larger. This indicates that the number of components of relatively large size is reduced, and that all smaller clusters start to merge with the largest component in very narrow interval of values of p.
(0.11 MB TIF)
Behavior of the size of the largest connected component Nc as function of p for ER networks G(N,p). As in Fig. S7, for any value of N, p is restricted to the interval [0,5pc = 5/N], while solid and dashed lines indicate average and single sample behavior. For both values of N, the values of Nc at pc are close to the expected value (Nc(pc)≈N2/3). However, the slope of the curve is much larger when N = 4096, what can be related to the exponential increase in Nc(p>pc) in the limit N→∞ and the sharpness of the peak of δ(p,p+Δp).
(0.08 MB TIF)
The size of the largest cluster (Nc) versus the threshold similarity σ: a) Gluco; b) Hexo; c) Phospho.
(0.16 MB TIF)
The distance δ(σ,σ+Δ σ) between networks for successive similarities at the maximal value in the case of: a) Gluco at σ = σmax = 40%; b) Hexo at σ = σmax = 37%; c) Phospho at σ = σmax = 37%.
(0.25 MB TIF)
The dendrogram associated with the elimination of links with largest value of betweeness in the case of: a) Gluco at σ = σmax = 40%; b) Hexo at σ = σmax = 37%; c) Phospho at σ = σmax = 37%.
(0.38 MB TIF)
The neighborhood matrix with the communities for: a) Gluco at σ = σmax = 40%; b) Hexo at σ = σmax = 37%; c) Phospho at σ = σmax = 37%. The presence of other high peaks for the Gluco network shown in Fig.S2a indicates that the complete separation of communities C1 and C2, and C3 and C4 is achieved only at σ = 50%.
(2.18 MB TIF)
The standard representation of each enzyme network (using the Pajek package) displaying the communities that were indicated in Fig. 4a, 4b and 4c respectively: a) Gluco at σ = σmax = 40%; b) Hexo at σ = σmax = 37%; c) Phospho at σ = σmax = 37%. One extra label has been added in each panel to denote the set of isolated nodes and small sub-graphs. Note that figures were drawn for the value σmax and module separation occurs only at σmax+1, so that these set is about to be separated from the main cluster.
(3.61 MB TIF)
Same as in Fig. 6 of the published material, but the horizontal axis has been expanded for the sake of a better visualization. Color codes and network order is the same as in the published material.
(1.76 MB TIF)
Supplementary material for the paper “Detecting Network Communities: An Application to Phylogenetic Analysis.”
(0.03 MB DOC)
The authors thank José Garcia V. Miranda and Ernesto P. Borges for the collaboration during the development of the study. M.V.C.D and A.G.N. received the institutional support of PPGBiotec (UEFS-Fiocruz-BA) (www.uefs.br/ppgbiotec). Moreover, the authors are indebted to two anonymous referees, who contributed to the improvement of our manuscript.
Conceived and designed the experiments: RFSA ICRN LBLS TPL AGN STRP CNEH. Performed the experiments: RFSA ICRN LBLS CNdS MVCD STRP. Analyzed the data: RFSA ICRN LBLS CNdS MVCD TPL AGN STRP CNEH. Wrote the paper: RFSA TPL AGN STRP CNEH.
- 1. Silva E, Stumpf MPH (2005) Complex networks and simple models in biology. J R Soc Interface 2: 419–430.
- 2. Strogatz SH (2001) Exploring complex networks. Nature 410: 268–276.
- 3. Barabási AL, Oltvai ZN (2004) Network biology: Understanding the cell's functional organization. Nat Rev Genet 5: 101–13.
- 4. Amaral LAN, Ottino JM (2004) Complex networks: Augmenting the framework for the study of complex systems. Eur Phys J B 38: 147–162.
- 5. Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: Simples building blocks of complex networks. Science 298: 824–827.
- 6. Bahn A, Galas DJ, Dewey TG (2002) A duplication growth model of gene expression networks. Bioinformatics 18: 1486–1493.
- 7. Gavin AC, Bösche M, Krause R, Grandi P, Marzioch M, et al. (2002) Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature 415: 141–147.
- 8. Gavin AC, Aloy P, Grandi P, Krause R, Boesche M, et al. (2004) Proteome survey reveals modularity of the yeast cell machinery. Nature 440: 631–6.
- 9. Bersini H, Lenaerts T, Santos FC (2006) Growing biological networks: Beyond the gene-duplication model. J Theor Biol 241: 488–505.
- 10. Boone C, Bussey H, Andrews BJ (2007) Exploring genetic interactions and networks in yeast. Nat Rev Genet 8: 437–449.
- 11. Pieroni E, van Bentem SDLF, Mancosu G, Capobianco E, Hirt H, et al. (2008) Protein networking: Insights into global functional organization of proteomes. Proteomics 8: 799–816.
- 12. Castro-e-Silva A, Weber G, Machado RF, Wanner EF, Guerra-Sá R (2008) Identity transposon networks in D. melanogaster. In: Bazzan ALC, Craven M, Martins NF, editors. BSB 2008, LNBI 5167. Berlin: Springer. pp. 161–164.
- 13. Felsenstein J (2004) Inferring phylogenies. Sunderland, MA: Sinauer. 580 p.
- 14. Fortunato S (2010) Community detection in graphs. Phys Rep 486: 75–174.
- 15. Parter MA, Onnela J-P, Mucha P (2009) Communities in Networks. Not Am Math Soc 56: 1082–1097.1164–1166
- 16. Schaeffer SE (2007) Graph Clustering. Comput Sci Rev 1: 27–64.
- 17. Danon L, Diaz-Guilera A, Duch JD, Arenas A (2005) Comparing community structure identification. J Stat Mech Theory E P09008.
- 18. Kovács IA, Palotai R, Szalay MS, Csermely P (2010) Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics. PLOS One 5: e12528.
- 19. Van Dongen S (2000) Graph Clustering by Flow Simulation. Amsterdam: Centre for Mathematics and Computer Science.
- 20. Van Dongen S (2008) Graph Clustering Via a Discrete Uncoupling Process. SIAM J Matrix Anal A 30: 121–141.
- 21. Enright AJ, van Dongen S, Ouzonis CA (2002) An efficient algorithm for large-scale detection of protein families. Nucleic Acids Res 30: 1575–1584.
- 22. Li L, Stoeckert CJ Jr, Roos DS (2003) Genome Res. 13. : 2178–2189.
- 23. Robbertse B, Reeves JB, Schoch CL, Spatafora JW (2006) A phylogenomic analysis of the Ascomycota. Fungal Genet. Bio 43: 715–725.
- 24. Harlow TJ, Gogarten JP, Ragan MA (2004) A hybrid clustering approach to recognition of protein families in 114 microbial genomes. BMC Bioinformatics 5: 45.
- 25. Tetko IV, Facius A, Ruepp A, Mewes HW (2005) Super paramagnetic clustering of protein sequences. BMC Bioinformatics. 6. 82 p.
- 26. Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69: 026113.
- 27. Bowmann SM, Free SJ (2006) The structure and synthesis of the fungal cell wall. Bioessays 28: 799–808.
- 28. Hanlon RT, Messenger JB (1996) Cephalopod behaviour. Cambridge: Cambridge University Press.. 232 p.
- 29. Ax P (1996) Multicellular animals: A new approach to the phylogenetic order in nature. Berlin: Springer.. 225 p.
- 30. Merzendorfer H (2006) Insect chitin synthases: A review. J Comp Physiol B 176: 1–15.
- 31. Mio T, Yabe T, Arisawa M, Yamada-Okabe H (1998) The Eukaryotic UDP N-acetylglucosamine pyrophosphorylases: Gene cloning, protein expression, and catalytic mechanism. J Biol Chem 273: 14392–14397.
- 32. Lagorce A, Berre-Anton V, Aguilar-Uscanga B, Martin-Yken H, Dagkessamanskaia A, François J (2002) Involvement of GFA1, which encodes glutamine–fructose-6-phosphate amidotransferase, in the activation of the chitin synthesis pathway in response to cell-wall defects in Saccharomyces cerevisiae. Eur J Biochem 269: 1697–1707.
- 33. Pirovani CP, Hora-Júnior BT, Oliveira BM, Lopes MA, Dias CV, et al. (2005) Knowledge discovery in genome database: The chitin metabolic pathway in Crinipellis perniciosa (Stahel)Singer. In: Mondaini R, editor. Proceedings of IV Brazilian Symposium on Mathematical and Computational Biology/I International Symposium on Mathematical and Computational Biology. Rio de Janeiro: E-Papers Serviços Editoriais LTDA. v. 1. pp. 122–139.
- 34. Benson DA, Boguski MS, Lipman DJ, Ostell J, Ouellette BF, et al. (1999) Genbank. Nucleic Acids Res 27: 12–17.
- 35. Góes-Neto A, Diniz MVC, Santos LB, Pinho ST, Miranda JG, et al. (2010) Comparative protein analysis of the chitin metabolic pathway in extant organisms: A complex network approach. Bio Systems 101: 59–66.
- 36. Altschul SF, Madden TL, Schäffer AA, Zhang J, Zhang Z, et al. (1997) Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucleic Acids Res 25: 3389–3402.
- 37. Batagelj V, Mrvar A (2003) Pajek - Analysis and visualization of large networks. In: Jünger M, Mutzel P, editors. Graph drawing software. Berlin: Springer. pp. 77–103.
- 38. Albert R, Barabási AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74: 47–97.
- 39. Newman MEJ (2003) The Structure and Function of Complex Networks. SIAM Review 45: 167–256.
- 40. Boccaletti S, Latora V, Moren Y, Chavez M, Hwang D-U (2006) Complex Networks: structure and dynamics. Phys Rep 424: 175–308.
- 41. Costa LF, Rodrigues FA, Travieso G, Villas-Boas PR (2007) Characterization of complex networks: A survey of measurements. Advances in Physics 56: 167–242.
- 42. Andrade RFS, Miranda JGV, Lobão TP (2006) Neighborhood properties of complex networks. Phys Rev E 73: 046101.
- 43. Andrade RFS, Pinho STR, Lobão TP (2009) Identification of community structure in networks using higher order neighborhood concepts. Int J Bifurc Chaos 19: 2677–2685.
- 44. Andrade RFS, Miranda JGV, Pinho STR, Lobão TP (2008a) Characterization of complex networks by higher order neighborhood properties. Eur Phys J B 61: 247–256.
- 45. Andrade RFS, Miranda JGV, Pinho STR, Lobão TP (2008b) Measuring distances between complex networks. Phys Lett A 372: 5265–5269.
- 46. Newman MEJ (2004) Fast algorithm for detecting community structure in networks”. Phys Rev E 69: 066133.
- 47. Gupta RS, Sneath PHA (2007) The phylogeny of Proteobacteria: Relationships to other eubacterial phyla and eukaryotes. J Mol Evol 64: 90–100.
- 48. Gupta RS (2001) The branching order and phylogenetic placement of species from completed bacterial genomes, based on conserved indels found in various proteins. Inter Microbiol 4: 187–202.
- 49. Allen BL, Steel M (2001) Subtree transfer operations and their induced metrics on evolutionary trees. Ann Comb 5: 1–15.
- 50. Bordewich M, Semple C (2007) Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Appl Math 155: 914–928.
- 51. Swofford DL (1998) PAUP*: Phylogenetic Analysis Using Parsimony (*and Other Methods), Version 4. Sunderland: Sinauer Associates.
- 52. Roquist F, Huelsenbeck JP (2003) MRBAYES 3: Bayesian phylogenetic inference under mixed models. Bioinformatics 19: 1572–1574.