PubMed Health⌕ Search

PubMed · 10521632

Flat foot functional evaluation using pattern recognition of ground reaction data.

Abstract

OBJECTIVE: Main purpose of this study was to apply quantitative gait analysis and statistical pattern recognition as clinical decision-making aids in flat foot diagnosis and post-surgery monitoring. DESIGN: Statistical pattern recognition techniques were applied to discriminate between normal and flat foot populations through ground reaction force measurements; ground reaction forces time course was assumed as a sensible index of the foot function. BACKGROUND: Gait analysis is becoming recognized as an important clinical tool in orthopaedics, in pre-surgery planning, post-surgery monitoring and in a posteriori evaluation of different treatment techniques. Statistical pattern recognition techniques have been utilized with success in this field to identify the most significant variables of selected motor functions in different pathologies, and to design classification rules and quantitative evaluation scores. METHODS: Ground reaction forces were recorded during free speed barefoot walks on 28 healthy subjects, and 28 symptomatic flexible flat foot children selected for surgical intervention. A new feature selection algorithm, based on heuristic optimization, was applied to select the most discriminant ground reaction forces time samples. A two-stage pattern recognition system, composed by three linear feature extractors, one for each ground reaction force component, and a linear classifier, was designed to classify the feet of each subject using the selected features. The output of the classifier was used to define a functional score. RESULTS: The classifier assigned the ground reaction force patterns performed by each subject into the right class with an estimated error of 15%, corresponding to an assignment error for each subject's foot of 9%. The most discriminant ground reaction forces time samples selected are in full agreement with the pathophysiology of the symptomatic flexible flat foot. The obtained score was utilized to monitor the 1 and 2 years post-operative functional recovery of two differently treated subgroups of 32 flexible flat foot subjects. CONCLUSIONS: Statistical pattern recognition techniques are promising tools for clinical gait analysis; the obtained score provides important functional information that could be used as a further aid in the clinical evaluation of flat foot and different surgical treatment techniques. RELEVANCE: Symptomatic flexible flat foot surgical decision making is frequently difficult because of the lack of objective criteria to assess functional abnormalities of the foot/ankle complex. Gait analysis and statistical pattern recognition can give us parameters with which to characterize "functional" flat foot. Moreover, we can objectively follow up the recovery of the foot/ankle complex function after surgical treatment.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A Bertani, A Cappello, M G Benedetti, L Simoncini, F Catani. 1999. Flat foot functional evaluation using pattern recognition of ground reaction data.. https://doi.org/10.1016/s0268-0033(98)90099-7

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↗