PubMed Health⌕ Search

PubMed · 11867503

Generating longitudinal screening algorithms using novel biomarkers for disease.

Abstract

Recent advances in molecular technology are leading to the discovery of new tumor biomarkers that may be useful for cancer screening and early diagnosis. Translating a potential screening biomarker from the laboratory to its use in patient care may require an algorithm or screening rule for its application. An algorithm that can detect the smallest deviation from a defined norm is likely to achieve the highest sensitivity, but any practical screening algorithm must do so with strict controls on test specificity to avoid false-positive results, and unnecessary patient alarm and risk. Longitudinal algorithms that make use of previous tumor marker values and trends are likely to obtain improvements over single threshold rules. Thus far, a few longitudinal screening algorithms have been proposed (e.g., using serial prostate-specific antigen values for the detection of prostate cancer and serial CA125 values for the detection of ovarian cancer), but these algorithms are not appropriate for novel tumor marker discoveries, because they rely on unverifiable assumptions that may not translate to the behavior of the new marker. The algorithm presented here is motivated by: (a) the need to develop an algorithm for early detection using novel markers; (b) the practical demands on data and specimen availability; and (c) the need to be robust enough to accommodate a wide range of tumor growth behavior. We use Parametric Empirical Bayes statistical theory to model the trajectory of markers over time in a cohort of asymptomatic healthy subjects, and use the estimated trajectory to produce person-specific thresholds that depend on the screening history of each person. The thresholds are chosen to give the person (or population) a specified false-positive rate. The resulting algorithm is simple and can be represented in a simple graph or a chart. The statistical analysis needed to generate the algorithm can be found in nearly every basic statistical package. The algorithm is highly robust and can detect a wide range of tumor behaviors. The Parametric Empirical Bayes screening algorithm should take a central role when evaluating marker discoveries for use in screening. The algorithm is particularly useful when screening with a new marker of which the behavior in the preclinical period is not well known.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martin W McIntosh, Nicole Urban, Beth Karlan. 2002. Generating longitudinal screening algorithms using novel biomarkers for disease.. https://pubmed.ncbi.nlm.nih.gov/11867503/

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↗