PubMed Health⌕ Search

PubMed · 8734057

Modeling blood flow heterogeneity.

Abstract

It has been known for some time that regional blood flows within an organ are not uniform. Useful measures of heterogeneity of regional blood flows are the standard deviation and coefficient of variation or relative dispersion of the probability density function (PDF) of regional flows obtained from the regional concentrations of tracers that are deposited in proportion to blood flow. When a mathematical model is used to analyze dilution curves after tracer solute administration, for many solutes it is important to account for flow heterogeneity and the wide range of transit times through multiple pathways in parallel. Failure to do so leads to bias in the estimates of volumes of distribution and membrane conductances. Since in practice the number of paths used should be relatively small, the analysis is sensitive to the choice of the individual elements used to approximate the distribution of flows or transit times. Presented here is a method for modeling heterogeneous flow through an organ using a scheme that covers both the high flow and long transit time extremes of the flow distribution. With this method, numerical experiments are performed to determine the errors made in estimating parameters when flow heterogeneity is ignored, in both the absence and presence of noise. The magnitude of the errors in the estimates depends upon the system parameters, the amount of flow heterogeneity present, and whether the shape of the input function is known. In some cases, some parameters may be estimated to within 10% when heterogeneity is ignored (homogeneous model), but errors of 15-20% may result, even when the level of heterogeneity is modest. In repeated trials in the presence of 5% noise, the mean of the estimates was always closer to the true value with the heterogeneous model than when heterogeneity was ignored, but the distributions of the estimates from the homogeneous and heterogeneous models overlapped for some parameters when outflow dilution curves were analyzed. The separation between the distributions was further reduced when tissue content curves were analyzed. It is concluded that multipath models accounting for flow heterogeneity are a vehicle for assessing the effects of flow heterogeneity under the conditions applicable to specific laboratory protocols, that efforts should be made to assess the actual level of flow heterogeneity in the organ being studied, and that the errors in parameter estimates are generally smaller when the input function is known rather than estimated by deconvolution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R B King, G M Raymond, J B Bassingthwaighte. Modeling blood flow heterogeneity.. https://doi.org/10.1007/bf02660885

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↗