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 *

122 related articles for article (PubMed ID: 37988376)

  • 1. 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]  

  • 2. 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]  

  • 3. 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]  

  • 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. New algorithms for maximum disjoint paths based on tree-likeness.
    Fleszar K; Mnich M; Spoerhase J
    Math Program; 2018; 171(1):433-461. PubMed ID: 30956356
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Connectivity Restoration in Wireless Sensor Networks via Space Network Coding.
    Uwitonze A; Huang J; Ye Y; Cheng W
    Sensors (Basel); 2017 Apr; 17(4):. PubMed ID: 28425923
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. 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]  

  • 9. 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]  

  • 10. Connectivity problems on heterogeneous graphs.
    Wu J; Khodaverdian A; Weitz B; Yosef N
    Algorithms Mol Biol; 2019; 14():5. PubMed ID: 30899321
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks.
    Sun X; Yang Y; Ma M
    Sensors (Basel); 2019 Apr; 19(8):. PubMed ID: 31018599
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Energy-Efficient Algorithm for Multicasting in Duty-Cycled Sensor Networks.
    Chen Q; Cheng S; Gao H; Li J; Cai Z
    Sensors (Basel); 2015 Dec; 15(12):31224-43. PubMed ID: 26690446
    [TBL] [Abstract][Full Text] [Related]  

  • 13. 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]  

  • 14. 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]  

  • 15. 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]  

  • 16. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Reconstruction of ancestral genomic sequences using likelihood.
    Elias I; Tuller T
    J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Maximum Target Coverage Problem in Mobile Wireless Sensor Networks.
    Liang D; Shen H; Chen L
    Sensors (Basel); 2020 Dec; 21(1):. PubMed ID: 33383935
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Efficient Algorithms for Max-Weighted Point Sweep Coverage on Lines.
    Liang D; Shen H
    Sensors (Basel); 2021 Feb; 21(4):. PubMed ID: 33669745
    [TBL] [Abstract][Full Text] [Related]  

  • 20. New Tools and Connections for Exponential-Time Approximation.
    Bansal N; Chalermsook P; Laekhanukit B; Nanongkai D; Nederlof J
    Algorithmica; 2019; 81(10):3993-4009. PubMed ID: 31496549
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.