Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Field Procedure for Staking Out Curves

Field Procedure for Staking Out Curves

Staking out curves is an essential process in construction to ensure the accurate alignment of structures along a curved path. This task involves positioning stakes at calculated locations corresponding to the curve's design, effectively translating plans into physical markers in the field. The process begins by determining the geometric parameters of the curve, including the radius, central angle, and tangent distances. These parameters are critical for identifying key points such as the Point...

Adjusting a Traverse

Adjusting a Traverse

In the site survey of a four-sided traverse, internal angles are essential to ensure geometric accuracy. The survey revealed that the sum of the measured internal angles was 359 degrees and 48 minutes, which is 12 minutes less than the expected 360 degrees. This discrepancy signals an error likely arising from measurement inaccuracies during the fieldwork.To rectify this error, the adjustment process involved distributing the 12-minute shortfall equally across the four internal angles. By...

Survival Tree

Survival Tree

Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
Building a Survival Tree
Constructing a survival tree begins...

Seedless Vascular Plants

Seedless Vascular Plants

Seedless Vascular Plants Were the First Tall Plants on Earth

Phylogenetic Trees

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 Trees

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

You might also read

Related Articles

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

Sort by

Same author

The <i>k</i>-Robinson-Foulds Dissimilarity Measures for Comparison of Labeled Trees.

Journal of computational biology : a journal of computational molecular cell biology·2024

Same author

New algorithms for structure informed genome rearrangement.

Algorithms for molecular biology : AMB·2023

Same author

The Landscape of Virus-Host Protein-Protein Interaction Databases.

Frontiers in microbiology·2022

Same author

Predicting the pathogenicity of bacterial genomes using widely spread protein families.

BMC bioinformatics·2022

Same author

The Generalized Robinson-Foulds Distance for Phylogenetic Trees.

Journal of computational biology : a journal of computational molecular cell biology·2021

Same author

Approximate search for known gene clusters in new genomes using PQ-trees.

Algorithms for molecular biology : AMB·2021

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

Search research articles

Related Experiment Video

Updated: Jun 28, 2026

Scalable, Flexible, and Cost-Effective Seedling Grafting

Scalable, Flexible, and Cost-Effective Seedling Grafting

Published on: January 6, 2023

Seeded tree alignment.

Antoni Lozano¹, Ron Y Pinter, Oleg Rokhlenko

¹Logic and Programming Research Group, Department of Software, Technical University of Catalonia, Jordi Girona, 1-3 Modul Omega, Campus Nord, E-08034 Barcelona, Spain. antoni@lsi.upc.edu

IEEE/ACM Transactions on Computational Biology and Bioinformatics

|November 8, 2008

Summary

This summary is machine-generated.

We present efficient algorithms for transforming one tree to another using seeded nodes. This addresses computational biology problems like RNA structure matching and phylogeny reconciliation.

More Related Videos

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Published on: August 14, 2018

The ITS2 Database

The ITS2 Database

Published on: March 12, 2012

Related Experiment Videos

Last Updated: Jun 28, 2026

Scalable, Flexible, and Cost-Effective Seedling Grafting

Scalable, Flexible, and Cost-Effective Seedling Grafting

Published on: January 6, 2023

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Published on: August 14, 2018

The ITS2 Database

The ITS2 Database

Published on: March 12, 2012

Area of Science:

Computational Biology
Algorithmic Problem
Bioinformatics

Background:

Tree transformation is crucial for computational biology.
Existing methods lack efficiency for constrained tree matching.
Partial node mapping (seeds) presents a unique challenge.

Purpose of the Study:

Introduce efficient algorithms for constrained tree transformation.
Address both ordered and unordered tree matching with seeds.
Solve the planar tanglegram layout problem for phylogeny reconciliation.

Main Methods:

Developed algorithms for ordered tree matching using seeded nodes.
Developed algorithms for unordered tree matching using seeded nodes.
Provided a polynomial-time algorithm for planar tanglegram layout.

Main Results:

Efficient algorithms for seeded tree matching are presented.
Ordered tree matching is applicable to RNA structure pattern matching.
Unordered tree matching is applicable to co-speciation and phylogeny reconciliation.

Conclusions:

The introduced algorithms offer efficient solutions for seeded tree matching problems.
This work advances computational biology by providing tools for RNA structure analysis and phylogenetic reconciliation.
The polynomial-time solution for planar tanglegram layout is a significant contribution.