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

An algorithm to improve the computational efficiency of genetic linkage analysis.

M S Braverman

    Computers and Biomedical Research, an International Journal
    |February 1, 1985
    PubMed
    Summary

    This study introduces a novel algorithm that simplifies genetic linkage analysis by relabeling alleles. This method significantly speeds up computations for complex genetic data without compromising accuracy.

    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

    Three-dimensional reconstructions of objects from serial sections using a microcomputer graphics system.

    The Journal of investigative dermatologyยท1986
    See all related articles

    Area of Science:

    • Genetics
    • Bioinformatics
    • Computational Biology

    Background:

    • Genetic linkage analysis is crucial for mapping genes but faces computational challenges.
    • High allele numbers at marker loci exponentially increase computational complexity.
    • Existing methods may not handle complex pedigrees or incomplete data effectively.

    Purpose of the Study:

    • To develop an efficient algorithm for genetic linkage analysis.
    • To reduce computational complexity associated with numerous alleles at marker loci.
    • To provide a method applicable to diverse pedigree structures and data completeness.

    Main Methods:

    • Introduced a novel relabeling algorithm for marker alleles.
    • Ensured preservation of identity-by-descent and linkage-phase information.

    Related Experiment Videos

  • Algorithm designed for arbitrary pedigree structures and both complete/incomplete phenotypic data.

    • Main Results:

    • The relabeling algorithm effectively reduces the number of alleles at marker loci.
    • This reduction significantly increases the speed of genetic linkage analysis.
    • The method maintains the integrity of identity-by-descent and linkage-phase information.

    Conclusions:

    • The developed algorithm offers a computationally efficient approach to genetic linkage analysis.
    • It overcomes limitations of previous methods by handling complex pedigrees and data.
    • This advancement facilitates more rapid and accurate gene mapping studies.