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 splits graphs.

Andreas W M Dress1, Daniel H Huson

  • 1Max-Planck-Institute for Mathematics in the Sciences, Leipzig, Germany. Andreas.Dress@mis.mpg.de

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|October 20, 2006
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

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles

Phylogenetic trees represent compatible splits. New algorithms generate incompatible splits, requiring general splits graphs for visualization. This study introduces methods for computing these graphs, implemented in SplitsTree4 software.

Area of Science:

  • Phylogenetics
  • Computational Biology
  • Graph Theory

Background:

  • Phylogenetic trees are fundamentally linked to compatible systems of splits.
  • Many modern phylogenetic algorithms produce split systems that are not compatible, thus not representable by a tree.
  • Existing methods like split decomposition and Neighbor-Net generate such complex data.

Purpose of the Study:

  • To address the challenge of computing splits graphs for potentially incompatible split systems.
  • To provide a graphical representation that generalizes phylogenetic trees.
  • To implement algorithms for generating these generalized structures.

Main Methods:

  • Developing algorithms to compute splits graphs from given sets of splits.
  • Generalizing the concept of phylogenetic trees to accommodate incompatible splits.

Related Experiment Videos

  • Implementing these algorithms in a software package.

    • Main Results:

    • The study presents a method for constructing splits graphs from arbitrary split systems.
    • These graphs offer a more general representation than traditional phylogenetic trees.
    • All developed algorithms are integrated into the SplitsTree4 software.

    Conclusions:

    • Splits graphs provide a powerful framework for visualizing and analyzing complex phylogenetic data, especially from methods yielding incompatible splits.
    • The SplitsTree4 software facilitates the practical application of these computational methods.
    • This work advances the representation of evolutionary relationships beyond simple tree structures.