Comparing Algorithms for Genetic Mapping
Author Information
Author(s): Moysés Nascimento, Cruz Cosme Damião, Peternelli Luiz Alexandre, Campana Ana Carolina Mota
Primary Institution: Universidade Federal de Viçosa
Hypothesis
The study aims to evaluate the efficacy of simulated annealing and rapid chain delineation methods in establishing the most efficient linkage order when constructing genetic maps.
Conclusion
Simulated annealing was found to be more efficient than rapid chain delineation for very saturated linkage groups.
Supporting Evidence
- Simulated annealing produced shorter distances in less than 50% of the cases for saturated groups.
- The average execution time for simulated annealing did not exceed 112 seconds.
- Results showed that the number of individuals in the population does not affect ordering but does affect estimates of recombination frequencies.
Takeaway
This study looked at two methods for organizing genes on a map and found that one method works better when there are a lot of genes close together.
Methodology
Four F2 co-dominant populations of sizes 50, 100, 200, and 1000 were simulated to compare the two algorithms.
Limitations
The study primarily focused on saturated linkage groups and may not generalize to less saturated groups.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website