Alignment-Free Sequence Comparison (I): Statistics and Power
Top Cited Papers
Open Access
- 1 December 2009
- journal article
- research article
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 16 (12) , 1615-1634
Abstract
Large-scale comparison of the similarities between two biological sequences is a major issue in computational biology; a fast method, the D 2 statistic, relies on the comparison of the k -tuple content for both sequences. Although it has been known for some years that the D 2 statistic is not suitable for this task, as it tends to be dominated by single-sequence noise, to date no suitable adjustments have been proposed. In this article, we suggest two new variants of the D 2 word count statistic, which we call D 2 S and D 2 * . For D 2 S , which is a self-standardized statistic, we show that the statistic is asymptotically normally distributed, when sequence lengths tend to infinity, and not dominated by the noise in the individual sequences. The second statistic, D 2 * , outperforms D 2 S in terms of power for detecting the relatedness between the two sequences in our examples; but although it is straightforward to simulate from the asymptotic distribution of D 2 * , we cannot provide a closed form for power calculations.Keywords
This publication has 13 references indexed in Scilit:
- Empirical distribution of k-word matches in biological sequencesPattern Recognition, 2009
- Approximate word matches between two random sequencesThe Annals of Applied Probability, 2008
- A connection between self-normalized products and stable lawsStatistics & Probability Letters, 2007
- Asymptotic Behavior ofk-Word Matches Between two Uniformly Distributed SequencesJournal of Applied Probability, 2007
- A statistical method for alignment-free comparison of regulatory sequencesBioinformatics, 2007
- An example of a stationary, triplewise independent triangular array for which the CLT failsStatistics & Probability Letters, 2007
- Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequencesBMC Bioinformatics, 2006
- Distributional regimes for the number ofk-word matches between two random sequencesProceedings of the National Academy of Sciences, 2002
- Error bounds on multivariate Normal approximations for word count statisticsAdvances in Applied Probability, 2002
- On the Kolmogorov-Smirnov Test for Normality with Mean and Variance UnknownJournal of the American Statistical Association, 1967