- Methodology article
- Open access
- Published:

# Island method for estimating the statistical significance of profile-profile alignment scores

*BMC Bioinformatics*
**volumeÂ 10**, ArticleÂ number:Â 112 (2009)

## Abstract

### Background

In the last decade, a significant improvement in detecting remote similarity between protein sequences has been made by utilizing alignment profiles in place of amino-acid strings. Unfortunately, no analytical theory is available for estimating the significance of a gapped alignment of two profiles. Many experiments suggest that the distribution of local profile-profile alignment scores is of the Gumbel form. However, estimating distribution parameters by random simulations turns out to be computationally very expensive.

### Results

We demonstrate that the background distribution of profile-profile alignment scores heavily depends on profiles' composition and thus the distribution parameters must be estimated independently, for each pair of profiles of interest. We also show that accurate estimates of statistical parameters can be obtained using the "island statistics" for profile-profile alignments.

### Conclusion

The island statistics can be generalized to profile-profile alignments to provide an efficient method for the alignment score normalization. Since multiple island scores can be extracted from a single comparison of two profiles, the island method has a clear speed advantage over the direct shuffling method for comparable accuracy in parameter estimates.

## Background

The statistical significance of a local alignment score between two sequences of amino-acid letters can be assessed by analyzing background distribution of the alignment scores between random sequences. For Smith-Waterman alignments [1] lacking gaps, it has been well established that the background score distribution is approximately Gumbel [2], specified by two analytically computable parameters *Î»* and *K*[3â€“6].

Assessing score statistics for profile-based alignments is much more challenging problem. In order to quickly estimate the significance of a database match, the HMMER method (Eddy, 1997) pre-computes extreme value distribution parameters for each Hidden Markov model in the profile library. These model dependent parameters are calculated by aligning and scoring a given HMM against thousands of real or random sequences. PSI-BLAST estimates score significance "on the fly", by reconstructing residue scores within each profile column to the same scale as the scores specified in the BLOSUM62 matrix [7]. The assumption is that, after rescaling, the background distribution of PSI-BLAST scores will be the same as the distribution of the gapped BLAST scores. Many experiments suggest that this hypothesis is valid and that the rescaling technique yields accurate *p*-values.

The assessment of statistical significance of profile-profile scores is still an unsolved problem. In lieu of a rigorous analytical theory, many profile-profile algorithms resort to Z-score statistics [8, 9]. For sequence only methods, the Z-value of an alignment score between two sequences is computed by comparing the first sequence with randomly shuffled versions of the second sequence. An advantage of Z-values is that they eliminate the sequence length and compositional bias, since the shuffling of a sequence preserves these two variables. However, there are certain disadvantages to using raw Z-scores to rank the significance of the alignment scores. First, the Z-score statistics makes a false assumption about the Gaussian form of the underlying score distribution. A reader interested in the magnitude of the error introduced by this assumption in referred to [10]. Second, Z-scores do not provide the probability that an alignment score could be obtained by chance.

Nevertheless, the Z-values can be made very useful for computing accurate p-values via a "change of variable" technique [11]. More specifically, it has been shown that if the raw alignment scores follow a standard Gumbel law, then the *p*-values of associated Z-scores are free of sequence length and amino acid composition biases [12, 13]. Since the only drawback of this approach is the computational expense associated with random simulations, it would be very interesting to see whether the "change of variable" approach can be used in other settings.

Recently, an interesting approach to alignment score normalization has been described that uses so-called Shared Amount of Information (SAI) between the amino-acid[12]. The model proposed in [12] is unique since it is derived from the reliability theory applied to sequences of amino-acids.

To date the studies on score normalization for local profile-profile alignments have been limited to some specific alignment scoring schemes. For example, an explicit generalization of techniques implemented in PSI-BLAST has been successfully used in the COMPASS algorithm [14]. However, the method described in Sadreyev *et al*. works only in the context of the COMPASS scoring function. The statistical significance of alignment scores produced by the LAMA method is estimated using an approach based on Fisher's combining method [15]. In HHSEARCH [16], the profile specific parameters were computed by comparing each profile to the set of profiles built for the representative sequences in the SCOP database [17] (SCOP folds). The alignment scores obtained by PROF_SIM [18], STRUCTFAST[19], and UNI-FOLD [20] were also shown to follow the extreme value distribution, but the distribution parameters in these methods must be pre-calculated using computationally expensive curve-fitting procedure. This approach is commonly referred to as the "direct method". In the "direct method", thousands of optimal alignment scores between real or random profiles are usually needed for moderately accurate estimates of the distribution parameters. On the other hand, profile-profile methods are computationally very expensive, making the direct method too slow for parameter estimation, in particular for deriving the score statistics "on the fly" for each given pair of profiles.

Here, we study a generalization of the well known island method [21, 22] to score normalization problem for profile-profile alignments. The island method uses the scores of local alignment "islands" obtained by a simple modification of the dynamic programming matrix. Since multiple island scores can be computed from a single path graph, the island method has a distinct speed advantage over the direct method.

## Methods

### The statistical theory

The statistical significance of an alignment score is usually expressed by the score's *p-* value. The *p-* value of a score *x* is defined as the probability of obtaining a score of at least *x* purely by chance, given the probabilistic models for the sequences and the alignment scoring scheme.

For a pair of random sequences of lengths *m* and *n*, the expected number of locally optimal gapless sub-alignments with score of at least *x* is approximately Poisson distributed with mean value E given by

The analytically computable parameters *Î»* and *K* depend on the background probabilities of amino-acid letters and the residue-residue substitution scores specified in the mutation matrix.

The equation 1 implies that the *p-* value of a score *x* is

There is plenty of evidence suggesting that equation 1 still holds for alignments with gaps [23â€“28], as well as for profile-sequence and profile-profile alignments[7, 18, 29]. However, for these methods, *Î»* and *K* must be estimated from random simulations rather than computed analytically [3, 18, 28, 8]. We note that precise estimates of *Î»* are particularly important since the *p*-value is a doubly exponential function of *Î»*. We also note that, in contrast to local alignment scores, the scores of global sequence-sequence alignments are shown to approximately follow a three-parameter gamma distribution function[31]. For global alignment statistics, the computational complexity is still an open problem.

### Need for composition-based statistics for profile-profile alignments

For alignment methods that use substitution matrices and residue type information (such as BLAST[4] or FASTA[32]), it has been well established that *Î»* and *K* depend, not only upon the alignment scoring system, but also upon the frequencies of amino-acid letters in the sequences being aligned. In these methods, *Î»* can vary more than 10% from one sequence pair to another, due entirely to change in sequence amino-acid composition [21].

The variation in *Î»* is much larger for profile-profile methods. Figure 1 shows the histogram of estimates of *Î»* for 500 pairs of profiles selected at random from the set of profiles constructed for representative sequences in the FSSP database [33]. For each pair of profiles, *Î»* is computed by repeatedly shuffling the columns (positions) in both profiles and fitting statistical parameters to optimal local alignment scores between profiles' shuffles. As seen in Figure 1, for some alignment methods, the difference in *Î»* between pairs of profiles reaches an order of magnitude. On the other hand, for marginally significant alignment scores between average length profiles, even a relatively small change in *Î»* of 10% results in over 16 fold change in the estimated E-value (see Figure 2). This implies that E-values computed for profile-profile scores using any fixed *Î»* are unreliable, establishing a need for computing the statistical parameters independently, for each given pair of profiles.

### Island statistics

To circumvent the computational expense associated with random simulations for sequence-sequence methods, Olsen *et al*. proposed using the scores of the so-called "alignment islands" [22]. An alignment island is a region in the dynamic programming matrix corresponding to positively scoring segments in two sequences. More precisely, an island is a collection of locally optimal alignments that start at the same cell (anchor cell) in the path graph [21, 22]. The score of an island is defined as the highest score among all local alignment scores for that island.

Since the accuracy of equation 1 increases with increasing values of *x*, accurate estimates of *Î»* and *K* can be obtained by considering islands *i* with sufficiently high peak scores *Ïƒ* (*i*). Assuming continuity of alignment scores, the maximum likelihood estimate of *Î»* is

where *R*_{
c
}denotes the set of islands *i* such that *Ïƒ* (*i*) â‰¥ *c*[21]. The standard error in is , where *Î»* denotes the asymptotic parameter ("true" value). The maximum likelihood estimate of *K* is

where *m* and *n* are the lengths of the random sequences used in each island comparison and *B* is the total number of sequence comparisons performed to generate the islands[21].

We note that the island method is similar to the "declumping" method of Waterman and Vingron[26, 27], but is much faster, because, unlike clumps, the islands and their scores can be collected with a minor modification of the Smith-Waterman algorithm [22]. Several applications have recently been developed that incorporate island statistics for score normalization, including CTX-BLAST [34], ConSequenceS[35], and CIS [36].

An added benefit of the island statistics (and other score normalization methods based on sequence shuffling) is flexibility in choosing the scoring system. In order to be amenable to island statistics, the only requirement a method needs to satisfy is that that the alignments it generates stay in the local regime, i.e. that the distribution of alignment scores between random sequences (profiles) is approximately Gumbel. Therefore, since the procedure for computing statistical parameters does not change with changes to the scoring function, one can entirely focus on improvements to the scoring scheme. This is important, because incorporating additional information into the alignment process, such as, for example, the compositionally adjusted background frequencies [20, 37, 38] or protein secondary structure information [9, 39] is known to significantly increase sensitivity of an alignment method[9, 16].

## Results and discussion

### The island statistics for profile-profile alignments

The alignment score significance can be assessed using either real or random profiles [40]. We use random profiles to avoid bias in the results toward any particular group of proteins. A random profile of length *n* is obtained by sampling *n* profile columns at random from the collection of profiles computed for ~2,500 representative sequences from the FSSP database (FSSP family representatives). The database of FSSP profiles is generated by running three PSI-BLAST iterations on each FSSP sequence and parsing amino-acid letter frequencies from the corresponding PSI-BLAST checkpoint files.

We study the applicability of the island statistics on four popular and well tested profile-profile scoring schemes: *JensenShannon* (implemented in the PROF_SIM method [18]), *CrossProduct* (PRALINE [39]), *WeightedLogOdds* (COMPASS[14]), and *Multinomial* (UNI-FOLD[20]). The definition of each scoring function is given in the appendix. The column-column scores in all four methods are scaled (multiplied by constant factors) so that the alignment score distributions have similar parameters.

Since the island statistics applies only to methods for which the background distribution of optimal alignment scores is approximately Gumbel, we first verify that the algorithms in our study belong to this category. Figure 3 shows the score distributions of (globally) optimal local alignments between the shuffles of random profiles. As seen in Figure 3, for all four profile-profile methods in our study, the best-fit extreme value distribution closely follows the data, with *Ï‡*^{2} goodness-of-fit *p*-values ranging from 0.15 to 0.95.

To establish a link between the statistics of peak island scores and optimal alignment scores, we compare, for a range of cutoff values *c*, the observed number of islands with scores â‰¥ *c* with the expected number of such islands computed from the best-fit extreme-value distribution. The expected number of islands is defined as , where and are parameters obtained with the direct method. More specifically, and are the maximum likelihood estimates of parameters in equation 2, obtained from the scores of (globally) optimal local alignments between profile shuffles. For more on the maximum likelihood estimates of statistical parameters, the reader is referred to [41].

As seen in Figure 4, there is strong agreement in the expected and observed counts of the island peak scores beyond the small score regime, independent of the scoring system employed and the lengths of the profiles. An analysis of real (as opposed to random) profiles demonstrates an equally strong correlation between two statistics for high scoring islands.

The two statistics obviously differ for low scoring islands (Figure 4). As argued before [21, 22] the low scoring islands often correspond to ungapped alignments of only few profile positions, and therefore, the scores of those islands follow a different distribution, namely the distribution of gapless alignment scores.

The plots in Figure 4 show faster decay in the number of islands with score â‰¥ *c* for profiles of size 350 compared to profiles of size 1500 Ã— 1500. We note that the apparent *Î»* for each comparison in Figure 4 is equal to -*k*, where *k* denotes the slope of the set of data points. For sequence only alignments, this dependence of the apparent *Î»* on sequence length is due to the "edge effect", which arises because the length of the longest island, and hence its associated score, is limited by the lengths of the sequences [21]. Thus, if the variance in slopes for profile-profile methods seen in Figure 4 is also due to the edge effect, one would expect to observe larger difference in slopes for methods that generate longer alignments. Indeed, our analysis of alignments generated by four methods in our study demonstrates that the variance in *Î»* for small and large comparisons seen in Figure 4 scales proportionally with average alignment length generated by each method (30 for *WeihgtedLogOdds*, 47 for *CrossProduct*, 37 for *JensenShannon*, and 35 for *Multinomial*).

The "edge effect" may be corrected for by allowing the islands to extend beyond the ends of the sequences [21]. For sequence only methods, this is done by embedding each *n* Ã— *n* comparison within a lager comparison with a border of length *b* and then collecting only the islands anchored within the central *n* Ã— *n* region [21]. We tested a similar technique for computing profile-pair specific asymptotic parameters from small size comparisons. We note that our procedure is slightly different from the procedure described in [21] because it treats the boundary and the central region separately. More specifically, to account for compositional bias in the profiles, only the scores in the central *n* Ã— *n* square are shuffled and the boundary is filled in with scores chosen at random from the central region. Figure 5 shows the asymptotic distribution of island scores obtained from a comparison of size 350 Ã— 350 surrounded by a border of size 50.

To assess the accuracy of the island method, we (like Altschul *et al*. [21]) compute, for each island score cutoff *c*, the estimates of *Î»* and *K* using equations 3 and 4. Table 1 gives the island estimates of *Î»* and *K* for a single pair of random profiles of lengths 1,500 using the *WeightedLogOdds* scoring function. Similar results were obtained with the other three scoring functions (data not shown).

To better illustrate the dependence of the island estimate of *Î»* on the cutoff value *c*, we plot the values from Table 1 in Figure 6. As seen in Figure 6, the value of decreases with increasing island cutoff score *c*, until it reaches the value of 0.166 (direct method estimate of *Î»*) at *c* = 44 and then randomly oscillates around this point.

### Speed vs. accuracy

There are two types of errors that can occur when computing the statistical parameters using random simulations. The first error, called "bias", represents the difference between the estimated and "true" statistical parameters. The second error is the standard error, which, unlike the bias, can be controlled by the number of data points used in parameter estimation. More specifically, the standard error in is 1/ for the island method and 0.78/ for the direct method [21], where *R* denotes the number of data points, i.e. the number of island scores above the cutoff and the number of optimal alignment scores, respectively.

Both direct and island method suffer from bias in the estimates of the statistical parameters. As seen in Figure 6, the bias of the island method is closely related to the island cutoff score. Similarly, the direct method tends to overestimate *Î»* due to the nonexistence of an optimal alignment score threshold. The maximum likelihood estimates of distribution parameters obtained with the direct method most strongly depend on the low scoring data points, because of the steep decrease of the left tail of the extreme value distribution. Therefore, the extent of bias for the direct method is proportional to the fraction of low scoring optimal alignments used for parameter estimation.

We note that the biases of the direct and island method can be computed (and compared) for local alignments of single sequences, due to availability of experimentally verified "best estimate" of the asymptotic *Î»*[21]. Using the "best estimate" of *Î»* as the reference point, Altschul and co-workers were able to find a threshold island score that eliminates all cutoff-based bias for large size comparisons of random sequences. By considering only the islands with peak scores over the threshold, they computed accurate, sequence length specific parameter estimates of *Î»*, and used these estimates as gold standards to assess the extent of bias for both methods [21].

Unfortunately, it would be difficult to perform a similar experiment in our setting because of the dependence of statistical parameters on profiles' composition and because of the computational complexity of profile-profile methods. Thus, instead of comparing the bias side-by-side, we focus our attention on measuring the difference between the island and direct method estimates of *Î»* and on comparing the computational efficiencies of two methods.

The speed advantage of the island method is due to its ability to generate multiple data points in a single comparison of two shuffled profiles. However, the average number of islands per pair of shuffled profiles does not directly translate into the speed advantage of the island method. First, for the same standard error in , the island method needs to generate 64% more data points than the direct method. Second, a single comparison of two profiles with the island method is computationally more expensive than the same comparison with the direct method, since the island method needs to keep track of the islands and their peak scores. Our implementation of the dynamic programming engine for the island method is ~1.5 times slower than the procedure that only returns an optimal alignment score. Taking those two factors into consideration, the total speed advantage of the island method is about *A*_{
c
}/2.4, where *A*_{
c
}denotes the average number of island with peak scores â‰¥ *c* collected in a single comparison of two shuffled profiles. We note that our results are identical to previously reported results for sequence-sequence alignments [21].

We emphasize that the speed advantage of island method also depends on the scoring scheme used in a profile-profile method. Figure 7 shows the relationship between the speed-advantage of the island method and the discrepancy in estimates of *Î»* obtained with two methods. As seen in Figure 7, for the same speed-up, the difference in the estimates of *Î»* obtained by two methods is smaller for large size comparisons. This is expected, because, for two equal size collections of top scoring islands, the average island score for a large size comparison exceeds the average island score for small size comparison, resulting in overall more accurate parameter estimates.

To compute the actual running times of two methods, we tested both programs on an Intel Xeon 2.13 GHz CPU computer with 4 GB of RAM. Table 2 gives the relationship between the running time of the island method and percent deviation of the island estimates of *Î»* from the estimates obtained with the direct method (using direct method estimates as reference points). As seen in Table 2, for a typical comparison of size 350 Ã— 350, the island method using the *JensenShannon* scoring function needs about 4 seconds to obtain an estimate of *Î»* within 4% of the direct method estimate (standard error 0.78%). To achieve the same standard error in , the direct method requires ~1.3 minutes, corresponding to a 20-fold speed advantage of the island method. When compared to the direct method, the efficiency of the island method further increases with increasing lengths of the profiles. For instance, for the same 4% difference in the estimates of *Î»* and comparisons of size 1500 Ã— 1500, the island method is 100 times faster than the direct method (16 seconds vs. ~1/2 hour). For 2% difference in *Î»*, the island method is 10 times faster for comparisons of size 350 Ã— 350 and 30 times faster for comparisons of size 1500 Ã— 1500. We note that increased computational efficiency on large profiles makes the island method particularly useful, since using the direct method to compute the parameters "on the fly" for large size comparisons would be computationally prohibitive.

We emphasize that, by using the direct method estimates as reference points, we do not argue that these estimates are more accurate than the estimates obtained with the island method. In fact, the results of a similar analysis for sequence-only methods [21] suggest that, for comparisons of size ~350 Ã— 350, the bias of the direct method would be about three times larger than the bias of the island method, for the same standard error in .

Previous studies of the island statistics for sequence-sequence alignments addressed the speed-accuracy tradeoff by optimizing the island score cutoff *c*. For the BLOSUM62 matrix and gap opening and extension penalties of 11 and 1, respectively, the cutoff value of *c* = 28 was found appropriate [21]. Olsen and co-workers suggested the cutoff value of *c* = 1.3Â·*max*{*s*_{
ab
}}, where *s*_{
ab
}is the score for matching amino acid letters *a* and *b*, specified in the substitution matrix [22].

A slightly different interpretation of the results in Table 2 suggests an alternative approach to controlling speed and accuracy tradeoff for an arbitrary profile-profile scoring scheme and a range of profile lengths. For example, for a pair of profiles of lengths 350, the *JensenShannon* scoring scheme, and the standard error of 0.78%, the island estimate of *Î»* that is within 4% of the direct method estimate of *Î»* can be obtained by running the island method for ~4 seconds and computing *Î»* using the top scoring 16,437 islands (this number of islands yields standard error in of 0.78%).

We used our in-house computer cluster to directly compare the performance of the island and the direct method in identifying the relationships between the sequences in the Lindahl test set [42]. The Lindahl test set is composed of 1310 pairs of proteins classified in three groups according to SCOP[17] hierarchy. The accuracy of an alignment method in the Lindahl benchmark is defined as its ability to place a correct member of the SCOP group (family, superfamily, and fold) on the top of its ranked list. The results of our test, presented in Table 3, show no significant difference in fold recognition sensitivity between the two methods.

## Conclusion

By utilizing the information present in protein families, profile-profile alignment algorithms are often able to detect extremely week relationships between protein sequences, as evidenced by the large scale benchmarking experiments such as CASP [43], CAFASP [44], and LiveBench [45]. However, estimating the score statistics for profile-profile alignments is a challenging problem. The background distribution of profile-profile alignment scores is constrained by profiles' composition and hence the distribution parameters must be estimated independently, for each given pair of profiles.

We study the applicability of the well known "island method" to profile-profile score normalization. In the island method, the statistical parameters are computed based upon the top scoring islands that can be collected using a simple modification of the Smith-Waterman algorithm. Since multiple high scoring islands can be extracted from a single path graph, the island method has a distinct speed advantage over the direct method. For some widely used profile-profile scoring schemes, the speed advantage of the island method exceeds an order of magnitude for comparable accuracy in parameter estimates. For larger profiles, a significant speed advantage of the island statistics comes with almost perfect accuracy. This is important, since using the direct method as the only other alternative to compute the parameters "on the fly" for large size comparisons is computationally prohibitive.

## Appendix

The *JensenShannon* score [18] between probability distributions *q*^{1} and *q*^{2} is defined as

where *J* = *D*^{JS}(*q*^{1}, *q*^{2}) is the *Jenson-Shannon* divergence between *q*^{1} and *q*^{2} and *S* = *D*^{JS}(*r*, *b*) is the *Jenson-Shannon* divergence between the "most likely common source distribution" *r* for *q*^{1} and *q*^{2} and the "overall" distribution of 20 amino acid letters *b*. The distribution *r* is defined as

The *Jenson-Shannon* divergence is given by

where *D*^{KL}is the Kullback-Leibler divergence

The *CrossProduct* scoring function [39] multiplies the products of the amino-acid target frequencies by the corresponding elements *s*_{
ab
}of the BLOSUM62 substitution matrix

The *WeightedLogOdds*[14] and the *Multinomial*[20] scoring functions use the effective amino-acid counts when scoring a pair of profile positions. More specifically, the score for matching *q*^{1} and *q*^{2} is given as

where and are the "effective counts" for the amino acid *k* observed at two profiles' columns and *b*_{
k
}is the background probability of *k*. In the *WeightedLogOdds* function, the parameters *c*_{1} and *c*_{2} are set to

In the *Multinomial* scoring function, both *c*_{1} and *c*_{2} are set to 1.

## References

Smith TF, Waterman MS: Identification of common molecular subsequences.

*J Mol Biol*1981, 147: 195â€“197.Gumbel EJ:

*Statistics of Extremes.*Columbia University Press, New York, NY; 1958.Karlin S, Altschul SF: Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.

*Proc Natl Acad Sci USA*1990, 87: 2264â€“2268.Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ: Basic local alignment search tool.

*J Mol Biol*1990, 215: 403â€“410.Dembo A, Karlin S, Zeitouni O: Critical phenomena for sequence matching with scoring.

*Ann Prob*1994, 22: 1993â€“2021.Karlin S, Dembo A: Limit distributions of maximal segmental score among Markov-dependent partial sums.

*Adv Appl Prob*1992, 24: 113â€“140.Altschul SF, Madden TL, SchÃ¤ffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs.

*Nucleic Acids Res*1997, 25: 3389â€“3402.Rychlewski L, Jaroszewski L, Li W, Godzik A: Comparison of sequence profiles. Strategies for structural predictions using sequence information.

*Protein Science*2000, 9: 232â€“241.Ginalski K, Pas J, Wyrwicz LS, von Grotthuss M, Bujnicki JM, Rychlewski L: ORFeus: Detection of distant homology using sequence profiles and predicted secondary structure.

*Nucleic Acids Res*2003, 31: 3804â€“7.Hulsen T, de Vlieg JAM, Leunissen JMA, Groenen P: Testing statistical significance scores of sequence comparison methods with structure similarity.

*BMC Bioinformatics*2006, 7: 444.Bastien O, MarÃ©chal E: Evolution of biological sequences implies an extreme value distribution of type I for both global and local pairwise alignment scores.

*BMC Bioinformatics*2008, 9: 332.Bastien O: A Simple Derivation of the Distribution of Pairwise Local Protein Sequence Alignment Scores.

*Evol Bioinform Online*2008, 4: 41â€“45.Pearson WR: Empirical statistical estimates for sequence similarity searches.

*J Mol Biol*1998, 276: 71â€“84.Sadreyev RI, Grishin NV: COMPASS: A tool for comparison of multiple protein alignments with assessment of statistical significance.

*J Mol Biol*2003, 326: 317â€“336.Frenkel-Morgenstern M, Voet H, Pietrokovski S: Enhanced statistics for local alignment of multiple alignments improves prediction of protein function and structure.

*Bioinformatics*2005, 21: 2950â€“6.SÃ¶ding J: Protein homology detection by HMM-HMM comparison.

*Bioinformatics*2005, 21: 951â€“60.Murzin AG, Brenner SE, Hubbard T, Chothia C: SCOP: a structural classification of proteins database for the investigation of sequences and structures.

*J Mol Biol*1995, 247: 536â€“540.Yona G, Levitt M: Within the twilight zone: A sensitive profile-profile comparison tool based on information theory.

*J Mol Biol*2001, 315: 1257â€“1275.Debe DA, Danzer JF, Goddard WA, Poleksic A: STRUCTFAST: protein sequence remote homology detection and alignment using novel dynamic programming and profile-profile scoring.

*Proteins*2006, 64: 960â€“7.Poleksic A, Fienup M: Optimizing the size of the sequence profiles to increase the accuracy of protein sequence alignments generated by profile-profile algorithms.

*Bioinformatics*2008, 24: 1145â€“53.Altschul SF, Bundschuh R, Olsen R, Hwa T: The estimation of statistical parameters for local alignment score distributions.

*Nucleic Acids Res*2001, 29: 351â€“61.Olsen R, Bundschuh R, Hwa T: Rapid assessment of extremal statistics for gapped local alignment. In

*Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology*. Edited by: Lengauer T, Schneider R, Bork P, Brutlag D, Glasgow J, Mewes H-W, Zimmer R. AAAI Press, Menlo Park, CA; 1999:211â€“222.Smith TF, Waterman MS, Burks C: The statistical distribution of nucleic acid similarities.

*Nucleic Acids Research*1985, 13: 645â€“656.Collins JF, Coulson AFW, Lyall A: The significance of protein sequence similarities.

*Comput Appl Biosci*1988, 4: 67â€“71.Mott R: Maximum likelihood estimation of the statistical distribution of Smith-Waterman local sequence similarity scores.

*Bull Math Biol*1992, 54: 59â€“75.Waterman MS, Vingron M: Sequence comparison significance and Poisson approximation.

*Stat Sci*1994, 9: 367â€“381.Waterman MS, Vingron M: Rapid and accurate estimates of statistical significance for sequence database searches.

*Proc Natl Acad Sci USA*1994, 91: 4625â€“4628.Altschul SF, Gish W: Local alignment statistics.

*Methods Enzymol*1996, 266: 460â€“480.Eddy SR: A Probabilistic Model of Local Sequence Alignment That Simplifies Statistical Significance Estimation.

*PLoS Comput Biol*2008, 4: e1000069.Mott R: Accurate formula for P-values of gapped local sequence and profile alignments.

*J Mol Biol*2000, 300: 649â€“59.Pang H, Tang J, Chen SS, Tao S: Statistical distributions of optimal global alignment scores of random protein sequences.

*BMC Bioinformatics*2005, 6: 257.Pearson WR, Lipman DJ: Improved tools for biological sequence comparison.

*Proc Natl Acad Sci USA*1988, 85: 2444â€“2448.Holm L, Ouzounis C, Sander C, Tuparev G, Vriend G: A database of protein structure families with common folding motifs.

*Protein Sci*1992, 1: 1691â€“1698.Gambin A, Wojtalewicz P: CTX-BLAST: context sensitive version of protein BLAST.

*Bioinformatics*2007, 23: 1686â€“8.Przybylski D, Rost B: Powerful fusion: PSI-BLAST and consensus sequences.

*Bioinformatics*2008, 24: 1987â€“1993.Poleksic A, Danzer JF, Hambly K, Debe DA: Convergent Island Statistics: a fast method for determining local alignment score significance.

*Bioinformatics*2005, 21: 2827â€“31.Yu YK, Wootton JC, Altschul SF: The compositional adjustment of amino acid substitution matrices.

*Proc Natl Acad Sci USA*2003, 100: 15688â€“93.Yu YK, Altschul SF: The construction of amino acid substitution matrices for the comparison of proteins with non-standard compositions.

*Bioinformatics*2005, 21: 902â€“11.Heringa J: Computational methods for protein secondary structure prediction using multiple sequence alignments.

*Curr Protein Pept Sci*2000, 1: 273â€“301.Sadreyev RI, Grishin NV: Accurate statistical model of comparison between multiple sequence alignments.

*Nucleic Acids Res*2008, 36: 2240â€“8.Lawless JF:

*Statistical models and methods for lifetime data.*Wiley, New York, NY; 1982:141â€“202.Lindahl E, Elofsson A: Identification of related proteins on family, superfamily and fold level.

*J Mol Biol*2000, 295: 613â€“625.Moult J, Fidelis K, Kryshtafovych A, Rost B, Hubbard T, Tramontano A: Critical assessment of methods of protein structure prediction-Round VII.

*Proteins*2007, 69(Suppl 8):3â€“9.Fischer D, Rychlewski L, Dunbrack RL Jr, Ortiz AR, Elofsson A: CAFASP3: the third critical assessment of fully automated structure prediction methods.

*Proteins*2003, 53(Suppl 6):503â€“516.Rychlewski L, Fischer D: LiveBench-8: the large-scale, continuous assessment of automated protein structure prediction.

*Protein Sci*2005, 14: 240â€“245.

## Acknowledgements

We thank Dr Igor Strugar for critically reading the manuscript and for helpful suggestions.

## Author information

### Authors and Affiliations

### Corresponding author

## Authorsâ€™ original submitted files for images

Below are the links to the authorsâ€™ original submitted files for images.

## Rights and permissions

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.

## About this article

### Cite this article

Poleksic, A. Island method for estimating the statistical significance of profile-profile alignment scores.
*BMC Bioinformatics* **10**, 112 (2009). https://doi.org/10.1186/1471-2105-10-112

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/1471-2105-10-112