Record

Record orders loci on genetic linkage maps by minimizing the total number of recombination events to determine optimal or near-optimal marker orderings.

Key Features:

• Optimization criterion: Minimizes the total number of recombination events as the objective for locus ordering.
• Heuristic algorithm: Employs a heuristic search algorithm that integrates elements of branch-and-bound techniques with local reshuffling strategies.
• Near-optimal solution set: Generates a series of optimal and near-optimal orderings to assess local certainty of locus positions.
• Computational efficiency: Uses an optimization criterion that avoids intensive calculations, enabling rapid generation of orders.
• Robustness to missing data and errors: Shows reduced sensitivity to missing observations and scoring errors because the criterion is less influenced by the position of erroneous markers.
• Performance in high-density maps: Performs effectively in regions of high marker density on linkage maps.
• Comparative performance: Demonstrated faster speed and greater robustness compared with JoinMap in comparative studies.

Scientific Applications:

• Genetic linkage map ordering: Determining the most plausible linear order of loci on linkage maps by minimizing recombination counts.
• Local ordering certainty assessment: Evaluating local confidence in locus order through analysis of near-optimal solutions.
• Linkage map construction in dense-marker regions: Improving marker ordering accuracy where marker density is high.
• Robust mapping with incomplete or noisy data: Producing reliable orders in the presence of missing observations and scoring errors.

Methodology:

Applies a heuristic search algorithm combining branch-and-bound elements with local reshuffling strategies to optimize an objective that minimizes total recombination events and to produce multiple optimal or near-optimal orders.