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)

  • 21. Mutation rate matters even when optimizing monotonic functions.
    Doerr B; Jansen T; Sudholt D; Winzen C; Zarges C
    Evol Comput; 2013; 21(1):1-27. PubMed ID: 22035497
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Untangling tanglegrams: comparing trees by their drawings.
    Venkatachalam B; Apple J; St John K; Gusfield D
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):588-97. PubMed ID: 20530818
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Reconfiguring Shortest Paths in Graphs.
    Gajjar K; Jha AV; Kumar M; Lahiri A
    Algorithmica; 2024; 86(10):3309-3338. PubMed ID: 39359538
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

  • 25. A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems.
    Chen T; He J; Sun G; Chen G; Yao X
    IEEE Trans Syst Man Cybern B Cybern; 2009 Oct; 39(5):1092-106. PubMed ID: 19336324
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Multiple paths extraction in images using a constrained expanded trellis.
    Sun C; Appleton B
    IEEE Trans Pattern Anal Mach Intell; 2005 Dec; 27(12):1923-33. PubMed ID: 16355660
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Global optimization method for combined spherical-cylindrical wrapping in musculoskeletal upper limb modelling.
    Audenaert A; Audenaert E
    Comput Methods Programs Biomed; 2008 Oct; 92(1):8-19. PubMed ID: 18606476
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Hybrid evolutionary optimization of two-stage stochastic integer programming problems: an empirical investigation.
    Tometzki T; Engell S
    Evol Comput; 2009; 17(4):511-26. PubMed ID: 19916776
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Analysis of (1+1) evolutionary algorithm and randomized local search with memory.
    Sung CW; Yuen SY
    Evol Comput; 2011; 19(2):287-323. PubMed ID: 20868262
    [TBL] [Abstract][Full Text] [Related]  

  • 30. A Fast Algorithm for All-Pairs-Shortest-Paths Suitable for Neural Networks.
    Jing Z; Meister M
    Neural Comput; 2024 Nov; 36(12):2710-2733. PubMed ID: 39383024
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Minimal surfaces extend shortest path segmentation methods to 3D.
    Grady L
    IEEE Trans Pattern Anal Mach Intell; 2010 Feb; 32(2):321-34. PubMed ID: 20075461
    [TBL] [Abstract][Full Text] [Related]  

  • 32. An improved bio-inspired algorithm for the directed shortest path problem.
    Zhang X; Zhang Y; Deng Y
    Bioinspir Biomim; 2014 Nov; 9(4):046016. PubMed ID: 25405318
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities.
    Barbu A; Zhu SC
    IEEE Trans Pattern Anal Mach Intell; 2005 Aug; 27(8):1239-53. PubMed ID: 16119263
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Approximate labeling via graph cuts based on linear programming.
    Komodakis N; Tziritas G
    IEEE Trans Pattern Anal Mach Intell; 2007 Aug; 29(8):1436-53. PubMed ID: 17568146
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Combinatorial fiber-tracking of the human brain.
    Lifshits S; Tamir A; Assaf Y
    Neuroimage; 2009 Nov; 48(3):532-40. PubMed ID: 19501657
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Efficient and scalable Pareto optimization by evolutionary local selection algorithms.
    Menczer F; Degeratu M; Street WN
    Evol Comput; 2000; 8(2):223-47. PubMed ID: 10843522
    [TBL] [Abstract][Full Text] [Related]  

  • 37. An efficient and global interactive optimization methodology for path planning with multiple routing constraints.
    Xie G; Du X; Li S; Yang J; Hei X; Wen T
    ISA Trans; 2022 Feb; 121():206-216. PubMed ID: 33867133
    [TBL] [Abstract][Full Text] [Related]  

  • 38. On the shortest path problem of uncertain random digraphs.
    Li H; Zhang K
    Soft comput; 2022; 26(18):9069-9081. PubMed ID: 35909949
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Strength Pareto particle swarm optimization and hybrid EA-PSO for multi-objective optimization.
    Elhossini A; Areibi S; Dony R
    Evol Comput; 2010; 18(1):127-56. PubMed ID: 20064026
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm.
    Ning K; Leong HW
    BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S12. PubMed ID: 17217504
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 7.