Optimal computation of probability functions for pedigree analysis

Area of Science:

• Computational mathematics
• Combinatorial optimization
• Algorithm analysis

Background:

• Optimal peeling sequences are crucial in various computational problems.
• Understanding the structure of these sequences is an ongoing challenge.
• Existing methods for finding optimal sequences are often limited.

Purpose of the Study:

• To establish a novel correspondence between peeling sequences and marriage permutations.
• To compare the efficacy of different search algorithms for identifying optimal peeling sequences.
• To investigate the topological properties of the space of all peeling sequences.

Main Methods:

• Establishing a mathematical correspondence between peeling sequences and permutations of marriages.
• Implementing and comparing random downhill search and the annealing algorithm.
• Analyzing the topology of the solution space.

Main Results:

• A clear relationship was identified between optimal peeling sequences and marriage permutations.
• The annealing algorithm demonstrated competitive performance against random downhill search.
• The study provides insights into the structural landscape of peeling sequences.

Conclusions:

• The established correspondence offers a new perspective for solving peeling sequence problems.
• Comparative analysis highlights the strengths of different search strategies.
• Further exploration of the sequence topology can lead to more efficient algorithms.