PubMed Health⌕ Search

PubMed · 3126497

Class I major histocompatibility complex proteins diffuse isotropically on immune interferon-activated endothelial cells despite anisotropic cell shape and cytoskeletal organization: application of fluorescence photobleaching recovery with an elliptical beam.

Abstract

Interferon gamma induces striking phenotypic alterations in confluent cultures of human vascular endothelial cells (HEC), including cell shape change from polygonal to elongated and cytoskeletal actin rearrangement from dense peripheral bands to longitudinal bundles of stress fibers. Since many transmembrane proteins, including class I major histocompatibility complex (MHC) proteins, interact with cytoskeletal actin, an interferon-gamma-induced anisotropic arrangement of stress fibers might cause anisotropic lateral diffusion of HEC class I MHC proteins. To test this hypothesis, we adapted the fluorescence photobleaching recovery technique to allow measurement of anisotropic diffusion of fluorescently labeled molecules on two-dimensional surfaces. A highly eccentric elliptical Gaussian laser beam was used to photobleach the sample and to monitor fluorescence recovery. In this technique, named "line fluorescence photobleaching recovery," lateral diffusion is measured along that axis of the sample that is perpendicular to the major axis of the elliptical beam. The lateral diffusion coefficient and fractional mobility are obtained by fitting the experimental data to a theoretical recovery curve, the form of which is determined by the solution to a modified version of the diffusion equation in which a tensor is used to describe diffusion in two orthogonal directions. Fluorescein-conjugated murine monoclonal antibodies were used to label class I MHC proteins on interferon-gamma-treated HEC and human dermal fibroblasts. These two cultured human cell types were found to be similar in their elongated shape and anisotropic stress fiber organization. Class I MHC protein lateral mobility was compared to that of fluorescein-labeled phosphatidyl-ethanolamine, a membrane phospholipid probe. Class I MHC proteins diffused anisotropically on human dermal fibroblasts, whereas fluorescein-labeled phosphatidylethanolamine diffused isotropically on this cell type. In contrast, both class I MHC proteins and fluorescein-labeled phosphatidylethanolamine diffused isotropically on interferon-gamma-treated HEC. These data suggest that neither elongated shape nor anisotropic stress fiber arrangement is sufficient to induce anisotropic diffusion of proteins on the HEC plasma membrane.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A H Stolpen, J S Pober, C S Brown, D E Golan. 1988. Class I major histocompatibility complex proteins diffuse isotropically on immune interferon-activated endothelial cells despite anisotropic cell shape and cytoskeletal organization: application of fluorescence photobleaching recovery with an elliptical beam.. https://doi.org/10.1073/pnas.85.6.1844

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↗