PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 8606655

Thyroid function testing based on assay of thyroid-stimulating hormone: assessing an algorithm's reliability.

R X Davey·M I Clarke·A R Webster
View original source ↗Export metadata ↓

Abstract

OBJECTIVE: To assess the ability of an algorithm for thyroid-function testing (based on assay of thyroid-stimulating hormone [TSH]) to discern euthyroidism in patients with and without conditions affecting thyroid function. DESIGN: The Australian Health Insurance Commission (HIC) specifies clinical categories for which Medicare rebate is given for assay of both TSH and free thyroxine (FT4), but otherwise rebates for thyroid function testing are given for TSH assay only. A prospective study was made of paired TSH and FT4 results of 1000 consecutive assays categorised by indication for testing. An FT4 value within the reference range was accepted as indicating euthyroidism; the reliability of an initial TSH measurement as the sole indicator of thyroid disease was assessed against this criterion standard. SETTING: A large suburban teaching hospital. OUTCOME MEASURE: Success or failure of the algorithm, with failure defined as an abnormal FT4 level missed because the TSH level was normal. RESULTS: The algorithm failure rate both overall and in the patients not in the HIC clinical categories was 2.7%, and there was no significant difference in algorithm failure rate in the patients in the various HIC clinical categories. The categories and failure rates were: patients being monitored for thyroid disease, 3.4%; patients with the "sick euthyroid" syndrome, nil; patients with psychosis or dementia, 1.1%; patients taking drugs affecting thyroid function, 2.1%; and patients with pituitary dysfunction, one of six cases. The range of FT4 values in patients in whom the algorithm failed was 6.4-29.5 pmol/L in those without thyroid disease and 3.4-27.4 pmol/L in those with thyroid disease. In patients being monitored for thyroid disease, the proportion of abnormal values of TSH alone was significant (P<0.001). CONCLUSION: We have shown that the HIC's imposition of a TSH-based algorithm by financial fiat is also scientifically acceptable. Use of this algorithm in hospitals (including psychiatric hospitals) will result in substantial savings.

Explore related subjects

AlgorithmsFemaleHumansReproducibility of ResultsThyroid DiseasesThyroid Function TestsThyrotropinThyroxineJournal Article

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R X Davey, M I Clarke, A R Webster. 1996-03-18. Thyroid function testing based on assay of thyroid-stimulating hormone: assessing an algorithm's reliability.. https://doi.org/10.5694/j.1326-5377.1996.tb122046.x

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

KEEP EXPLORING

Related citations

PubMed2026

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↗
PubMed2026

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↗
PubMed2026

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&#xd7; to 17.6&#xd7; faster than POASTA, and 7.3&#xd7; 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&#xd7; to 16.9&#xd7; speedup on short reads. Moreover, Theseus is 1.5&#xd7; to 36.3&#xd7; 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↗