Browse
Submit Data
Databases
API
Help

Dataset Information

21 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

The McNemar test for binary matched-pairs data: mid-p and asymptotic are better than exact conditional.

ABSTRACT:

Background

Statistical methods that use the mid-p approach are useful tools to analyze categorical data, particularly for small and moderate sample sizes. Mid-p tests strike a balance between overly conservative exact methods and asymptotic methods that frequently violate the nominal level. Here, we examine a mid-p version of the McNemar exact conditional test for the analysis of paired binomial proportions.

Methods

We compare the type I error rates and power of the mid-p test with those of the asymptotic McNemar test (with and without continuity correction), the McNemar exact conditional test, and an exact unconditional test using complete enumeration. We show how the mid-p test can be calculated using eight standard software packages, including Excel.

Results

The mid-p test performs well compared with the asymptotic, asymptotic with continuity correction, and exact conditional tests, and almost as good as the vastly more complex exact unconditional test. Even though the mid-p test does not guarantee preservation of the significance level, it did not violate the nominal level in any of the 9595 scenarios considered in this article. It was almost as powerful as the asymptotic test. The exact conditional test and the asymptotic test with continuity correction did not perform well for any of the considered scenarios.

Conclusions

The easy-to-calculate mid-p test is an excellent alternative to the complex exact unconditional test. Both can be recommended for use in any situation. We also recommend the asymptotic test if small but frequent violations of the nominal level is acceptable.

SUBMITTER: Fagerland MW

PROVIDER: S-EPMC3716987 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Conditional asymptotic inference for the kernel association test.

Project description:MotivationThe kernel association test (KAT) is popular in biological studies for its ability to combine weak effects potentially of opposite direction. Its P-value is typically assessed via its (unconditional) asymptotic distribution. However, such an asymptotic distribution is known only for continuous traits and for dichotomous traits. Furthermore, the derived P-values are known to be conservative when sample size is small, especially for the important case of dichotomous traits. One alternative is the permutation test, a widely accepted approximation to the exact finite sample conditional inference. But it is time-consuming to use in practice due to stringent significance criteria commonly seen in these analyses.ResultsBased on a previous theoretical result a conditional asymptotic distribution for the KAT is introduced. This distribution provides an alternative approximation to the exact distribution of the KAT. An explicit expression of this distribution is provided from which P-values can be easily computed. This method applies to any type of traits. The usefulness of this approach is demonstrated via extensive simulation studies using real genotype data and an analysis of genetic data from the Ocular Hypertension Treatment Study. Numerical results showed that the new method can control the type I error rate and is a bit conservative when compared to the permutation method. Nevertheless the proposed method may be used as a fast screening method. A time-consuming permutation procedure may be conducted at locations that show signals of association.Availability and implementationAn implementation of the proposed method is provided in the R package iGasso.Contactkai-wang@uiowa.edu.

| S-EPMC5860324 | biostudies-literature

Asymptotic conditional singular value decomposition for high-dimensional genomic data.

Project description:High-dimensional data, such as those obtained from a gene expression microarray or second generation sequencing experiment, consist of a large number of dependent features measured on a small number of samples. One of the key problems in genomics is the identification and estimation of factors that associate with many features simultaneously. Identifying the number of factors is also important for unsupervised statistical analyses such as hierarchical clustering. A conditional factor model is the most common model for many types of genomic data, ranging from gene expression, to single nucleotide polymorphisms, to methylation. Here we show that under a conditional factor model for genomic data with a fixed sample size, the right singular vectors are asymptotically consistent for the unobserved latent factors as the number of features diverges. We also propose a consistent estimator of the dimension of the underlying conditional factor model for a finite fixed sample size and an infinite number of features based on a scaled eigen-decomposition. We propose a practical approach for selection of the number of factors in real data sets, and we illustrate the utility of these results for capturing batch and other unmodeled effects in a microarray experiment using the dependence kernel approach of Leek and Storey (2008, Proceedings of the National Academy of Sciences of the United States of America 105, 18718-18723).

| S-EPMC3165001 | biostudies-literature

Exact and Asymptotic Weighted Logrank Tests for Interval Censored Data: The interval R package.

Project description:For right-censored data perhaps the most commonly used tests are weighted logrank tests, such as the logrank and Wilcoxon-type tests. In this paper we review several generalizations of those weighted logrank tests to interval-censored data and present an R package, interval, to implement many of them. The interval package depends on the perm package, also presented here, which performs exact and asymptotic linear permutation tests. The perm package performs many of the tests included in the already available coin package, and provides an independent validation of coin. We review analysis methods for interval-censored data, and we describe and show how to use the interval and perm packages.

| S-EPMC4184046 | biostudies-literature

Confidence intervals for difference in proportions for matched pairs compatible with exact McNemar's or sign tests.

Project description:For testing with paired data (eg, twins randomized between two treatments), a simple test is the sign test, where we test if the distribution of the sign of the differences in responses between the two treatments within pairs is more often positive (favoring one treatment) or negative (favoring the other). When the responses are binary, this reduces to a McNemar-type test, and the calculations are the same. Although it is easy to calculate an exact P-value by conditioning on the total number of discordant pairs, the accompanying confidence interval on a parameter of interest (proportion positive minus proportion negative) is not straightforward. Effect estimates and confidence intervals are important for interpretation because it is possible that the treatment helps a very small proportion of the population yet gives a highly significant effect. We construct a confidence interval that is compatible with an exact sign test, meaning the 100 (1-α)% interval excludes the null hypothesis of equality of proportions if and only if the associated exact sign test rejects at level α . We conjecture that the proposed confidence intervals guarantee nominal coverage, and we support that conjecture with extensive numerical calculations, but we have no mathematical proof to show guaranteed coverage. We have written and made available the function mcnemarExactDP in the exact2x2 R package and the function signTest in the asht R package to perform the methods described in this article.

| S-EPMC9447366 | biostudies-literature

Matched asymptotic solution for crease nucleation in soft solids.

Project description:A soft solid subjected to a large compression develops sharp self-contacting folds at its free surface, known as creases. Creasing is physically different from structural elastic instabilities, like buckling or wrinkling. Indeed, it is a fully nonlinear material instability, similar to a phase-transformation. This work provides theoretical insights of the physics behind crease nucleation. Creasing is proved to occur after a global bifurcation allowing the co-existence of an outer deformation and an inner solution with localised self-contact at the free surface. The most fundamental result here is the analytic prediction of the nucleation threshold, in excellent agreement with experiments and numerical simulations. A matched asymptotic solution is given within the intermediate region between the two co-existing states. The self-contact acts like the point-wise disturbance in the Oseen's correction for the Stokes flow past a circle. Analytic expressions of the matching solution and its range of validity are also derived.

| S-EPMC5799209 | biostudies-literature

Exact Mediation Analysis for Ordinal Outcome and Binary Mediator.

Project description:With reference to a single mediator context, this brief report presents a model-based strategy to estimate counterfactual direct and indirect effects when the response variable is ordinal and the mediator is binary. Postulating a logistic regression model for the mediator and a cumulative logit model for the outcome, we present the exact parametric formulation of the causal effects, thereby extending previous work that only contained approximated results. The identification conditions are equivalent to the ones already established in the literature. The effects can be estimated by making use of standard statistical software and standard errors can be computed via a bootstrap algorithm. To make the methodology accessible, routines to implement the proposal in R are presented in the eAppendix; http://links.lww.com/EDE/B962. We also derive the natural effect model coherent with the postulated data-generating mechanism.

| S-EPMC10896191 | biostudies-literature

Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences.

Project description:BackgroundThe number of k-words shared between two sequences is a simple and efficient alignment-free sequence comparison method. This statistic, D2, has been used for the clustering of EST sequences. Sequence comparison based on D2 is extremely fast, its runtime is proportional to the size of the sequences under scrutiny, whereas alignment-based comparisons have a worst-case run time proportional to the square of the size. Recent studies have tackled the rigorous study of the statistical distribution of D2, and asymptotic regimes have been derived. The distribution of approximate k-word matches has also been studied.ResultsWe have computed the D2 optimal word size for various sequence lengths, and for both perfect and approximate word matches. Kolmogorov-Smirnov tests show D2 to have a compound Poisson distribution at the optimal word size for small sequence lengths (below 400 letters) and a normal distribution at the optimal word size for large sequence lengths (above 1600 letters). We find that the D2 statistic outperforms BLAST in the comparison of artificially evolved sequences, and performs similarly to other methods based on exact word matches. These results obtained with randomly generated sequences are also valid for sequences derived from human genomic DNA.ConclusionWe have characterized the distribution of the D2 statistic at optimal word sizes. We find that the best trade-off between computational efficiency and accuracy is obtained with exact word matches. Given that our numerical tests have not included sequence shuffling, transposition or splicing, the improvements over existing methods reported here underestimate that expected in real sequences. Because of the linear run time and of the known normal asymptotic behavior, D2-based methods are most appropriate for large genomic sequences.

| S-EPMC1764478 | biostudies-literature

Better Circuits for Binary Polynomial Multiplication.

Project description:We develop a new and simple way to describe Karatsuba-like algorithms for multiplication of polynomials over F2 . We restrict the search of small circuits to a class of circuits we call symmetric bilinear. These are circuits in which AND gates only compute functions of the form ?i?Sai??i?Sbi (S ? {0,…, n - 1}). These techniques yield improved recurrences for M(kn), the number of gates used in a circuit that multiplies two kn-term polynomials, for k = 4, 5, 6, and 7. We built and verified the circuits for n-term binary polynomial multiplication for values of n of practical interest. Circuits for n up to 100 are posted at http://cs-www.cs.yale.edu/homes/peralta/CircuitStuff/BinPolMult.tar.gz.

| S-EPMC6774206 | biostudies-literature

Asymptotic analysis of reliability measures for an imperfect dichotomous test.

Project description:To access the reliability of a new dichotomous test and to capture the random variability of its results in the absence of a gold standard, two measures, the inconsistent acceptance probability (IAP) and inconsistent rejection probability (IRP), were introduced in the literature. In this paper, we first analyze the limiting behavior of both measures as the number of test repetitions increases and derive the corresponding accuracy estimates and rates of convergence. To overcome possible limitations of IRP and IAP, we then introduce a one-parameter family of refined reliability measures, Δ(k,s) . Such measures characterize the consistency of the results of a dichotomous test in the absence of a gold standard as the threshold for a positive aggregate test result varies. Similar to IRP and IAP, we also derive corresponding accuracy estimates and rates of convergence for Δ(k,s) as the number k of test repetitions increases.Supplementary informationThe online version supplementary material available at 10.1007/s00362-021-01266-9.

| S-EPMC8492041 | biostudies-literature

Binary recombinase systems for high-resolution conditional mutagenesis.

Project description:Conditional mutagenesis using Cre recombinase expressed from tissue specific promoters facilitates analyses of gene function and cell lineage tracing. Here, we describe two novel dual-promoter-driven conditional mutagenesis systems designed for greater accuracy and optimal efficiency of recombination. Co-Driver employs a recombinase cascade of Dre and Dre-respondent Cre, which processes loxP-flanked alleles only when both recombinases are expressed in a predetermined temporal sequence. This unique property makes Co-Driver ideal for sequential lineage tracing studies aimed at unraveling the relationships between cellular precursors and mature cell types. Co-InCre was designed for highly efficient intersectional conditional transgenesis. It relies on highly active trans-splicing inteins and promoters with simultaneous transcriptional activity to reconstitute Cre recombinase from two inactive precursor fragments. By generating native Cre, Co-InCre attains recombination rates that exceed all other binary SSR systems evaluated in this study. Both Co-Driver and Co-InCre significantly extend the utility of existing Cre-responsive alleles.

| S-EPMC3973285 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data