Exact algorithms for computing \(p\)-values of statistics-linear combination of 3-nomial variables
From MaRDI portal
Publication:1020874
DOI10.1016/j.csda.2007.03.019zbMath1452.62306OpenAlexW2074508098MaRDI QIDQ1020874
Publication date: 2 June 2009
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2007.03.019
probability generating functiongeneralized linear rank statisticsexact distribution algorithmsoptimized enumeration
Computational methods for problems pertaining to statistics (62-08) Nonparametric hypothesis testing (62G10) Exact distribution theory in statistics (62E15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables
- Combinatorics, computer algebra and the Wilcoxon-Mann-Whitney test
- Permutation, parametric and bootstrap tests of hypotheses.
- The split-up algorithm: a fast symbolic method for computing p-values of distribution-free statistics
- An optimized algorithm for computing Wilcoxon's \(T_n^+\) statistic when \(n\) is small
- An optimized algorithm to determine the values of the exact cumulative distribution function of some discrete statistics
- On Obtaining Permutation Distributions in Polynomial Time
- P-Values: Interpretation and Methodology
- Asymptotic Statistics
This page was built for publication: Exact algorithms for computing \(p\)-values of statistics-linear combination of 3-nomial variables