Background: It is not easy to identify the specific plant species that causes an allergic response in a certain patient at a certain time. This is further complicated by the fact that closely related plant species cause similar allergic responses. A novel mathematical technique is used for analysis of skin responses of a large number of patients to several groups of allergens for improvement of the understanding of their similarity or dissimilarity and their status regarding cross-reactivity.

Methods: The responses of 153 atopic patients to 42 different pollen extracts were tested by skin prick tests. Among the responses of patients to various extracts, a measure of dissimilarity was introduced and calculated for all pairs of allergens. A matrix-structuring technique, based on a solution of the 'Travelling Salesman Problem', was used for clustering of the investigated allergens into groups according to patients' responses. The discrimination among clusters was confirmed by statistical analysis.

Results: Sub groups can be discerned even among allergens of closely related plants, i.e. allergens that are usually regarded as fully cross-reactive. A few such cases are demonstrated for various cultivars of olives and pecans and for various sources of date palms, turf grasses, three wild chenopods and an amaranth.

Conclusion: The usefulness of the proposed approach for the understanding of similarity and dissimilarity among various pollen allergens is demonstrated.

Download full-text PDF

Source
http://dx.doi.org/10.1159/000237482DOI Listing

Publication Analysis

Top Keywords

salesman problem'
8
pollen allergens
8
plant species
8
species allergic
8
understanding similarity
8
similarity dissimilarity
8
allergens
7
responses
5
'traveling salesman
4
problem' approach
4

Similar Publications

Multi-objective and multi-stage decision-making problems require balancing multiple objectives at each stage and making optimal decision in multi-dimensional control variables, where the commonly used intelligent optimization algorithms suffer from low solving efficiency. To this end, this paper proposes an efficient algorithm named non-dominated sorting dynamic programming (NSDP), which incorporates non-dominated sorting into the traditional dynamic programming method. To improve the solving efficiency and solution diversity, two fast non-dominated sorting methods and a dynamic-crowding-distance based elitism strategy are integrated into the NSDP algorithm.

View Article and Find Full Text PDF

To balance the convergence speed and solution diversity and enhance optimization performance when addressing large-scale optimization problems, this research study presents an improved ant colony optimization (ICMPACO) technique. Its foundations include the co-evolution mechanism, the multi-population strategy, the pheromone diffusion mechanism, and the pheromone updating method. The suggested ICMPACO approach separates the ant population into elite and common categories and breaks the optimization problem into several sub-problems to boost the convergence rate and prevent slipping into the local optimum value.

View Article and Find Full Text PDF
Article Synopsis
  • The traveling salesman problem (TSP) is a well-known optimization challenge with many practical applications, and recent advancements in neural networks (NNs) have improved solutions for it.
  • Nonautoregressive (NAR) networks can speed up inference but usually produce lower quality solutions compared to other methods.
  • The authors introduce NAR4TSP, a novel NAR model that combines reinforcement learning (RL) with special architecture enhancements, showing superior performance in solution quality and speed over existing models in various TSP instances.
View Article and Find Full Text PDF

Solving a real-world package delivery routing problem using quantum annealers.

Sci Rep

October 2024

Serikat-Consultoría y Servicios Tecnológicos, 48009, Bilbao, Spain.

Research focused on the conjunction between quantum computing and routing problems has been very prolific in recent years. Most of the works revolve around classical problems such as the Traveling Salesman Problem or the Vehicle Routing Problem. The real-world applicability of these problems is dependent on the objectives and constraints considered.

View Article and Find Full Text PDF

Symmetric optical multipass matrix systems and the general rapid design methodology.

Heliyon

August 2024

Center for Advanced Quantum Studies, Applied Optics Beijing Area Major Laboratory, Department of Physics, Beijing Normal University, Beijing 100875, China.

We proposed an original type of multipass cell named symmetric optical multipass matrix system (SMMS), in which the same matrix patterns of various sizes can be formed on both sides. According to its special symmetric configurations, the SMMS design problem is modeled as a variant of the classical traveling salesman problem, which can be rapidly solved by evolutionary optimization algorithms. Two sets of 3-mirror SMMSs are designed, analyzed and built, which show superior characteristics of high stability, desirable beam quality and adjustable optical path lengths.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!