PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 16904341

UCSF tomography: an integrated software suite for real-time electron microscopic tomographic data collection, alignment, and reconstruction.

Shawn Q Zheng·Bettina Keszthelyi·Eric Branlund·John M Lyle·Michael B Braunfeld·John W Sedat·David A Agard
View original source ↗Export metadata ↓

Abstract

A real-time alignment and reconstruction scheme for electron microscopic tomography (EMT) has been developed and integrated within our UCSF tomography data collection software. This newly integrated software suite provides full automation from data collection to real-time reconstruction by which the three-dimensional (3D) reconstructed volume is immediately made available at the end of each data collection. Real-time reconstruction is achieved by calculating a weighted back-projection on a small Linux cluster (five dual-processor compute nodes) concurrently with the UCSF tomography data collection running on the microscope's computer, and using the fiducial-marker free alignment data generated during the data collection process. The real-time reconstructed 3D volume provides users with immediate feedback to fully asses all aspects of the experiment ranging from sample choice, ice thickness, experimental parameters to the quality of specimen preparation. This information can be used to guide subsequent data collections. Access to the reconstruction is especially useful in low-dose cryo EMT where such information is very difficult to obtain due to extraordinary low signal to noise ratio in each 2D image. In our environment, we generally collect 2048 x 2048 pixel images which are subsequently computationally binned four-fold for the on-line reconstruction. Based upon experiments performed with thick and cryo specimens at various CCD magnifications (50000x-80000x), alignment accuracy is sufficient to support this reduced resolution but should be refined before calculating a full resolution reconstruction. The reduced resolution has proven to be quite adequate to assess sample quality, or to screen for the best data set for full-resolution reconstruction, significantly improving both productivity and efficiency of system resources. The total time from start of data collection to a final reconstructed volume (512 x 512 x 256 pixels) is about 50 min for a +/-70 degrees 2k x 2k pixel tilt series acquired at every 1 degrees.

Explore related subjects

AlgorithmsChromosomes, HumanComputer SystemsData CollectionHeLa CellsHumansImage Processing, Computer-AssistedMicroscopy, ElectronSoftwareSoftware DesignComparative StudyEvaluation StudyJournal ArticleResearch Support, Non-U.S. Gov't

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shawn Q Zheng, Bettina Keszthelyi, Eric Branlund, John M Lyle, Michael B Braunfeld, John W Sedat, David A Agard. 2006-06-23. UCSF tomography: an integrated software suite for real-time electron microscopic tomographic data collection, alignment, and reconstruction.. https://doi.org/10.1016/j.jsb.2006.06.005

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