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 Concept Videos

Phylogenetic Trees03:21

Phylogenetic Trees

Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.The length of the branches can depict time or the relative amount of change among organisms. For instance, the branch length might indicate the number of amino acid changes in the sequence that underlies the...
Phylogenetic Trees03:21

Phylogenetic Trees

Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.The length of the branches can depict time or the relative amount of change among organisms. For instance, the branch length might indicate the number of amino acid changes in the sequence that underlies the...
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
Microbial Phylogeny01:28

Microbial Phylogeny

Understanding the evolutionary relationships among microorganisms is fundamental to microbial ecology and taxonomy. Phylogenetic trees are essential tools for inferring these relationships, relying primarily on comparative analyses of molecular sequences such as DNA, RNA, or proteins. In microbial studies, these trees typically depict the evolutionary paths of diverse bacterial and archaeal species by mapping genetic differences accumulated over time.Phylogenetic trees are composed of tips,...
Applications of Molecular Taxonomy01:20

Applications of Molecular Taxonomy

Molecular taxonomy has revolutionized the understanding and classification of bacteria, providing precise insights into their diversity, evolutionary relationships, and ecological roles. By utilizing molecular techniques such as DNA sequencing and fingerprinting, researchers have made significant strides in various fields related to bacterial studies.Resolving Taxonomic AmbiguitiesMolecular taxonomy has been instrumental in distinguishing closely related bacterial species initially thought to...
Phylogeny01:23

Phylogeny

Phylogeny is concerned with the evolutionary diversification of organisms or groups of organisms. A group of organisms with a name is called a taxon (singular). Taxa (plural) can span different levels of the evolutionary hierarchy. For instance, the group containing all birds is a taxon (comprising the class Aves), and the group of all species of daisies (the genus Bellis) is a taxon. Phylogenies can likewise include just one genus (i.e., depict species relationships) or span an entire...

You might also read

Related Articles

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

Sort by
Same authorSame journal

Extension of partial atom-to-atom maps: uniqueness and algorithms.

Algorithms for molecular biology : AMB·2026
Same author

Enumeration of Autocatalytic Subsystems in Large Chemical Reaction Networks.

Journal of chemical theory and computation·2026
Same author

ProQSAR: A modular and reproducible framework for small-data QSAR modeling with fit-and-use models.

Journal of cheminformatics·2026
Same author

SynRXN: An Open Benchmark and Curated Dataset for Computational Reaction Modeling.

Scientific data·2026
Same author

mdxplain: Scalable molecular dynamics analysis with machine learning-based feature selection and modular workflows.

Journal of molecular biology·2026
Same author

From Small Parsimony to Horizontal Gene Transfer: Inferring Horizontal Transfer and Gene Loss for Single-Origin Characters.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026
Same journal

Lossless pangenome indexing using tag arrays.

Algorithms for molecular biology : AMB·2026
Same journal

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer.

Algorithms for molecular biology : AMB·2026
Same journal

Probing transcription factor subsets in gene regulatory networks.

Algorithms for molecular biology : AMB·2026
Same journal

Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features.

Algorithms for molecular biology : AMB·2026
See all related articles

Related Experiment Video

Updated: Jun 12, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees.

Christian Arnold1, Peter F Stadler

  • 1Bioinformatics Group, Department of Computer Science, and Interdisciplinary Center for Bioinformatics, University of Leipzig, Härtelstrasse 16-18, D-04107 Leipzig, Germany. studla@bioinf.uni-leipzig.de.

Algorithms for Molecular Biology : AMB
|June 8, 2010
PubMed
Summary
This summary is machine-generated.

This study presents a novel dynamic programming algorithm to solve the Maximal Pairing Problem (MPP) for phylogenetic trees. The new method efficiently finds optimal leaf pairings, advancing bioinformatics and comparative phylogenetics.

More Related Videos

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin
08:57

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Published on: August 14, 2018

Amplification of Near Full-length HIV-1 Proviruses for Next-Generation Sequencing
10:18

Amplification of Near Full-length HIV-1 Proviruses for Next-Generation Sequencing

Published on: October 16, 2018

Related Experiment Videos

Last Updated: Jun 12, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin
08:57

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Published on: August 14, 2018

Amplification of Near Full-length HIV-1 Proviruses for Next-Generation Sequencing
10:18

Amplification of Near Full-length HIV-1 Proviruses for Next-Generation Sequencing

Published on: October 16, 2018

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Phylogenetics

Background:

  • The Maximal Pairing Problem (MPP) is a key combinatorial optimization challenge in bioinformatics.
  • It involves finding edge-disjoint paths between leaf pairs in a phylogenetic tree to maximize total path weight.
  • Existing algorithms are limited, particularly for general multifurcating trees.

Purpose of the Study:

  • To develop efficient algorithms for solving the general Maximal Pairing Problem (MPP).
  • To address the need for scalable solutions in comparative phylogenetics and phylogenetic targeting.
  • To provide a polynomial-time solution for both binary and multifurcating trees.

Main Methods:

  • A dynamic programming algorithm is introduced for binary trees.
  • The general case for multifurcating trees is solved by combining Maximum Weighted Matching problems with dynamic programming.
  • The overall time complexity is O(n^4 log n) with respect to the number of leaves (n).

Main Results:

  • A polynomial-time algorithm is presented for the general Maximal Pairing Problem.
  • The algorithm efficiently handles large trees with high-degree vertices.
  • Source code for a C implementation is available under the GNU Public License.

Conclusions:

  • The developed algorithms enable solving the MPP for complex, large-scale phylogenetic trees.
  • This has significant implications for comparative phylogenetics and resource-limited data collection strategies.
  • The work advances computational methods in evolutionary biology.