PubMed Health⌕ Search

PubMed · 8132682

Finite element modeling of damage accumulation in trabecular bone under cyclic loading.

Abstract

A two-dimensional finite element model of an idealized trabecular bone specimen was developed to study trabecular bone damage accumulation during cyclic compressive loading. The specimen was modeled as a two-dimensional honeycomb-like structure made up of an array of hexagonal cells. Each trabecula was modeled as a linearly elastic beam element with the same material properties as cortical bone. Initial microcracks were assumed to exist within the oblique trabeculae and to grow according to the Paris law. Forces and moments were computed in each trabecula and the microcracks were allowed to propagate until fracture occurred. Between cycles, fractured trabeculae were removed from the finite element mesh, and force and moment distributions were calculated for the next cycle. This iterative process was continued until the simulated trabecular bone specimen showed a 10% reduction in modulus. Creep failure was also studied using a single cell analysis, in which a closed-form solution was obtained after prescribing the creep properties of the trabeculae. The results of the crack propagation analysis showed that fractures of only a small number of individual trabeculae can cause a substantial reduction in the modulus of the trabecular bone specimen model. Statistical tests were performed to compare the slopes and intercepts of the S-N curves of our model predictions to those of experimentally derived S-N curves for bovine trabecular bone. There was no significant difference (p > 0.2 for both slope and intercept) between our model predictions and the experimentally derived S-N curves for the low-stress, high-cycle range. For the high-stress, low-cycle range, the crack propagation model overestimated the fatigue life for a given stress level (for slope, p < 0.001), while the creep analysis agreed well with the experimental data (for slope, p > 0.2). These findings suggest that the primary failure mechanism for low-stress, high-cycle fatigue of trabecular bone is crack growth and propagation, while the primary failure mechanism for high-stress, low-cycle fatigue is creep deformation and fracture. Furthermore, our results suggest that the modulus of trabecular bone at the specimen level may be highly sensitive to fractures of individual trabeculae.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

X E Guo, T A McMahon, T M Keaveny, W C Hayes, L J Gibson. 1994. Finite element modeling of damage accumulation in trabecular bone under cyclic loading.. https://doi.org/10.1016/0021-9290(94)90203-8

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&#xd7; to 17.6&#xd7; faster than POASTA, and 7.3&#xd7; 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&#xd7; to 16.9&#xd7; speedup on short reads. Moreover, Theseus is 1.5&#xd7; to 36.3&#xd7; 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↗