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: 21838552)

  • 1. Tight analysis of the (1+1)-EA for the single source shortest path problem.
    Doerr B; Happ E; Klein C
    Evol Comput; 2011; 19(4):673-91. PubMed ID: 21838552
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem.
    Horoba C
    Evol Comput; 2010; 18(3):357-81. PubMed ID: 20560760
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Dynamic algorithms for the shortest path routing problem: learning automata-based solutions.
    Misra S; Oommen BJ
    IEEE Trans Syst Man Cybern B Cybern; 2005 Dec; 35(6):1179-92. PubMed ID: 16366244
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Optimal parallel algorithm for shortest paths problem on interval graphs.
    Mishra PK
    J Zhejiang Univ Sci; 2004 Sep; 5(9):1135-43. PubMed ID: 15323010
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Analyses of simple hybrid algorithms for the vertex cover problem.
    Friedrich T; He J; Hebbinghaus N; Neumann F; Witt C
    Evol Comput; 2009; 17(1):3-19. PubMed ID: 19207086
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Network orientation via shortest paths.
    Silverbush D; Sharan R
    Bioinformatics; 2014 May; 30(10):1449-55. PubMed ID: 24470573
    [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. A Fast Numerical Method for Max-Convolution and the Application to Efficient Max-Product Inference in Bayesian Networks.
    Serang O
    J Comput Biol; 2015 Aug; 22(8):770-83. PubMed ID: 26161499
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Distributed algorithms from arboreal ants for the shortest path problem.
    Garg S; Shiragur K; Gordon DM; Charikar M
    Proc Natl Acad Sci U S A; 2023 Feb; 120(6):e2207959120. PubMed ID: 36716366
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Improved algorithms for enumerating tree-like chemical graphs with given path frequency.
    Ishida Y; Zhao L; Nagamochi H; Akutsu T
    Genome Inform; 2008; 21():53-64. PubMed ID: 19425147
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Approximation and Parameterized Runtime Analysis of Evolutionary Algorithms for the Maximum Cut Problem.
    Zhou Y; Lai X; Li K
    IEEE Trans Cybern; 2015 Aug; 45(8):1491-8. PubMed ID: 25222964
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Factorization and pseudofactorization of weighted graphs.
    Sheridan K; Berleant J; Bathe M; Condon A; Williams VV
    Discrete Appl Math; 2023 Oct; 337():81-105. PubMed ID: 37213330
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A new evolutionary algorithm for solving many-objective optimization problems.
    Zou X; Chen Y; Liu M; Kang L
    IEEE Trans Syst Man Cybern B Cybern; 2008 Oct; 38(5):1402-12. PubMed ID: 18784020
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Runtime analysis of the (mu+1) EA on simple Pseudo-Boolean functions.
    Witt C
    Evol Comput; 2006; 14(1):65-86. PubMed ID: 16536891
    [TBL] [Abstract][Full Text] [Related]  

  • 15. The approximability of shortest path-based graph orientations of protein-protein interaction networks.
    Blokh D; Segev D; Sharan R
    J Comput Biol; 2013 Dec; 20(12):945-57. PubMed ID: 24073924
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Incremental Multi-Scale Search Algorithm for Dynamic Path Planning With Low Worst-Case Complexity.
    Yibiao Lu ; Xiaoming Huo ; Arslan O; Tsiotras P
    IEEE Trans Syst Man Cybern B Cybern; 2011 Dec; 41(6):1556-70. PubMed ID: 21690015
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks.
    Jing Z; Meister M
    ArXiv; 2024 Jul; ():. PubMed ID: 39108292
    [TBL] [Abstract][Full Text] [Related]  

  • 19. An analogue approach to the travelling salesman problem using an elastic net method.
    Durbin R; Willshaw D
    Nature; 1987 Apr 16-22; 326(6114):689-91. PubMed ID: 3561510
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Fast marching methods for the continuous traveling salesman problem.
    Andrews J; Sethian JA
    Proc Natl Acad Sci U S A; 2007 Jan; 104(4):1118-23. PubMed ID: 17220271
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.