PubMed Health⌕ Search

PubMed · 12209685

Validation of a biopsy-based pathologic algorithm for predicting lymph node metastases in patients with clinically localized prostate carcinoma.

Abstract

BACKGROUND: The authors validated an algorithm for the preoperative prediction of lymph node (LN) metastases in patients with clinically localized prostate carcinoma. The algorithm was applied to sextant biopsy material and radical retropubic prostatectomy (RRP) stage obtained from a cohort of men who were treated at the authors' institution. METHODS: Four hundred forty-three patients underwent systematic sextant biopsy and RRP with staging lymphadenectomy. The original algorithm was based on systematic sextant biopsy data and classified patients into three risk groups for LN metastases based on the biopsy result. If > or = 4 of 6 biopsies contained any Gleason Pattern 4 disease, then the patient was at high risk for LN metastases (45%). Patients with > or = 1 of 6 biopsies with dominant Gleason Pattern 4 disease (excluding high-risk patients) had an intermediate predicted risk (19%) of LN metastases. All other patients had a low predicted risk of LN metastases (2.2%). The authors assed the percentage of patients who were positive and negative for LN metastases and calculated the specificity and negative predictive value in the series when patients were classified according to the original algorithm. RESULTS: Twenty of 443 patients had intraoperative LN metastases. When applied to the current data, the Hamburg algorithm classified 404 patients in the low-risk group, 30 patients in the intermediate-risk group, and 9 patients in the high risk group. The incidence of LN metastases was 2.47% in the low-risk group, 20% in the intermediate-risk group, and 44.4% in the high-risk group. The negative predictive value for the low-risk group was 97.52%, and the specificity was 94.14%. CONCLUSIONS: The Hamburg algorithm proved a valid tool for the prediction of lymphatic spread in this validation study on data from the authors' institution. The algorithm may serve as a tool to select patients who do not need to undergo pelvic lymphadenectomy at the time they undergo RRP, hence reducing morbidity and expense. More importantly, with the increasing numbers of men undergoing treatment options in whom LN dissection is not performed, this validated algorithm provides an important selection basis regarding the appropriateness of a therapy that does not routinely include LN staging.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Haese, Jonathan I Epstein, Hartwig Huland, Alan W Partin. 2002-09-01. Validation of a biopsy-based pathologic algorithm for predicting lymph node metastases in patients with clinically localized prostate carcinoma.. https://doi.org/10.1002/cncr.10811

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↗