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 *

120 related articles for article (PubMed ID: 38843249)

  • 21. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
    Ganian R; Ordyniak S
    Algorithmica; 2021; 83(2):726-752. PubMed ID: 33707803
    [TBL] [Abstract][Full Text] [Related]  

  • 22. X-architecture Steiner minimal tree algorithm based on multi-strategy optimization discrete differential evolution.
    Liu G; Yang L; Xu S; Li Z; Chen YC; Chen CH
    PeerJ Comput Sci; 2021; 7():e473. PubMed ID: 33954247
    [TBL] [Abstract][Full Text] [Related]  

  • 23. The combinatorics of discrete time-trees: theory and open problems.
    Gavryushkin A; Whidden C; Matsen FA
    J Math Biol; 2018 Apr; 76(5):1101-1121. PubMed ID: 28756523
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Performance of a cavity-method-based algorithm for the prize-collecting Steiner tree problem on graphs.
    Biazzo I; Braunstein A; Zecchina R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Aug; 86(2 Pt 2):026706. PubMed ID: 23005881
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Chemical reaction optimization for solving shortest common supersequence problem.
    Khaled Saifullah CM; Rafiqul Islam M
    Comput Biol Chem; 2016 Oct; 64():82-93. PubMed ID: 27299980
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Heuristic Tree-Partition-Based Parallel Method for Biophysically Detailed Neuron Simulation.
    Zhang Y; Du K; Huang T
    Neural Comput; 2023 Mar; 35(4):627-644. PubMed ID: 36746142
    [TBL] [Abstract][Full Text] [Related]  

  • 27. A Physarum-inspired approach to the Euclidean Steiner tree problem.
    Hsu S; Massolo FIS; Schaposnik LP
    Sci Rep; 2022 Aug; 12(1):14536. PubMed ID: 36008426
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Algorithms for multiple genome rearrangement by signed reversals.
    Wu S; Gu X
    Pac Symp Biocomput; 2003; ():363-74. PubMed ID: 12603042
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Local search for the generalized tree alignment problem.
    Varón A; Wheeler WC
    BMC Bioinformatics; 2013 Feb; 14():66. PubMed ID: 23441880
    [TBL] [Abstract][Full Text] [Related]  

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

  • 31. A physarum-inspired prize-collecting steiner tree approach to identify subnetworks for drug repositioning.
    Sun Y; Hameed PN; Verspoor K; Halgamuge S
    BMC Syst Biol; 2016 Dec; 10(Suppl 5):128. PubMed ID: 28105946
    [TBL] [Abstract][Full Text] [Related]  

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

  • 33. Netcombin: An algorithm for constructing optimal phylogenetic network from rooted triplets.
    Poormohammadi H; Sardari Zarchi M
    PLoS One; 2020; 15(9):e0227842. PubMed ID: 32947609
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Cubic time algorithms of amalgamating gene trees and building evolutionary scenarios.
    Lyubetsky VA; Rubanov LI; Rusin LY; Gorbunov KY
    Biol Direct; 2012 Dec; 7():48. PubMed ID: 23259766
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Exact and heuristic algorithms for Space Information Flow.
    Uwitonze A; Huang J; Ye Y; Cheng W; Li Z
    PLoS One; 2018; 13(3):e0193350. PubMed ID: 29584729
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Multilayer obstacle-avoiding x-architecture steiner minimal tree construction based on particle swarm optimization.
    Liu G; Huang X; Guo W; Niu Y; Chen G
    IEEE Trans Cybern; 2015 May; 45(5):989-1002. PubMed ID: 25122852
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Automatically generated algorithms for the vertex coloring problem.
    Contreras Bolton C; Gatica G; Parada V
    PLoS One; 2013; 8(3):e58551. PubMed ID: 23516506
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths.
    Qi X; Fu Z; Xiong J; Zha W
    PLoS One; 2020; 15(2):e0227702. PubMed ID: 32027655
    [TBL] [Abstract][Full Text] [Related]  

  • 39. On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem.
    Bossek J; Grimme C
    Evol Comput; 2024 Jun; 32(2):143-175. PubMed ID: 37290030
    [TBL] [Abstract][Full Text] [Related]  

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

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