These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

82 related articles for article (PubMed ID: 14682906)

  • 1. Microcanonical optimization algorithm for the Euclidean Steiner problem in Rn with application to phylogenetic inference.
    Montenegro F; Torreão JR; Maculan N
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Nov; 68(5 Pt 2):056702. PubMed ID: 14682906
    [TBL] [Abstract][Full Text] [Related]  

  • 2. An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length.
    Shin D; Choi S
    PLoS One; 2023; 18(11):e0294353. PubMed ID: 37988376
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Exact and heuristic algorithms for Space Information Flow.
    Uwitonze A; Huang J; Ye Y; Cheng W; Li Z
    PLoS One; 2018; 13(3):e0193350. PubMed ID: 29584729
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
    Fujita M; Shimada Y; Kimura T; Ikeguchi T
    PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems.
    Lai X; Zhou Y; Xia X; Zhang Q
    Evol Comput; 2017; 25(4):707-723. PubMed ID: 27959580
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Minimum spanning trees and random resistor networks in d dimensions.
    Read N
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Sep; 72(3 Pt 2):036114. PubMed ID: 16241522
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem.
    Zhang S; Mao J; Wang N; Li D; Ju C
    Entropy (Basel); 2022 Dec; 25(1):. PubMed ID: 36673228
    [TBL] [Abstract][Full Text] [Related]  

  • 8. ETEA: a Euclidean minimum spanning tree-based evolutionary algorithm for multi-objective optimization.
    Li M; Yang S; Zheng J; Liu X
    Evol Comput; 2014; 22(2):189-230. PubMed ID: 23746293
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Fitting a geometric graph to a protein-protein interaction network.
    Higham DJ; Rasajski M; Przulj N
    Bioinformatics; 2008 Apr; 24(8):1093-9. PubMed ID: 18344248
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Steiner minimal trees, twist angles, and the protein folding problem.
    Smith JM; Jang Y; Kim MK
    Proteins; 2007 Mar; 66(4):889-902. PubMed ID: 17173288
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A rapid heuristic algorithm for finding minimum evolution trees.
    Rodin A; Li WH
    Mol Phylogenet Evol; 2000 Aug; 16(2):173-9. PubMed ID: 10942605
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A graph theoretic approach to the development of minimal phylogenetic trees.
    Foulds LR; Hendy MD; Penny D
    J Mol Evol; 1979 Jul; 13(2):127-49. PubMed ID: 480370
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Algorithms for multiple genome rearrangement by signed reversals.
    Wu S; Gu X
    Pac Symp Biocomput; 2003; ():363-74. PubMed ID: 12603042
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Steiner tree methods for optimal sub-network identification: an empirical study.
    Sadeghi A; Fröhlich H
    BMC Bioinformatics; 2013 Apr; 14():144. PubMed ID: 23627667
    [TBL] [Abstract][Full Text] [Related]  

  • 15. X-architecture Steiner minimal tree algorithm based on multi-strategy optimization discrete differential evolution.
    Liu G; Yang L; Xu S; Li Z; Chen YC; Chen CH
    PeerJ Comput Sci; 2021; 7():e473. PubMed ID: 33954247
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Performance of flip supertree construction with a heuristic algorithm.
    Eulenstein O; Chen D; Burleigh JG; Fernández-Baca D; Sanderson MJ
    Syst Biol; 2004 Apr; 53(2):299-308. PubMed ID: 15205054
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Multilayer obstacle-avoiding x-architecture steiner minimal tree construction based on particle swarm optimization.
    Liu G; Huang X; Guo W; Niu Y; Chen G
    IEEE Trans Cybern; 2015 May; 45(5):989-1002. PubMed ID: 25122852
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks.
    Mulder SA; Wunsch DC
    Neural Netw; 2003; 16(5-6):827-32. PubMed ID: 12850040
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Coordination of cluster ensembles via exact methods.
    Christou IT
    IEEE Trans Pattern Anal Mach Intell; 2011 Feb; 33(2):279-93. PubMed ID: 20421664
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Shape optimization in lipid nanotube networks.
    Lobovkina T; Dommersnes PG; Tiourine S; Joanny JF; Orwar O
    Eur Phys J E Soft Matter; 2008 Jul; 26(3):295-300. PubMed ID: 18500443
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.