Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Constructing large-scale genetic maps using an evolutionary strategy algorithm.

D Mester1, Y Ronin, D Minkov

  • 1Institute of Evolution, University of Haifa, Haifa 31905, Israel.

Genetics
|January 6, 2004
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Diversity and Sources of Multiple Disease Resistance in Hordeum spontaneum.

Plant disease·2019
Same author

Seedling Resistance to Tan Spot and Stagonospora nodorum Leaf Blotch in Wild Emmer Wheat (Triticum dicoccoides).

Plant disease·2019
Same author

Hip fractures or femoral fractures?

Osteoporosis international : a journal established as result of cooperation between the European Foundation for Osteoporosis and the National Osteoporosis Foundation of the USA·2017
Same author

Adaptive energy metabolism in four chromosomal species of subterranean mole rats.

Oecologia·2017
Same author

Foraging strategy in a subterranean rodent, Spalax ehrenbergi: a test case for optimal foraging theory.

Oecologia·2017
Same author

Identification of the sex-determining region in flathead grey mullet (Mugil cephalus).

Animal genetics·2016

This study introduces a novel algorithm for ordering genetic markers in linkage groups, addressing the NP-hard multilocus ordering problem. The method, based on the traveling salesman problem and evolution strategies, efficiently creates accurate genetic maps even with complex data.

Area of Science:

  • Genetics
  • Bioinformatics
  • Computational Biology

Background:

  • Accurate ordering of genetic markers within linkage groups is crucial for genetic mapping.
  • The multilocus ordering problem is computationally intensive, classified as NP-hard.
  • Existing methods often adapt solutions from the traveling salesman problem (TSP).

Purpose of the Study:

  • To develop and evaluate a novel, fast, and reliable algorithm for multilocus ordering.
  • To assess the algorithm's performance under various genetic data complexities.
  • To demonstrate the algorithm's utility with simulated and real genetic data.

Main Methods:

  • Application of a novel evolution-strategy-based discrete optimization algorithm for TSP.
  • Multilocus ordering based on pairwise recombination frequencies.

Related Experiment Videos

  • Analysis using simulated data with 50-400 markers, considering dominant/codominant markers, misclassification, interference, and missing data.
  • Validation using bootstrap and/or jackknife approaches.

    • Main Results:

    • The algorithm demonstrates high performance in multilocus ordering.
    • It effectively handles complexities such as marker misclassification and interference.
    • The method allows for robust verification and stabilization of genetic maps.
    • Successful application to real maize genetic data with 230 markers.

    Conclusions:

    • The proposed algorithm offers an efficient and reliable solution for the NP-hard multilocus ordering problem.
    • It provides a stable framework for genetic map construction and verification.
    • The methodology is scalable and can be accelerated using parallel computing.