Computer-aided preoperative planning in knee osteotomy.

E Y Chao; F H Sim

Home/Archive/PubMed

PubMed · 7634043

Computer-aided preoperative planning in knee osteotomy.

E Y Chao·F H Sim

View original source ↗Export metadata ↓

Abstract

It has been demonstrated that osteoarthritis (OA) is activity related and may worsen when joint contact stress becomes excessive due to overloading. Hence, joint alignment and loading are considered to be the key biomechanical determinants for OA. The initiation of pathologic changes in the knee has been described by the mechanism termed, "vicious cycle" in which joint axial malalignment creates excessive stresses to the localized joint cartilage/subchondral bone regions and the surrounding soft tissue which in turn produces more laxity and joint deformity and thus repeats the cyclic degradation mechanism. If this degenerative cycle can be broken with joint alignment surgery such as osteotomy, a procedure to realign the knee joint and thus redistribute joint forces applied to each compartment, performed properly and at the appropriate time, the osteoarthritic disease process can be decelerated and even reversed. The main goals of this paper are to emphasize the importance of accurate preoperative planning for osteotomy in order to properly correct joint alignment, and to justify the application of an existing computer program, OASIS (Osteotomy Analysis and Simulation Software) using plain radiographs to perform appropriate surgical planning. Normal subjects and knee osteotomy patients were studied to establish a database for the purpose of establishing the utility and efficacy of the presently proposed concept. We wish to rationalize knee osteotomy as a preferred and cost-effective treatment for patients with early symptoms of OA in the knee. This paper presents a new concept of preoperative planning for knee osteotomy based on the underlying etiology of the disease and biomechanical viewpoint with strong emphasis on surgical treatment rationales. The established principles in this paper can be applied to other joints of the body and will help implement preventive measures and other non-surgical means to manage patients with axial malalignment or early degenerative changes.

Explore related subjects

Algorithms Biomechanical Phenomena Decision Making, Computer-Assisted Female Humans Knee Male Models, Biological Osteoarthritis Osteotomy Preoperative Care Software Software Design Journal Article

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

E Y Chao, F H Sim. 1995. Computer-aided preoperative planning in knee osteotomy.. https://pubmed.ncbi.nlm.nih.gov/7634043/

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↗