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 *

221 related articles for article (PubMed ID: 34764602)

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

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

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

  • 4. Simultaneous Matrix Orderings for Graph Collections.
    van Beusekom N; Meulemans W; Speckmann B
    IEEE Trans Vis Comput Graph; 2022 Jan; 28(1):1-10. PubMed ID: 34587024
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 7. Heuristic search in constrained bipartite matching with applications to protein NMR backbone resonance assignment.
    Lin G; Tegos T; Chen ZZ
    J Bioinform Comput Biol; 2005 Dec; 3(6):1331-50. PubMed ID: 16374910
    [TBL] [Abstract][Full Text] [Related]  

  • 8. ABCDE: Approximating Betweenness-Centrality ranking with progressive-DropEdge.
    Mirakyan M
    PeerJ Comput Sci; 2021; 7():e699. PubMed ID: 34604524
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. DHPV: a distributed algorithm for large-scale graph partitioning.
    Adoni WYH; Nahhal T; Krichen M; El Byed A; Assayad I
    J Big Data; 2020; 7(1):76. PubMed ID: 32953386
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Approximating maximum clique with a Hopfield network.
    Jagota A
    IEEE Trans Neural Netw; 1995; 6(3):724-35. PubMed ID: 18263357
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Clone temporal centrality measures for incomplete sequences of graph snapshots.
    Hanke M; Foraita R
    BMC Bioinformatics; 2017 May; 18(1):261. PubMed ID: 28511665
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Socio-ecological network structures from process graphs.
    Lao A; Cabezas H; Orosz Á; Friedler F; Tan R
    PLoS One; 2020; 15(8):e0232384. PubMed ID: 32750052
    [TBL] [Abstract][Full Text] [Related]  

  • 16. HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem.
    Liu Y; Guo P; Zeng Y
    Comput Intell Neurosci; 2022; 2022():6400318. PubMed ID: 35096045
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A note on computational approaches for the antibandwidth problem.
    Sinnl M
    Cent Eur J Oper Res; 2021; 29(3):1057-1077. PubMed ID: 34776784
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Efficient Heuristic Algorithms for Single-Vehicle Task Planning With Precedence Constraints.
    Bai X; Cao M; Yan W; Ge SS; Zhang X
    IEEE Trans Cybern; 2021 Dec; 51(12):6274-6283. PubMed ID: 32149678
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Heuristic algorithms for best match graph editing.
    Schaller D; Geiß M; Hellmuth M; Stadler PF
    Algorithms Mol Biol; 2021 Aug; 16(1):19. PubMed ID: 34404422
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 12.