PubMed Health⌕ Search

PubMed · 16023564

An optimized experimental protocol based on neuro-evolutionary algorithms application to the classification of dyspeptic patients and to the prediction of the effectiveness of their treatment.

Abstract

OBJECTIVE: This paper aims to present a specific optimized experimental protocol (EP) for classification and/or prediction problems. The neuro-evolutionary algorithms on which it is based and its application with two selected real cases are described in detail. The first application addresses the problem of classifying the functional (FD) or organic (OD) forms of dyspepsia; the second relates to the problem of predicting the 6-month follow-up outcome of dyspeptic patients treated by helicobacter pylori (HP) eradication therapy. METHODS AND MATERIAL: The database built by the multicentre observational study, performed in Italy by the NUD-look Study Group, provided the material studied: a collection of data from 861 patients with previously uninvestigated dyspepsia, being referred for upper gastrointestinal endoscopy to 42 Italian Endoscopic Services. The proposed EP makes use of techniques based on advanced neuro-evolutionary systems (NESs) and is structured in phases and steps. The use of specific input selection (IS) and training and testing (T and T) techniques together with genetic doping (GenD) algorithm is described in detail, as well as the steps taken in the two benchmark and optimization protocol phases. RESULTS: In terms of accuracy results, a value of 79.64% was achieved during optimization, with mean benchmark values of 64.90% for the linear discriminant analysis (LDA) and 68.15% for the multi layer perceptron (MLP), for the classification task. A value of 88.61% was achieved during optimization for the prediction task, with mean benchmark values of 49.32% for the LDA and 70.05% for the MLP. CONCLUSIONS: The proposed EP has led to the construction of inductors that are viable and usable on medical data which is representative but highly not linear. In particular, for the classification problem, these new inductors may be effectively used on the basal examination data to support doctors in deciding whether to avoid endoscopic examinations; whereas, in the prediction problem, they may support doctors' decisions about the advisability of eradication therapy. In both cases the variables selected indicate the possibility of reducing the data collection effort and also of providing information that can be used for general investigations on symptom relevance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M Buscema, E Grossi, M Intraligi, N Garbagna, A Andriulli, M Breda. 2005. An optimized experimental protocol based on neuro-evolutionary algorithms application to the classification of dyspeptic patients and to the prediction of the effectiveness of their treatment.. https://doi.org/10.1016/j.artmed.2004.12.001

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↗