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

Deriving haplotypes through recombination and gene conversion pathways.

Nadia el-Mabrouk1

  • 1Département d'informatique et de recherche opérationnelle, Université de Montréal, CP 6128 Succursale Centre-ville, Montréal, QC, H3C 3J7, Canada. mabrouk@iro.umontreal.ca

Journal of Bioinformatics and Computational Biology
|August 7, 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

FullSynesth: Syntenic Reconciliation of a Set of Consistent Gene Trees.

Theory of computing systems·2026
Same author

On the complexity of non-binary tree reconciliation with endosymbiotic gene transfer.

Algorithms for molecular biology : AMB·2023
Same author

A Linear Time Solution to the Labeled Robinson-Foulds Distance Problem.

Systematic biology·2022
Same author

Gene tree and species tree reconciliation with endosymbiotic gene transfer.

Bioinformatics (Oxford, England)·2021
Same author

A generalized Robinson-Foulds distance for labeled trees.

BMC genomics·2020
Same author

ISMB 2020 proceedings.

Bioinformatics (Oxford, England)·2020
Same journal

CNV-ECOD: A copy number variation detection method based on ECOD algorithm using next-generation sequencing data.

Journal of bioinformatics and computational biology·2026
Same journal

ReinVar: A model-free paradigm-based reinforcement learning approach to detect copy number variation.

Journal of bioinformatics and computational biology·2026
Same journal

When pipelines run but coordinates fail: A simple spatial specificity check for false locality in post-GWAS analysis.

Journal of bioinformatics and computational biology·2026
Same journal

Comparative benchmarking of template-based, evolutionary-diffusion, and generative language models for IsPETase structure prediction.

Journal of bioinformatics and computational biology·2026
Same journal

Trap spaces as labelled ideals of SCC posets: A structural-functional theory of reachability in asynchronous boolean networks.

Journal of bioinformatics and computational biology·2026
Same journal

Erratum - DDINet: Drug-drug interaction prediction network based on multi-molecular fingerprint features and multi-head attention centered weighted autoencoder.

Journal of bioinformatics and computational biology·2026
See all related articles

This study introduces a novel method to reconstruct new haplotypes from ancestral DNA sequences using minimal genetic recombination and gene conversion pathways. The research presents a polynomial algorithm for efficiently solving this complex genomic folding problem.

Area of Science:

  • Genomics
  • Population Genetics
  • Bioinformatics

Background:

  • Understanding genome structure relies on tracing past genetic events.
  • Haplotype diversity arises from mutations, recombination, and gene conversion.
  • Human genome haplotype diversity is characterized by common ancestral haplotypes and rare new ones.

Purpose of the Study:

  • To propose a method for deriving new haplotypes from ancestral ones.
  • To identify minimal pathways of genetic recombination and gene conversion.
  • To represent this derivation as a minimum energy folding problem.

Main Methods:

  • Developing a method to derive new haplotypes from sets of ancestral haplotypes.
  • Describing classes of minimal pathways for haplotype derivation.

Related Experiment Videos

  • Modeling the problem as finding minimum energy secondary structures.
  • Presenting a polynomial algorithm to solve the folding problem.

    • Main Results:

    • A method is proposed to derive new haplotypes through minimal genetic pathways.
    • The derivation process is mathematically represented as a minimum energy folding problem.
    • A polynomial-time algorithm is developed to solve this problem.

    Conclusions:

    • The proposed method provides a novel approach to reconstructing haplotype evolution.
    • The algorithm offers an efficient computational solution for haplotype derivation.
    • This work contributes to understanding genome structure and population genetics.