BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

116 related articles for article (PubMed ID: 38843249)

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

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

  • 3. The Steiner cycle and path cover problem on interval graphs.
    Ćustić A; Lendl S
    J Comb Optim; 2022; 43(1):226-234. PubMed ID: 35125930
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A construction heuristic for the capacitated Steiner tree problem.
    Van den Eynde S; Audenaert P; Colle D; Pickavet M
    PLoS One; 2022; 17(6):e0270147. PubMed ID: 35709229
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 10. TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs.
    Zhang Y; Wang S; Liu C; Zhu E
    Sensors (Basel); 2023 Sep; 23(18):. PubMed ID: 37765887
    [TBL] [Abstract][Full Text] [Related]  

  • 11. HSMVS: heuristic search for minimum vertex separator on massive graphs.
    Luo C; Guo S
    PeerJ Comput Sci; 2024; 10():e2013. PubMed ID: 38855221
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
    Nishiyama Y; Shurbevski A; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):77-90. PubMed ID: 29994050
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Computing nearest neighbour interchange distances between ranked phylogenetic trees.
    Collienne L; Gavryushkin A
    J Math Biol; 2021 Jan; 82(1-2):8. PubMed ID: 33492606
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. On the centrality of vertices of molecular graphs.
    Randić M; Novič M; Vračko M; Plavšić D
    J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Inferring optimal species trees under gene duplication and loss.
    Bayzid MS; Mirarab S; Warnow T
    Pac Symp Biocomput; 2013; ():250-61. PubMed ID: 23424130
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Statistical mechanics of steiner trees.
    Bayati M; Borgs C; Braunstein A; Chayes J; Ramezanpour A; Zecchina R
    Phys Rev Lett; 2008 Jul; 101(3):037208. PubMed ID: 18764290
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.