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 *

290 related articles for article (PubMed ID: 26710102)

  • 1. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.
    Altarelli F; Braunstein A; Dall'Asta L; De Bacco C; Franz S
    PLoS One; 2015; 10(12):e0145222. PubMed ID: 26710102
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Scalable node-disjoint and edge-disjoint multiwavelength routing.
    Xu YZ; Po HF; Yeung CH; Saad D
    Phys Rev E; 2022 Apr; 105(4-1):044316. PubMed ID: 35590677
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Stochastic matching problem.
    Altarelli F; Braunstein A; Ramezanpour A; Zecchina R
    Phys Rev Lett; 2011 May; 106(19):190601. PubMed ID: 21668134
    [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. 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]  

  • 6. Computing paths and cycles in biological interaction graphs.
    Klamt S; von Kamp A
    BMC Bioinformatics; 2009 Jun; 10():181. PubMed ID: 19527491
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Max-product algorithms for the generalized multiple-fault diagnosis problem.
    Le T; Hadjicostis CN
    IEEE Trans Syst Man Cybern B Cybern; 2007 Dec; 37(6):1607-21. PubMed ID: 18179077
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Adaptive Path Selection for Link Loss Inference in Network Tomography Applications.
    Qiao Y; Jiao J; Rao Y; Ma H
    PLoS One; 2016; 11(10):e0163706. PubMed ID: 27701447
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 11. Nonbacktracking expansion of finite graphs.
    Timár G; da Costa RA; Dorogovtsev SN; Mendes JFF
    Phys Rev E; 2017 Apr; 95(4-1):042322. PubMed ID: 28505741
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A path following algorithm for the graph matching problem.
    Zaslavskiy M; Bach F; Vert JP
    IEEE Trans Pattern Anal Mach Intell; 2009 Dec; 31(12):2227-42. PubMed ID: 19834143
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Convergent tree-reweighted message passing for energy minimization.
    Kolmogorov V
    IEEE Trans Pattern Anal Mach Intell; 2006 Oct; 28(10):1568-83. PubMed ID: 16986540
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Self avoiding paths routing algorithm in scale-free networks.
    Rachadi A; Jedra M; Zahid N
    Chaos; 2013 Mar; 23(1):013114. PubMed ID: 23556951
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Building k edge-disjoint spanning trees of minimum total length for isometric data embedding.
    Yang L
    IEEE Trans Pattern Anal Mach Intell; 2005 Oct; 27(10):1680-3. PubMed ID: 16238003
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Characterization of 2-Path Product Signed Graphs with Its Properties.
    Sinha D; Sharma D
    Comput Intell Neurosci; 2017; 2017():1235715. PubMed ID: 28761437
    [TBL] [Abstract][Full Text] [Related]  

  • 18. On robotic optimal path planning in polygonal regions with pseudo-Euclidean metrics.
    Sun Z; Reif JH
    IEEE Trans Syst Man Cybern B Cybern; 2007 Aug; 37(4):925-36. PubMed ID: 17702290
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Nonlinear regularization path for quadratic loss support vector machines.
    Karasuyama M; Takeuchi I
    IEEE Trans Neural Netw; 2011 Oct; 22(10):1613-25. PubMed ID: 21880570
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A minimum resource neural network framework for solving multiconstraint shortest path problems.
    Zhang J; Zhao X; He X
    IEEE Trans Neural Netw Learn Syst; 2014 Aug; 25(8):1566-82. PubMed ID: 25050952
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 15.