PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 16549092

Multiscale modelling in biofluidynamics: application to reconstructive paediatric cardiac surgery.

Francesco Migliavacca·Rossella Balossino·Giancarlo Pennati·Gabriele Dubini·Tain-Yen Hsia·Marc R de Leval·Edward L Bove
View original source ↗Export metadata ↓

Abstract

Multiscale computing is a challenging area even in biomechanics. Application of such a methodology to quantitatively compare postoperative hemodynamics in congenital heart diseases is very promising. In the treatment of hypoplastic left heart syndrome, which is a congenital heart disease where the left ventricle is missing or very small, the necessity to feed the pulmonary and systemic circulations is obtained with an interposition shunt. Two main options are available and differ from the sites of anastomoses: (i) the systemic-to-pulmonary conduit (Blalock-Taussig shunt known as the Norwood Operation (NO)) connecting the innominate artery (NO-BT) or the aorta (NO-CS) to the right pulmonary artery and (ii) the right ventricle to pulmonary artery shunt (known as Sano operation (SO)). The proposition that the SO is superior to the NO remains controversial. 3-D computer models of the NO (NO-BT and NO-CS) and SO were developed and investigated using the finite volume method. Conduits of 3, 3.5 and 4 mm were used in the NO models, whereas conduits of 4, 5 and 6 mm were used in the SO model. The hydraulic nets (lumped resistances, compliances, inertances and elastances) which represent the systemic, coronary and pulmonary circulations and the heart were identical in the two models. A multiscale approach was adopted to couple the 3-D models with the circulation net. Computer simulation results were compared with post-operative catheterization data. Results showed that (i) there is a good correlation between predicted and observed data: higher aortic diastolic pressure, decreased pulmonary arterial pressure, lower pulmonary-to-systemic flow ratio and higher coronary perfusion pressure in SO; (ii) there is a minimal regurgitant flow in the SO conduit. The close correlation between predicted and observed clinical data supports the use of mathematical modelling, with a mandatory multiscale approach, in the design and assessment of surgical procedures.

Explore related subjects

AlgorithmsAnastomosis, SurgicalBiomechanical PhenomenaBlood PressureCardiac Surgical ProceduresComputer SimulationHeart Septal Defects, VentricularHeart VentriclesHemodynamicsHumansHypoplastic Left Heart SyndromeInfantInfant, NewbornModels, BiologicalPediatricsPostoperative ComplicationsPulmonary ArteryPlastic Surgery ProceduresJournal Article

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francesco Migliavacca, Rossella Balossino, Giancarlo Pennati, Gabriele Dubini, Tain-Yen Hsia, Marc R de Leval, Edward L Bove. 2005-04-25. Multiscale modelling in biofluidynamics: application to reconstructive paediatric cardiac surgery.. https://doi.org/10.1016/j.jbiomech.2005.02.021

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↗