A faster reliable algorithm to estimate the p-value of the multinomial ilr statistic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3240, Issue , 2004, Pages 111-122

  Keich, Uri ^a   Nagarajan, Niranjan ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; DYNAMIC PROGRAMMING; STORMS;

DYNAMIC PROGRAMMING ALGORITHM; EXPONENTIAL COMPLEXITY; LATTICE-BASED; LOG LIKELIHOOD RATIO; MULTINOMIAL DISTRIBUTIONS; MULTINOMIALS; STATISTICAL APPROXIMATION; STATISTICAL LITERATURE;

COMPUTATIONAL COMPLEXITY;

EID: 33748801366     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30219-3_10     Document Type: Article

References (13)

1. J. Baglivo, D. Olivier, and M. Pagano. Methods for exact goodness-of-fit tests. Journal of the American Statistical Association, 87(418):454-469, 1992.
2. T.L. Bailey and C. Elkan. Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, pages 28-36, Menlo Park, California, 1994.
3. G. Bejerano. Efficient exact value computation and applications to biosequence analysis. In M. Vingron, S. Istrail, P.A. Pevzner, and M.S. Waterman, editors, Proceedings of the Seventh Annual International Conference on Computational Molecular Biology (RECOMB-03), pages 38-47, Berlin, Germany, 2003. ACM Press.
4. 2: A comparative review. International Statistical Review, 57(1):19-43, 1989.
5. G.Z. Hertz and G.D. Stormo. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics, 15:563-577, 1999.
6. K. A. Hirji. A comparison of algorithms for exact goodness-of-fit tests for multinomial data. Communications in Statistics-Simulation and Computations, 26(3):1197-1227, 1997.
7. W. Hoeffding. Asymptotically optimal tests for multinomial distributions. Annals of Mathematical Statistics, 36:369-408, 1965.
8. W.C.M. Kallenberg. On moderate and large deviations in multinomial distributions. Annals of Statistics, 13(4):1554-1580, 1985.
9. U. Keich. Efficiently computing the p-value of the entropy score. Journal of Computational Biology, in press.
10. W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery. Numerical recipes in C. The art of scientific computing. Cambridge University Press, second edition, 1992.
11. S. Rahmann. Dynamic programming algorithms for two statistical problems in computational biology. In Gary Benson and Roderic D. M. Page, editors, Proceedings of the Third International Workshop on Algorithms in Bioinformatics (WABI-03), volume 2812 of Lecture Notes in Computer Science, pages 151-164, Budapest, Hungary, 2003. Springer.
12. J.A. Rice. Mathematical Statistics and Data Analysis. Duxbury Press, second edition, 1995.
13. G.D. Stormo. DNA binding sites: representation and discovery. Bioinformatics, 16(1):16-23, 2000.