PubMed Health⌕ Search

PubMed · 17179354

Polyp measurement with CT colonography: multiple-reader, multiple-workstation comparison.

Abstract

OBJECTIVE: The risk of invasive colorectal cancer in colorectal polyps correlates with lesion size. Our purpose was to define the most accurate methods for measuring polyp size at CT colonography (CTC) using three models of workstations and multiple observers. MATERIALS AND METHODS: Six reviewers measured 24 unique polyps of known size (5, 7, 10, and 12 mm), shape (sessile, flat, and pedunculated), and location (straight or curved bowel segment) using CTC data sets obtained at two doses (5 mAs and 65 mAs) and a previously described colonic phantom model. Reviewers measured the largest diameter of polyps on three proprietary workstations. Each polyp was measured with lung and soft-tissue windows on axial, 2D multiplanar reconstruction (MPR), and 3D images. RESULTS: There were significant differences among measurements obtained at various settings within each workstation (p < 0.0001). Measurements on 2D images were more accurate with lung window than with soft-tissue window settings (p < 0.0001). For the 65-mAs data set, the most accurate measurements were obtained in analysis of axial images with lung window, 2D MPR images with lung window, and 3D tissue cube images for Wizard, Advantage, and Vitrea workstations, respectively, without significant differences in accuracy among techniques (0.11 < p < 0.59). The mean absolute error values for these optimal settings were 0.48 mm, 0.61 mm, and 0.76 mm, respectively, for the three workstations. Within the ultralow-dose 5-mAs data set the best methods for Wizard, Advantage, and Vitrea were axial with lung window, 2D MPR with lung window, and 2D MPR with lung window, respectively. Use of nearly all measurement methods, except for the Vitrea 3D tissue cube and the Wizard 2D MPR with lung window, resulted in undermeasurement of the true size of the polyps. CONCLUSION: Use of CTC computer workstations facilitates accurate polyp measurement. For routine CTC examinations, polyps should be measured with lung window settings on 2D axial or MPR images (Wizard and Advantage) or 3D images (Vitrea). When these optimal methods are used, these three commercial workstations do not differ significantly in acquisition of accurate polyp measurements at routine dose settings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Brett M Young, J G Fletcher, Scott R Paulsen, Fargol Booya, C Daniel Johnson, Kristina T Johnson, Zackary Melton, Drew Rodysill, Jay Mandrekar. 2007. Polyp measurement with CT colonography: multiple-reader, multiple-workstation comparison.. https://doi.org/10.2214/ajr.05.1535

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&#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↗