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 *

123 related articles for article (PubMed ID: 34434619)

  • 1. An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication.
    Hunt FY
    J Res Natl Inst Stand Technol; 2016; 121():180-195. PubMed ID: 34434619
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.
    Friedrich T; Neumann F
    Evol Comput; 2015; 23(4):543-58. PubMed ID: 26135719
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Frustrated random walks: A faster algorithm to evaluate node distances on connected and undirected graphs.
    Li E; Le Z
    Phys Rev E; 2020 Nov; 102(5-1):052135. PubMed ID: 33327202
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Systematic comparison between methods for the detection of influential spreaders in complex networks.
    Erkol Ş; Castellano C; Radicchi F
    Sci Rep; 2019 Oct; 9(1):15095. PubMed ID: 31641200
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Finding near-optimal groups of epidemic spreaders in a complex network.
    Moores G; Shakarian P; Macdonald B; Howard N
    PLoS One; 2014; 9(4):e90303. PubMed ID: 24694693
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Ranking with submodular functions on a budget.
    Zhang G; Tatti N; Gionis A
    Data Min Knowl Discov; 2022; 36(3):1197-1218. PubMed ID: 35601821
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Near-Optimal Graph Signal Sampling by Pareto Optimization.
    Luo D; Si B; Zhang S; Yu F; Zhu J
    Sensors (Basel); 2021 Feb; 21(4):. PubMed ID: 33670548
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Mean Hitting Time for Random Walks on a Class of Sparse Networks.
    Su J; Wang X; Yao B
    Entropy (Basel); 2021 Dec; 24(1):. PubMed ID: 35052059
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A graph exploration method for identifying influential spreaders in complex networks.
    Salamanos N; Voudigari E; Yannakoudakis EJ
    Appl Netw Sci; 2017; 2(1):26. PubMed ID: 30443581
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Detection of the dominant direction of information flow and feedback links in densely interconnected regulatory networks.
    Ispolatov I; Maslov S
    BMC Bioinformatics; 2008 Oct; 9():424. PubMed ID: 18842147
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Quadratic Speedup for Spatial Search by Continuous-Time Quantum Walk.
    Apers S; Chakraborty S; Novo L; Roland J
    Phys Rev Lett; 2022 Oct; 129(16):160502. PubMed ID: 36306753
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions.
    Bai W; Noble WS; Bilmes JA
    Adv Neural Inf Process Syst; 2018 Dec; 2018():7989-7999. PubMed ID: 30705579
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Entropy-rate clustering: cluster analysis via maximizing a submodular function subject to a matroid constraint.
    Liu MY; Tuzel O; Ramalingam S; Chellappa R
    IEEE Trans Pattern Anal Mach Intell; 2014 Jan; 36(1):99-112. PubMed ID: 24231869
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
    Chakraborty S; Novo L; Ambainis A; Omar Y
    Phys Rev Lett; 2016 Mar; 116(10):100501. PubMed ID: 27015464
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Submodular Memetic Approximation for Multiobjective Parallel Test Paper Generation.
    Nguyen ML; Hui SC; Fong ACM
    IEEE Trans Cybern; 2017 Jun; 47(6):1562-1575. PubMed ID: 27352402
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Community-based rumor blocking maximization in social networks: Algorithms and analysis.
    Ni Q; Guo J; Huang C; Wu W
    Theor Comput Sci; 2020 Nov; 840():257-269. PubMed ID: 32939100
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Influence maximization in complex networks through optimal percolation.
    Morone F; Makse HA
    Nature; 2015 Aug; 524(7563):65-8. PubMed ID: 26131931
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Optimizing phylogenetic diversity under constraints.
    Moulton V; Semple C; Steel M
    J Theor Biol; 2007 May; 246(1):186-94. PubMed ID: 17275037
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Influencing Busy People in a Social Network.
    Sarkar K; Sundaram H
    PLoS One; 2016; 11(10):e0162014. PubMed ID: 27711127
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Network conduciveness with application to the graph-coloring and independent-set optimization transitions.
    Barbosa VC
    PLoS One; 2010 Jul; 5(7):e11232. PubMed ID: 20628597
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.