- Research article
- Open Access
From protein interactions to functional annotation: graph alignment in Herpes
© Kolář et al; licensee BioMed Central Ltd. 2008
- Received: 24 April 2008
- Accepted: 28 October 2008
- Published: 28 October 2008
Sequence alignment is a prolific basis of functional annotation, but remains a challenging problem in the 'twilight zone' of high sequence divergence or short gene length. Here we demonstrate how information on gene interactions can help to resolve ambiguous sequence alignments. We compare two distant Herpes viruses by constructing a graph alignment, which is based jointly on the similarity of their protein interaction networks and on sequence similarity. This hybrid method provides functional associations between proteins of the two organisms that cannot be obtained from sequence or interaction data alone.
We find proteins where interaction similarity and sequence similarity are individually weak, but together provide significant evidence of orthology. There are also proteins with high interaction similarity but without any detectable sequence similarity, providing evidence of functional association beyond sequence homology. The functional predictions derived from our alignment are consistent with genomic position and gene expression data.
Our approach shows that evolutionary conservation is a powerful filter to make protein interaction data informative about functional similarities between the interacting proteins, and it establishes graph alignment as a powerful tool for the comparative analysis of data from highly diverged species.
- Protein Interaction Network
- Virion Assembly
- Twilight Zone
- Graph Alignment
- Link Score
With the advent of genome-wide functional data, cross-species comparisons are no longer limited to sequence information. A classic extension of sequence alignment is structural alignment, which has been used to compare evolutionary distant RNAs  and proteins conserved in structure rather than sequence [2, 3]. Here we use protein interactions as evolutionary information beyond sequence .
We perform a cross-species analysis of two herpesviruses, the varicella-zoster virus (VZV), causing chicken pox and shingles, and the Kaposi's sarcoma-associated herpesvirus (KSHV), responsible for cancer of the connective tissue. The two viruses have diverged approximately 200 million years ago. Their sequence dynamics is characterised by a high rate of point mutations (at least an order of magnitude faster than their host populations ) and a high rate of gain and loss of genes (an order of magnitude higher than the mutation rates of prokaryotes ). As a result, homologous proteins have an amino acid sequence identity of only about 20%. Moreover, many open reading frames are only about 60 amino acids long. Thus, the sequence similarity between the two species is in the 'twilight zone' of detection by alignment, i.e., orthologous open reading frames have alignment scores just marginally above the background of unrelated sequences.
To improve the cross-species comparison, we jointly use the similarity of coding sequences and of protein interactions. Our hybrid comparison method called graph alignment establishes a mapping between genes of two species  using a probabilistic scoring system based on evolutionary rates of sequences and interaction networks. Several recent studies have used orthologs identified by sequence similarity to compare networks, for instance to identify ancestral networks , network parts enriched in conserved links [9–11] or to decide between paralogous genes, see . Here this approach is turned on its head: we use network information to identify evolutionary and functional relationships in cases where there is no detectable sequence similarity. Related approaches appeared in [13–16], reviewed in [17, 18].
However, these approaches use ad-hoc scoring parameters, or parameters derived from a database of known orthologous genes  to determine the alignment. Our method uses an evolutionary model to infer all necessary parameters from the data set itself. In ref.  we have applied this method to co-expression networks, which are fully connected. Here we explore the complementary regime of sparsely connected networks with noisy link and node similarity data, where graph alignment is used to resolve the twilight regime of evolutionary correlations. In this regime, statistically significant alignments have to be distinguished from a low-fidelity regime of spurious graph alignments. Understanding the statistics of graph alignment in both regimes turns out to be important for validation of the results in the twilight regime.
The essence of our graph alignment approach is as follows: Experimental data on interacting proteins defines a protein interaction network consisting of nodes (proteins) and links (protein interactions). At this point, nodes can simply be labelled by a protein name, or ORF identifier, without recourse to sequence information. The local link similarity between pairs of aligned nodes defines the link score of the alignment. Aligned nodes can either both interact (resulting in a positive link score, e.g. nodes A', D' and A*, D* in Fig. 1), both not interact (resulting in a small positive link score), or interact in one species and not in the other (resulting in a negative link score). The sequence similarity between aligned nodes defines their node score. The total score is the sum of link and node terms, with scoring parameters depending on the evolutionary distance between the species compared. Finding high-scoring graph alignments is an algorithmically hard problem, and we use the algorithm introduced in  to perform the search. However, since many proteins have no clear sequence ortholog and few interaction partners, it turns out that high-scoring alignments are not guaranteed to be statistically or biologically significant. There exists a regime of spurious alignments consisting of islands of locally matching topology which do not respect sequence similarity: the low-fidelity regime discussed further in the methods section. It turns out that optimal alignments are produced using scoring parameters in the high-fidelity regime close to the transition to the low-fidelity regime.
For the graph alignment between the VZV and KSHV viruses studied here, both the interaction networks and the gene sequences are crucial to determine functional or evolutionary relationships, while each part of the data by itself is less significant. In particular, we find protein pairs with low sequence similarity for which the interaction similarity strengthens the statistical inference of homology, as well as protein pairs without sequence similarity, which are aligned based on their interactions alone. We use this alignment to make functional predictions, which turn out to be consistent with published gene expression data, as well as gene position and molecular weight. Given a validated alignment, we can quantify the evolution of protein interactions. We find that interactions between functionally related proteins are more conserved than other interactions.
Optimal graph alignment between VZV and KSHV
In some cases, sequence similar pairs of ORFs are not aligned because of mismatched interactions. As an extreme case an ORF may have several interactions in one species, but none in the other, indicating most likely an unsuccessful yeast-two-hybrid assay (Y2H) experiment. Examples are KSHV ORF64/VZV ORF22, 22/37, 42/53, 36/47, and 33/44.
Functional relationships detected by interaction similarity
Some ORFs are aligned due to their matching interactions, either with low or with no detectable sequence similarity. We discuss these cases separately.
KSHV ORF67.5/VZV ORF25
These ORFs have a sequence identity of only 18% over 76 aa (see Methods for details). They are listed as homologs in the VIDA3 database , and both of them are thought to be homologs of the HHV-1 protein UL33 . The alignment of these ORFs largely results from 4 matching links out of 5 in KSHV and 12 in VZV (p-value of 4 × 10-3, [see Additional file 1]) with a local link score S L = 4.57 versus node score S N = 4.20. Our alignment thus confirms the homology.
KSHV ORF28/VZV ORF65
These ORFs have a sequence identity of only 11% over 102 aa. They are not listed as sequence homologs in databases VOCS , VIDA3  and NCBI . However, the sequence alignment extends over their complete length, with no gaps. Again, the alignment of these nodes results from 4 matching links out of 4 in KSHV and out of 5 in VZV (p-value of 10-3) with a local link score S L = 6.30 versus node score S N = 3.50. Functional annotation is available only for VZV ORF65; it belongs to the membrane/glycoprotein class, most likely it is a type-II membrane protein . The alignment of KSHV ORF28 with VZV ORF65 leads us to predict that KSHV ORF28 also codes for a membrane glycoprotein, see Figure 2c for illustration.
Several experimental studies support this prediction. Gene expression studies show that ORF28 is co-expressed with tertiary lytic ORFs and hence probably falls in the classes of structural or host-virus-interaction genes [25, 26]. The expression of ORF28 is affected by blocking DNA replication  showing ORF28 is a secondary or tertiary gene. Furthermore, ORF28 has been detected in the virion by mass spectroscopy, leading to a tentative functional classification as a glycoprotein-envelope protein . Finally, ORF28 is a positional homolog of the Epstein-Barr virus ORF BDLF3, which is known to encode glycoprotein gp150.
KSHV ORF23/VZV ORF39
These ORFs have no significant sequence similarity: although the alignment obtained with clustalW  has a sequence identity of 18% over 240 aa, it is statistically insignificant; a randomised test yields a p-value of 0.43. A systematic analysis involving a wide range of different scoring parameters does not yield a statistically significant sequence alignment either [see Additional file 1]. The reading frames KSHV ORF23 and VZV ORF39 are aligned purely due to 3 matching interactions out of 4 of KSHV and 4 of VZV (p-value 2 × 10-2). The local link score equals 4.47 versus a node score of - 0.49. Functional classification is available only for VZV ORF39 as a membrane/glycoprotein . The alignment thus leads us to predict that KSHV ORF23 also codes for a membrane glycoprotein.
This prediction is supported by several experimental studies. Again ORF23 is co-expressed with tertiary lytic ORFs  and is sensitive to blocked DNA replication , so it is a late gene. The expression patterns of ORF23 are similar to those of structural and packaging genes.
KSHV ORF41/VZV ORF60
These ORFs have 3 matching interactions out of 3 in KSHV and 6 in VZV (p = 2 × 10-2), but no significant sequence similarity (The clustalW sequence alignment has identity of 12% over 160 aa with p-value 0.94). They are aligned with a local link score of 4.39 versus a node score of -0.49. Both ORFs are functionally annotated. KSHV ORF41 codes for a helicase/primase associated factor  and is not affected by blocking DNA replication . On the other hand, VZV ORF60 codes for the glycoprotein L [20, 31]. It may be that either of them has a so-far unknown function, leading to the matching protein interactions. This idea finds support in , where the expression maximum of ORF41 was found to come after the secondary lytic phase. This is surprising because the transcript is needed already during the secondary lytic phase (DNA replication). No other DNA-replicating gene controlled by a different operon to KSHV ORF41 has an expression dynamics with this property. Such a delay of the maximum of expression may have two reasons: either the transcription of the ORF41 is not controlled after its role is finished, or ORF41 indeed has a hitherto uncharacterised function in the tertiary lytic phase, possibly a structural one.
We also note that ORF41 is specific to the class of γ-herpesviruses, of which KSHV is a member. Analogously, ORF60 is a-herpesvirus specific. It is possible that the homolog of ORF41 in VZV and the homolog of ORF60 in KSHV were lost as a result of either of these proteins acquiring a new function. This would be an example of non-orthologous gene displacement .
The alignment shown in the Figure 2 contains a cluster of proteins all interacting with each other. This cluster comprises the aligned pairs KSHV ORF23/VZV ORF39, 28/65, 29b/42, and 67.5/25 connected by matching links only. The p-value for such a fully connected cluster (a clique) to emerge at random is approximately 5 × 10-11. The pair KSHV ORF41/VZV ORF60 discussed above is connected to this cluster by two matching links, forming an almost fully connected cluster of 5 ORFs pairs with 8 of 10 possible links present and matching. Surprisingly, while all the other ORFs in the cluster code for structural proteins (virion assembly and structure proteins), ORF41 of KSHV is annotated as a helicase/primase associated factor, and hence codes a protein involved in DNA replication. The association with structure-related genes may be interpreted as a further evidence towards another function of ORF41 as a structural protein.
This cluster of interacting proteins is also found in a third species, the Epstein-Barr virus EBV, which is of the same viral family as KSHV. Three of the four ORFs of the cluster in KSHV have sequence homologs in EBV, namely ORF23, ORF67.5, ORF29b. All of the corresponding ORFs in EBV are found to interact with each other (Peter Uetz, private communication).
The individual species KSHV and VZV contain further clusters, but these are not conserved across species. For instance, the cluster comprising ORFs 28, 29b, 41 and K10 in KSHV contains genes coding for predicted virion proteins, virion assembly and host-virus interaction proteins. ORFs 25, 19, 27, and 38 forming a fully connected cluster in VZV code for proteins involved in virion assembly, nucleotide repair, metabolism, and host-virus interaction.
Interaction conservation and protein function
Protein interactions which are conserved across species shed further light on the functional relationship of the interaction partners. We compare the functions of interacting proteins (i) when the interaction is conserved between KSHV and VZV, and (ii) regardless of conservation.
Each annotated protein can be assigned to one of two functional classes: it is either a 'structural protein' (its functional annotation is one of capsid/core protein, membrane/glycoprotein, virion protein, virion assembly), or an 'information-processing' protein (DNA replication, gene expression regulation, nucleotide repair/metabolism, host-virus interaction). We take the functions of two proteins to be similar if both their functional annotations fall into the same class. Based on this classification, we measure the correlation between functional annotations of interacting proteins by mutual information. For conserved interactions, this is nearly 20-times higher than for the set of all interactions (0.107 bits vs. 0.006 bits). Hence, conserved interactions are more likely to connect functionally similar proteins. Conversely, functionally similar proteins have more conserved interactions than functionally unrelated genes. The mutual information between interactions in the two species is nearly ten times higher for pairs of functionally similar proteins than for pairs of functionally different proteins (0.071 bits vs. 0.007 bits).
Graph alignment results from sequence and interaction similarity
Protein interactions are encoded in mutually matching binding domains. The evolutionary dynamics of these domains is governed by different evolutionary constraints and hence, by different tempi than the overall coding sequence. Moreover, the sequence of a domain may evolve considerably while its interaction is conserved. Therefore, we treat the experimental interaction data as evolutionary information independent of sequence data. Our alignment of herpesviruses VZV and KSHV yields a cross-species mapping between ORFs based jointly on the correlation between amino acid sequences and on the correlation between their protein interactions. The latter correlation depends both on the evolutionary divergence of the interaction networks, and on experimental noise. This approach is distinct from searching for the overrepresentation of matching interactions among sequence homologs [9–11]. It allows the identification of homology in cases where sequence similarity between two ORFs has decayed to statistically insignificant levels. Resolving the 'twilight zone' of sequence similarity by additional information on protein interactions is particularly relevant for the case of short genes (such as in the present application), or high levels of domain shuffling. Our method also allows to detect functional analogs, i.e., proteins with similar interactions but without common ancestry. The resulting alignment is corroborated by genomic position and by molecular weight of aligned ORFs.
Functional predictions from interaction similarity
We find several cases of ORFs with no detectable sequence similarity which are aligned with each other solely on the basis of matching interactions. There are different possible mechanisms generating this situation; (i) a pair of orthologous genes loses their sequence similarity below the threshold of detectability, (ii) convergent evolution, and (iii) a gene functionally substitutes for another gene. The original gene may then be excised from the genome without phenotypic effect. This process has been termed non-orthologous gene displacement . In all three cases, sequence information is insufficient for functional prediction. Based on the alignment due to matching interactions and on the annotation of one of the alignment partners, we predict the function of several ORFs. These predictions are supported by gene expression experiments and by the genomic position of the ORFs.
Functional cluster as conserved subgraph
The optimal alignment (Figure 2) contains a cluster of 4 ORFs whose products all interact with each other in both viruses. All members of this cluster belong to a single functional class; they are involved in virion formation and structure and code for tertiary lytic transcripts.
There are other fully connected clusters both in VZV and KSHV, but none of them occur in both viruses. These clusters contain proteins in different functional classes; one cluster in VZV contains proteins involved in virion assembly, nucleotide repair, metabolism, and host-virus interaction.
Guilt by conserved association, evolutionary constraints on network links
The guilt-by-association scheme of assigning like functions to interacting proteins  would fail in these cases of non-conserved clusters. However, we can refine this principle to guilt by conserved association, assigning similar functions only to proteins with an interaction in both species, which correctly describes the functional correlations in the above clusters. Indeed, while the functional classes of interacting proteins in a single species are only very weakly correlated, pairs of proteins with conserved interactions are more likely to share the same function.
The guilt-by-conserved-association principle might be more than a statistical filter for false positive interactions by cross-species comparison. Interactions between proteins of the same functional class are more likely to be conserved across species than interactions between proteins of different functions, which may indicate a lower rate of evolution of interactions related to function. This, in turn, is consistent with natural selection imposing a specific constraint acting jointly on protein interactions that contribute to a cellular pathway. With data on further species, phylogenetic analysis will shed light on the evolutionary forces at the level of the protein interaction networks, particularly if adaptive events can be traced in the data .
Scoring sequence alignments
To account the uneven level of sequence divergence along the herpesviral genome, we optimise scoring parameters of the Needleman-Wunsch algorithm individually for each pair of ORFs. We then normalise the scores in the way that allows comparison of scores obtained with various scoring parameters following , [see Additional file 1 for details]. The scores are directly comparable to i.e. ClustalW scores.
Scoring graph alignments
Consider a set of genes (or open reading frames) as nodes of a network, with pair-wise interactions between the corresponding proteins represented as Boolean network links. Given two such networks in related species, we construct a graph alignment, i.e., a mapping p of nodes of one network to nodes of the other network. This alignment is scored by interaction similarity and sequence similarity as follows: (i) Aligned node pairs (i, j = π(i)) and (i', j' = π(i')) contribute a positive link score if a link is present both between the pair (i, i') in one network and (j, j') in the other (matching links, such as D' - C' and D* - E* in the example of Figure 1). A negative contribution results if a link is present in one network, but not in the other (mismatched links, such as D' - B' and D* - B* in Figure 1). The link score accounts for evolutionary divergence of the interaction networks, as well as for experimental errors in the network data. (ii) An aligned node pair (i, j = π(i)) contributes a node score depending on the sequence similarity θ ij , rewarding similarity between aligned pairs and penalising similarity between pairs not respected by the graph alignment.
The total graph alignment score is the sum of independent contributions from sequence similarity and from link similarity. Hence, any high-scoring alignment will contain node pairs aligned primarily due to similarity of their interactions or of their sequences, or of both. Of course, the outcome of the alignment depends crucially on the relative weight of node score and link score. We determine optimal scoring functions self-consistently from the data within a Bayesian framework [see Additional file 1].
Computation of p-values
We consider pairs of independently generated random networks, and compare them to the alignments found in empirical data. The probability of finding in random networks two nodes with the same or higher interaction overlap as a given alignment is estimated, and serves as a p-value for the corresponding alignment [See Additional file 1 for details.]
Graph alignment algorithm
We use an iterative algorithm as described in  to find the high-scoring graph alignments. This algorithm is based on a mapping to the quadratic assignment problem. At each step, the highest scoring alignment is identified individually for each node, while keeping the rest of the alignment fixed. A certain amount of noise is used to help the alignment to escape from local score maxima, a procedure called simulated annealing . This noise amplitude is gradually decreased to zero, starting from some initial value T and an initial alignment of reciprocal best sequence matches. An R-package implementing the graph alignment is available from the bioconductor website .
Alignment regimes and parameter selection
We have performed extensive tests, both on artificially generated networks and on the experimental PIN data, to find the optimal scoring parameters. For network pairs with low link similarity, we have found two different alignment regimes depending on the initial noise level T. In the high-fidelity regime for values of T well below a threshold value T D , the alignment consists mainly of the nodes with sequence similarity, but does not extend much beyond. In the low-fidelity regime for T above T D , high-scoring alignments contain many link matches (even more than in the biologically correct alignment), but different runs have little overlap and most nodes (even with sequence similarity) are misaligned.
Optimal detection of similarity occurs in the high-fidelity regime for values of T just below T D . In this region, the alignment is still guided by sequence similarity, yet extends as much as possible into the set of nodes without sequence similarity.
The occurrence of high-scoring alignments of low significance can be understood intuitively from the special case of two uncorrelated graphs with a narrow range of connectivities. Aligning a pair of randomly chosen nodes with each other, their neighbours, and their next neighbours, etc., will lead to a high link score (possibly offset to some extent by a low node score). There are many such alignments with a high score, yet low statistical significance. These spurious alignments occur for sparse networks at sufficiently low fractions of link matches and low numbers of nodes with sequence similarity. They are comparable to the score islands known in local sequence alignment [37, 38, 34, 39]. However, unlike sequences with their one-dimensional structure, locally tree-like graphs can generate an exponentially large number of such score islands.
Reproducibility and robustness
To ensure reproducibility of our results the alignment procedure is repeated several times over in order to record how often a given pair of nodes is aligned. The results are shown in supplementary Fig. 2 [see Additional file 1]. As a conservative pruning procedure, we only consider aligned node pairs which appear in more than half the runs (for comparison, under random matching a given alignment partner appears with probability 1/N ~ 0.03). The optimal scoring parameters turn out not to change between alignment runs.
The protein interactions for KSHV strain BC-1 and VZV Oka-parental were taken from the yeast two-hybrid screens (Y2H) of the Peter Uetz lab . The sequences of the two herpesviruses were downloaded from the VOCs database  and the NCBI database [23, 40, 41].
Accession numbers: Genomes: KSHV: Human herpesvirus 8 strain cell line BC-1 (VOCs genome ID 890); VZV: Human herpesvirus 3 strain Oka parental (VOCs genome ID 921). KSHV ORFs: ORF 67.5: provided by Peter Uetz, sequence follows: "MEYASDQLLP RDMQILFPTI YCRLNAINYC QYLKTFLVQR AQPAACDHTL VLESKVDTVR QVLRKIVSTD AVFSEARARP"; ORF 28 [GenBank: NP 572080.1]; ORF 23: [GenBank: NP 572075.1]; ORF 41: [GenBank: NP 572094.1]; ORF 29b: [GenBank: NP 572081.1]. VZV ORFs: ORF25: VOCs ID 59436; ORF65: 59475; ORF39: 59450; ORF60: 59470; ORF42: 59453.
We thank Peter Uetz for several fruitful discussions and making the interaction data available prior to publication, Gordon Brown and Derek Gatherer for discussions on the protein sequence alignment, and Maria Mar Albà for providing functional information data. Funding from the DFG is acknowledged under Grants SFB 680, SFB-TR12, and BE 2478/2-1. This research was supported in part by the Academy of Sciences of the Czech Republic under Project No. AV0Z50520514 and by the National Science Foundation under Grant No. PHY05-51164.
- Havgaard J, Lyngso R, Stormo G, Gorodkin J: Pairwise local structural alignment of RNA sequences with sequence similarity less than 40%. Bioinformatics. 2005, 21 (9): 1815-24. 10.1093/bioinformatics/bti279View ArticlePubMedGoogle Scholar
- Ponomarenko J, Bourne P, Shindyalov I: Assigning new GO annotations to Protein Data Bank sequences by structural homology. Proteins: Structure, Function and Bioinformatics. 2005, 58: 855-865. 10.1002/prot.20355.View ArticleGoogle Scholar
- Zhang Y, Skolnick J: TM-align: a protein structure alignment algorithm based on the TM-score. Nucleic Acids Research. 2005, 33 (7): 2302-2309. 10.1093/nar/gki524PubMed CentralView ArticlePubMedGoogle Scholar
- Uetz P, Dong YA, Zeretzke C, Atzler C, Baiker A, Berger B, Rajagopala S, Roupelieva M, Rose D, Fossum E, Haas J: Herpesviral protein networks and their interaction with the human proteome. Science. 2006, 311: 239-242. 10.1126/science.1116804View ArticlePubMedGoogle Scholar
- McGeoch D, Cook S: Molecular phylogeny of the Alphaherpesvirinae subfamily and a proposed evolutionary timescale. Journal of Molecular Biology. 1994, 238: 9-22. 10.1006/jmbi.1994.1264View ArticlePubMedGoogle Scholar
- Mar Albà M, Das R, Orengo C, Kellam P: Genomewide function conservation and phylogeny in the Herpesviridae. Genome Research. 2001, 11: 43-54. 10.1101/gr.149801View ArticleGoogle Scholar
- Berg J, Lässig M: Cross-species analysis of biological networks by Bayesian alignment. Proc Natl Acad Sci USA. 2006, 103 (29): 10967-10972. 10.1073/pnas.0602294103PubMed CentralView ArticlePubMedGoogle Scholar
- Pinney JW, Amoutzias GD, Rattray M, Robertson DL: Reconstruction of ancestral protein interaction networks for the bZIP transcription factors. Proceedings of the National Academy of Sciences. 2007, 104 (51): 20449-20453. 10.1073/pnas.0706339104. http://www.pnas.org/content/104/51/20449.abstract 10.1073/pnas.0706339104View ArticleGoogle Scholar
- Kelley B, Sharan R, Karp R, Sittler T, Root D, Stockwell B, Ideker T: Conserved pathways within Bacteria and Yeast as revealed by global protein network alignment. Proc Natl Acad Sci USA. 2003, 100 (20): 11394-11399. 10.1073/pnas.1534710100PubMed CentralView ArticlePubMedGoogle Scholar
- Sharan R, Suthram S, Kelley R, Kuhn T, McCuine S, Uetz P, Sittler T, Karp R, Ideker T: Conserved patterns of protein interaction in multiple species. Proc Natl Acad Sci USA. 2005, 102 (6): 1974-1979. 10.1073/pnas.0409522102PubMed CentralView ArticlePubMedGoogle Scholar
- Cootes A, Muggleton S, Sternberg M: The identification of similarities between biological networks: application to the metabolome and interactome. J Mol Biol. 2007, 369 (4): 1126-1139. 10.1016/j.jmb.2007.03.013View ArticlePubMedGoogle Scholar
- Bandyopadhyay S, Sharan R, Ideker T: Systematic identification of functional orthologs based on protein network comparison. Genome Research. 2006, 16: 428-435. 10.1101/gr.4526006PubMed CentralView ArticlePubMedGoogle Scholar
- Pinter R, Rokhlenko O, Yeger-Lotem E, Ziv-Ukelson M: Alignment of metabolic pathways. Bioinformatics. 2005, 21: 3401-3408. 10.1093/bioinformatics/bti554View ArticlePubMedGoogle Scholar
- Li Z, Zhang S, Wang Y, Zhang XS, L C: Alignment of molecular networks by integer quadratic programming. Bioinformatics. 2007, 23: 1631-1639. 10.1093/bioinformatics/btm156View ArticleGoogle Scholar
- Singh R, Xu J, Berger B: Pairwise global alignment of protein interaction networks by matching neighborhood topology. Proceedings of the 11th Annual International Conference on Research in Computational Molecular Biology (2007): Lecture Notes in Computer Science. 2007, 4453: 16-31.View ArticleGoogle Scholar
- Flannick J, Novak A, Srinivasan B, McAdams H, Batzoglou S: Græmlin: General and robust alignment of multiple large interaction networks. Genome Research. 2006, 16: 1169-1181. 10.1101/gr.5235706PubMed CentralView ArticlePubMedGoogle Scholar
- Srinivasan B, Shah N, Flannick J, Abeliuk E, Novak A, Batzoglou S: Current progress in network research: toward reference networks for key model organisms. Briefings in Bioinformatics. 2007, 8: 318-332. 10.1093/bib/bbm038View ArticlePubMedGoogle Scholar
- Zhang S, Zhang XS, Chen L: Biomolecular network querying: a promising approach in systems biology. BMC Systems Biology. 2008, 2: 5- 10.1186/1752-0509-2-5PubMed CentralView ArticlePubMedGoogle Scholar
- Koonin E, Mushegian A, Bork P: Non-orthologous gene displacement. Trends in Genetics. 1996, 12 (9): 334-336. 10.1016/0168-9525(96)20010-1View ArticlePubMedGoogle Scholar
- Mar Albà M, Lee D, Pearl F, Shepherd A, Martin N, Orengo C, Kellam P: VIDA: a virus database system for the organisation of virus genome open reading frames. Nuleic Acids Research. 2001, 29 (1): 133-136. 10.1093/nar/29.1.133.View ArticleGoogle Scholar
- Reynolds A, Fan Y, Baines J: Characterization of the UL 33 gene product of herpes simplex virus 1. Virology. 2000, 266 (2): 310-318. 10.1006/viro.1999.0090View ArticlePubMedGoogle Scholar
- Hiscock D, Upton C: Viral Genome Database: A tool for storing and analyzing genes and proteins from complete viral genomes. Bioinformatics. 2000, 16: 484-485. 10.1093/bioinformatics/16.5.484View ArticlePubMedGoogle Scholar
- Bao Y, Federhen S, Leipe D, Pham V, Resenchuk S, Rozanov M, Tatusov R, Tatusova T: National Center for Biotechnology Information Viral Genomes Project. Journal of Virology. 2004, 78 (14): 7291-7298. 10.1128/JVI.78.14.7291-7298.2004PubMed CentralView ArticlePubMedGoogle Scholar
- Cohen J, Sato H, Srinivas S, Lekstrom K: Varicella-Zoster Virus (VZV) ORF65 virion protein is dispensable for replication in cell culture and is phosphorylated by casein kinase II, but not by the VZV protein kinases. Virology. 2001, 280: 62-71. 10.1006/viro.2000.0741View ArticlePubMedGoogle Scholar
- Jenner R, Mar Albà M, Boshoff C, Kellam P: Kaposi's sarcoma-associated Herpesvirus latent and lytic gene expression as revealed by DNA arrays. Journal of Virology. 2001, 75 (2): 891-902. 10.1128/JVI.75.2.891-902.2001PubMed CentralView ArticlePubMedGoogle Scholar
- Paulose-Murphy M, Ha NK, Xiang C, Chen Y, Gillim L, Yarchoan R, Meltzer P, Bittner M, Trent J, Zeichner S: Transcription program of human Herpesvirus 8 (Kaposi's sarcoma-associated Herpesvirus). Journal of Virology. 2001, 75 (10): 4843-4853. 10.1128/JVI.75.10.4843-4853.2001PubMed CentralView ArticlePubMedGoogle Scholar
- Lu M, Suen J, Frias C, Pfeiffer R, Tsai MH, Chuang E, Zeichner S: Dissection of the Kaposi's sarcoma-associated Herpesvirus gene expression program by using the viral DNA replication inhibitor Cidofovir. Journal of Virology. 2004, 78 (24): 13637-13652. 10.1128/JVI.78.24.13637-13652.2004PubMed CentralView ArticlePubMedGoogle Scholar
- Zhu F, Chong J, Wu L, Yuan Y: Virion proteins of Kaposi's sarcoma-associated Herpesvirus. Journal of Virology. 2005, 79 (2): 800-811. 10.1128/JVI.79.2.800-811.2005PubMed CentralView ArticlePubMedGoogle Scholar
- Thompson J, Higgins D, Gibson T: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, positions-specific gap penalties and weight matrix choice. Nucleic Acids Research. 1994, 22: 4673-4680. 10.1093/nar/22.22.4673PubMed CentralView ArticlePubMedGoogle Scholar
- Wu F, Ahn JH, Alcendor D, Jang WJ, Xiao J, Hayward D, Hayward G: Origin-independent assembly of Kaposi's sarcoma-associated Herpesvirus DNA replication compartments in transient cotransfection assays and association with the ORF-K8 protein and cellular PML. Journal of Virology. 2001, 75 (3): 1487-1506. 10.1128/JVI.75.3.1487-1506.2001PubMed CentralView ArticlePubMedGoogle Scholar
- Marešová L, Kutinová L, Ludvíková V, Žák R, Mareš M, Němečková v: Characterization of interaction of gH and gL glycoproteins of varicella-zoster virus: their processing and trafficking. Journal of General Virology. 2000, 81: 1545-1552.View ArticlePubMedGoogle Scholar
- Oliver S: Guilt-by-association goes global. Nature. 2000, 403: 601-603. 10.1038/35001165View ArticlePubMedGoogle Scholar
- Lynch M: The frailty of adaptive hypotheses for the origins of organismal complexity. Proceedings of the National Academy of Sciences. 2007, 104 (Suppl 1): 8597-8604. 10.1073/pnas.0702207104.View ArticleGoogle Scholar
- Hwa T, Lässig M: Similarity detection and localization. Physical Review Letters. 1996, 76: 2591-2594. 10.1103/PhysRevLett.76.2591View ArticlePubMedGoogle Scholar
- Kirkpatrick S, Gelatt CJ, Vecchi M: Optimization by Simulated Annealing. Science. 1983, 220: 671-680. 10.1126/science.220.4598.671View ArticlePubMedGoogle Scholar
- BioConductor: open source software for bioinformatics. http://www.bioconductor.org
- Karlin S, Dembo A: Limit distributions of the maximal segmental score among markov-dependent partial sums. Adv Appl Prob. 1992, 24: 113-140. 10.2307/1427732.View ArticleGoogle Scholar
- Karlin S, Altschul S: Applications and statistics for multiple high-scoring segments in molecular sequences. Proc Natl Acad Sci USA. 1993, 90: 5873-5877. 10.1073/pnas.90.12.5873PubMed CentralView ArticlePubMedGoogle Scholar
- Bundschuh R: Asymmetric exclusion process and extremal statistics of random sequences. Phys Rev E. 2002, 65 (3): 031911-10.1103/PhysRevE.65.031911.View ArticleGoogle Scholar
- Davison A, Scott J: The complete DNA sequence of varicella-zoster virus. Journal of General Virology. 1986, 67 (9): 1759-1816. 10.1099/0022-1317-67-9-1759View ArticlePubMedGoogle Scholar
- Russo J, Bohenzky R, Chien M, Chen J, Yan M, Maddalena D, Parry J, Peruzzi D, Edelman I, Chang Y, Moore P: Nucleotide sequence of the Kaposi sarcoma-associated herpesvirus (HHV8). Proc Natl Acad Sci USA. 1996, 93 (25): 14862-14867. 10.1073/pnas.93.25.14862PubMed CentralView ArticlePubMedGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.