PubMed Health⌕ Search

PubMed · 14561061

Relations between Continuous Performance Test performance measures and ADHD behaviors.

Abstract

The Conners' Continuous Performance Test (CPT) is a neuropsychological task that has repeatedly been shown to differentiate ADHD from normal groups. Several variables may be derived from the Conners' CPT including errors of omission and commission, mean hit reaction time(RT), mean hit RT standard error, d', and beta. What each CPT parameter actually assesses has largely been based upon clinical assumptions and the face validity of each measure (e.g., omission errors measure inattention, commission errors measure impulsivity). This study attempts to examine relations between various CPT variables and phenotypic behaviors so as to better understand the various CPT variables. An epidemiological sample of 817 children was administered the Conners' CPT. Diagnostic interviews were conducted with parents to determine ADHD symptom profiles for all children. Children diagnosed with ADHD had more variable RTs, made more errors of commission and omission, and demonstrated poorer perceptual sensitivity than nondiagnosed children. Regarding specific symptoms, generalized estimating equations (GEE) and ANCOVAs were conducted to determine specific relationships between the 18 DSM-IV ADHD symptoms and 6 CPT parameters. CPT performance measures demonstrated significant relationships to ADHD symptoms but did not demonstrate symptom domain specificity according to a priori assumptions. Overall performance on the two signal detection measures, d' and beta, was highly related to all ADHD symptoms across symptom domains. Further, increased variability in RTs over time was related to most ADHD symptoms. Finally, it appears that at least 1 CPT variable, mean hit RT, is minimally related to ADHD symptoms as a whole, but does demonstrate some specificity in its link with symptoms of hyperactivity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeffery N Epstein, Alaatin Erkanli, C Keith Conners, John Klaric, Jane E Costello, Adrian Angold. 2003. Relations between Continuous Performance Test performance measures and ADHD behaviors.. https://doi.org/10.1023/a%3A1025405216339

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗