Spectral imaging microscopy web sites and data.

George McNamara; Amit Gupta; James Reynaert; Thomas D Coates; Carl Boswell

doi:10.1002/cyto.a.20304

Home/Archive/PubMed

PubMed · 16969821

Spectral imaging microscopy web sites and data.

George McNamara·Amit Gupta·James Reynaert·Thomas D Coates·Carl Boswell

View original source ↗Export metadata ↓

Abstract

The Internet is enabling greater access to spectral imaging publications, spectral graphs, and data than that was available a generation ago. The spectral imaging systems discussed in this issue of Cytometry work because reagent and hardware spectra are reproducible, reusable, and provide input to spectral unmixing and spectral components recognition algorithms. These spectra need to be readily available in order to determine what to purchase, how to use it, and what the output means. We refer to several commercially sponsored and academic spectral web sites and discuss our spectral graphing and data sites. Sites include fluorescent dye graph servers from Invitrogen/Molecular Probes, BD Biosciences, Zeiss/Bio-Rad Cell Sciences, and filter set servers from Chroma Technology and Omega Optical. Several of these sites include data download capabilities. Recently, two microscope manufacturers have published on their web sites transmission curves for select objective lenses-crucial data for anyone doing multiphoton excitation microscopy. Notable among the academic sites, PhotoChemCAD 2.0 has over 200 dyes and a downloadable database/graphing program, and the USC-A Chemistry UV-vis Database displays absorption spectra of many dyes and indicators used in clinical histology and pathology. Our Fluorescent Spectra graphing/calculator site presents dyes, filters, and illumination data from many of these and additional sources. PubSpectra is our free download site which uses Microsoft Excel files as standardized human/machine readable format with over 2,000 biomedical spectra. The principle that data is not subject to copyright provides a framework in which all scientific data should be made freely accessible.

Explore related subjects

Algorithms Databases as Topic Fluorescent Dyes Image Cytometry Internet Mathematics Microscopy, Fluorescence, Multiphoton Spectrometry, Fluorescence Spectrum Analysis Journal Article Research Support, Non-U.S. Gov't

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

George McNamara, Amit Gupta, James Reynaert, Thomas D Coates, Carl Boswell. 2006-08-01. Spectral imaging microscopy web sites and data.. https://doi.org/10.1002/cyto.a.20304

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↗