Optimization of the MGH repair using an algorithm for tenorrhaphy evaluation.

R J Wassermann; R Howard; B Markee; W Payne; L Ondrovic; W Lee; D P Greenwald

Home/Archive/PubMed

PubMed · 9145140

Optimization of the MGH repair using an algorithm for tenorrhaphy evaluation.

R J Wassermann·R Howard·B Markee·W Payne·L Ondrovic·W Lee·D P Greenwald

View original source ↗Export metadata ↓

Abstract

Previous investigations have demonstrated the superior strength and toughness of the MGH four-strand tendon repair technique and shown that it neither weakens during maximum tendon softening nor interferes with healing in an in vivo rabbit model. In the current study, the biomechanical performance of the modified Becker (MGH) and the modified Kessler repairs were compared in situ using a dynamic human cadaveric model to evaluate strength, toughness, glide efficiency, and operator variability. Three different surgeons performed a total of 42 zone II flexor digitorum profundus repairs in 14 fresh human cadaver hands. The modified Becker (MGH) repairs were stronger (79 +/- 3 versus 64 +/- 4 N; p < 0.01) and tougher (0.092 +/- 0.002 versus 0.078 +/- 0.003 J; p < 0.01) than the Kessler repairs while allowing equally efficient glide (32 +/- 6 versus 33 +/- 4 percent; p > 0.9). Strength was operator-dependent only for the modified Kessler repair (p < 0.005). We then established the optimal configuration of the MGH tenorrhaphy (number of preloaded crosses on either side of the tendon transection) by examining gap resistance ex vivo. Fifty-one MGH flexor tendon repairs were performed on explanted fresh human cadaver tendons. The experimental groups were randomly assigned to receive 0, 1, 2, 3, or 4 crosses on each side of the tenorrhaphy. Strength and toughness to gap formation and to ultimate failure were assessed tensiometrically. The MGH two-cross configuration was most resistant to gap formation (peak load 39 +/- 3 N; p < 0.05), establishing this configuration as the optimal design of this four-strand crisscrossing repair technique. The augmented Becker (MGH) repair is significantly stronger and tougher than the modified Kessler repair and demonstrates no operator dependence. It is a superior technique for zone II tenorrhaphy in the human hand. An algorithm is presented as a systematic approach that includes the important elements necessary for the rigorous biomechanical evaluation of any tendon repair technique.

Explore related subjects

Algorithms Biomechanical Phenomena Cadaver Finger Injuries Humans In Vitro Techniques Surgery, Plastic Suture Techniques Tendon Injuries Comparative Study Journal Article

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

R J Wassermann, R Howard, B Markee, W Payne, L Ondrovic, W Lee, D P Greenwald. 1997. Optimization of the MGH repair using an algorithm for tenorrhaphy evaluation.. https://pubmed.ncbi.nlm.nih.gov/9145140/

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↗