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

Microcanonical optimization algorithm for the Euclidean Steiner problem in Rn with application to phylogenetic

Flávio Montenegro1, José R A Torreão, Nelson Maculan

  • 1COPPE-Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro, 21941-972 Rio de Janeiro RJ, Brazil.

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|December 20, 2003
PubMed
Summary

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

Challenges in the Classification of Cardiac Arrhythmias and Ischemia Using End-to-End Deep Learning and the Electrocardiogram: A Systematic Review.

Diagnostics (Basel, Switzerland)·2026
Same author

Maximizing Survival in Pediatric Congenital Cardiac Surgery Using Machine Learning, Explainability, and Simulation Techniques.

Journal of clinical medicine·2024
Same author

Equation of motion and general solution for the one-dimensional complex cell response in the signal-tuned approach.

Biological cybernetics·2015
Same author

Signal-tuned Gabor functions as models for stimulus-dependent cortical receptive fields.

Neural computation·2014
Same author

Solving the molecular distance geometry problem with inaccurate distance data.

BMC bioinformatics·2013
Same author

Disparity estimation through Green's functions of matching equations.

Biological cybernetics·2007

A new microcanonical optimization algorithm efficiently solves the high-dimensional Euclidean Steiner Tree Problem (ESTP). This method finds near-optimal Steiner trees for complex datasets, improving with higher dimensions.

Area of Science:

  • Computational geometry
  • Optimization algorithms
  • High-dimensional data analysis

Background:

  • The Euclidean Steiner Tree Problem (ESTP) seeks the shortest network connecting given points, potentially using additional Steiner points.
  • Exact solutions for ESTP are computationally infeasible for large, high-dimensional datasets due to combinatorial complexity.
  • Existing heuristic methods for high-dimensional ESTP are limited.

Purpose of the Study:

  • To introduce a novel microcanonical optimization algorithm for solving the high-dimensional ESTP.
  • To demonstrate the algorithm's effectiveness in finding near-optimal Steiner trees.
  • To assess the algorithm's performance scaling with dimensionality.

Main Methods:

  • Development of a microcanonical optimization algorithm operating on a topology-describing data structure.

Related Experiment Videos

  • Application of the algorithm to ESTP instances with up to 50 points in 50 dimensions.
  • Evaluation of computational time and solution quality.

    • Main Results:

    • The algorithm successfully finds close-to-minimum Steiner trees in reasonable computational time.
    • Performance improves as the dimensionality (n) of the problem increases.
    • The method is effective for configurations of up to p=50 points in n=50 dimensions.

    Conclusions:

    • The proposed microcanonical optimization algorithm offers an efficient heuristic for the high-dimensional ESTP.
    • Its performance advantage in higher dimensions makes it suitable for complex clustering tasks.
    • Applications include phylogenetic inference, demonstrating its utility in real-world high-dimensional problems.