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

Computing recombination networks from binary sequences.

Daniel H Huson1, Tobias H Kloepper

  • 1Center for Bioinformatics, Tübingen University Sand 14, Tübingen, Germany. huson@informatik.uni-tuebingen.de

Bioinformatics (Oxford, England)
|October 6, 2005
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

Displacement-Optimized Tanglegrams for Trees and Networks.

Molecular biology and evolution·2026
Same author

MMonitor for real-time monitoring of microbial communities using long reads.

Cell reports methods·2025
Same author

Sketch, capture and layout phylogenies.

PLoS computational biology·2025
Same author

PhyloFusion-Fast and Easy Fusion of Rooted Phylogenetic Trees into Rooted Phylogenetic Networks.

Systematic biology·2025
Same author

Transformations to Simplify Phylogenetic Networks.

Bulletin of mathematical biology·2025
Same author

Corrigendum: Interplay of various evolutionary modes in genome diversification and adaptive evolution of the family <i>Sulfolobaceae</i>.

Frontiers in microbiology·2025
Same journal

Biomedical Concept Recognition with Error-aware Negative-enhanced Ranking Framework.

Bioinformatics (Oxford, England)·2026
Same journal

TEDLH: Domain HMMs for sensitive detection of remote homologues.

Bioinformatics (Oxford, England)·2026
Same journal

PLNFGL: Joint Estimation of Multi-Condition Gene Networks from Single-cell RNA-seq Data.

Bioinformatics (Oxford, England)·2026
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026
See all related articles

This study presents a method for computing the most parsimonious recombination network, crucial for understanding molecular evolution with reticulate events. The approach extends hybridization network computation and is available in SplitsTree4 software.

Area of Science:

  • Molecular Evolution
  • Computational Biology
  • Bioinformatics

Background:

  • Reticulate evolutionary events like hybridization and recombination are increasingly recognized in molecular evolution.
  • Growing data quantity and quality necessitate advanced phylogenetic analysis tools.
  • Phylogenetic networks are essential for modeling complex evolutionary histories.

Purpose of the Study:

  • To compute the most parsimonious recombination network for binary sequence alignments.
  • To extend existing hybridization network computation methods for recombination networks.
  • To provide a robust implementation for analyzing biological datasets with recombination.

Main Methods:

  • Utilizes the concept of splits networks as the underlying data structure.

Related Experiment Videos

  • Extends a recent method for computing hybridization networks.
  • Applies the method to alignments of binary sequences under the infinite sites model with recombination.

    • Main Results:

    • Successfully extends hybridization network computation to recombination networks.
    • Demonstrates a robust implementation applicable to real biological datasets.
    • Provides a method for inferring parsimonious recombination networks.

    Conclusions:

    • The presented method effectively computes parsimonious recombination networks.
    • The SplitsTree4 software offers a practical implementation of this approach.
    • This work advances the analysis of molecular evolution involving recombination.