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 *

113 related articles for article (PubMed ID: 38855221)

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

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

  • 3. Dynamic thresholding search for the feedback vertex set problem.
    Sun W; Hao JK; Wu Z; Li W; Wu Q
    PeerJ Comput Sci; 2023; 9():e1245. PubMed ID: 37346631
    [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. 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]  

  • 6. NuSC: An Effective Local Search Algorithm for Solving the Set Covering Problem.
    Luo C; Xing W; Cai S; Hu C
    IEEE Trans Cybern; 2024 Mar; 54(3):1403-1416. PubMed ID: 36063511
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs.
    Fan Y; Zhang Z; Yu Q; Lai Y; Su K; Wang Y; Pan S; Latecki LJ
    Entropy (Basel); 2023 Sep; 25(10):. PubMed ID: 37895498
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Vertex Separators for Partitioning a Graph.
    Evrendilek C
    Sensors (Basel); 2008 Feb; 8(2):635-657. PubMed ID: 27879727
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Partition Independent Set and Reduction-Based Approach for Partition Coloring Problem.
    Zhu E; Jiang F; Liu C; Xu J
    IEEE Trans Cybern; 2022 Jun; 52(6):4960-4969. PubMed ID: 33108304
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Linear Time Vertex Partitioning on Massive Graphs.
    Mell P; Harang R; Gueye A
    Int J Comput Sci (Rabat); 2016; 5(1):1-11. PubMed ID: 27336059
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.
    Rodríguez-Puente R; Lazo-Cortés MS
    Springerplus; 2013; 2():291. PubMed ID: 24010024
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Heuristic-based tabu search algorithm for folding two-dimensional AB off-lattice model proteins.
    Liu J; Sun Y; Li G; Song B; Huang W
    Comput Biol Chem; 2013 Dec; 47():142-8. PubMed ID: 24077543
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Message passing for vertex covers.
    Weigt M; Zhou H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Oct; 74(4 Pt 2):046110. PubMed ID: 17155136
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Relating Vertex and Global Graph Entropy in Randomly Generated Graphs.
    Tee P; Parisis G; Berthouze L; Wakeman I
    Entropy (Basel); 2018 Jun; 20(7):. PubMed ID: 33265571
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Fast determination of structurally cohesive subgroups in large networks.
    Sinkovits RS; Moody J; Oztan BT; White DR
    J Comput Sci; 2016 Nov; 17(Pt 1):62-72. PubMed ID: 28503215
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Random graphs with arbitrary degree distributions and their applications.
    Newman ME; Strogatz SH; Watts DJ
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Aug; 64(2 Pt 2):026118. PubMed ID: 11497662
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Graph coloring using the reduced quantum genetic algorithm.
    Ardelean SM; Udrescu M
    PeerJ Comput Sci; 2022; 8():e836. PubMed ID: 35111921
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.