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 *

61 related articles for article (PubMed ID: 17677390)

  • 1. Finding long cycles in graphs.
    Marinari E; Semerjian G; Van Kerrebroeck V
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Jun; 75(6 Pt 2):066708. PubMed ID: 17677390
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs.
    Angelini MC; Ricci-Tersenghi F
    Phys Rev E; 2019 Jul; 100(1-1):013302. PubMed ID: 31499906
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Message passing for vertex covers.
    Weigt M; Zhou H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Oct; 74(4 Pt 2):046110. PubMed ID: 17155136
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Network dismantling.
    Braunstein A; Dall'Asta L; Semerjian G; Zdeborová L
    Proc Natl Acad Sci U S A; 2016 Nov; 113(44):12368-12373. PubMed ID: 27791075
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A Monte Carlo Metropolis-Hastings algorithm for sampling from distributions with intractable normalizing constants.
    Liang F; Jin IH
    Neural Comput; 2013 Aug; 25(8):2199-234. PubMed ID: 23607562
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Finding starting points for Markov chain Monte Carlo analysis of genetic data from large and complex pedigrees.
    Luo Y; Lin S
    Genet Epidemiol; 2003 Jul; 25(1):14-24. PubMed ID: 12813723
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Estimation and marginalization using the Kikuchi approximation methods.
    Pakzad P; Anantharam V
    Neural Comput; 2005 Aug; 17(8):1836-73. PubMed ID: 15969920
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Statistical mechanics of maximal independent sets.
    Dall'Asta L; Pin P; Ramezanpour A
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 1):061136. PubMed ID: 20365147
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Interrelations between random walks on diagrams (graphs) with and without cycles.
    Hill TL
    Proc Natl Acad Sci U S A; 1988 May; 85(9):2879-83. PubMed ID: 3362853
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Robustness of random graphs based on graph spectra.
    Wu J; Barahona M; Tan YJ; Deng HZ
    Chaos; 2012 Dec; 22(4):043101. PubMed ID: 23278036
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Coloring random graphs and maximizing local diversity.
    Bounkong S; van Mourik J; Saad D
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Nov; 74(5 Pt 2):057101. PubMed ID: 17280022
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Components in time-varying graphs.
    Nicosia V; Tang J; Musolesi M; Russo G; Mascolo C; Latora V
    Chaos; 2012 Jun; 22(2):023101. PubMed ID: 22757508
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Polynomial iterative algorithms for coloring and analyzing random graphs.
    Braunstein A; Mulet R; Pagnani A; Weigt M; Zecchina R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Sep; 68(3 Pt 2):036702. PubMed ID: 14524921
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Problems with determination of noncommunicating classes for Monte Carlo Markov chain applications in pedigree analysis.
    Jensen CS; Sheehan N
    Biometrics; 1998 Jun; 54(2):416-25. PubMed ID: 9629636
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Video tracking based on sequential particle filtering on graphs.
    Pan P; Schonfeld D
    IEEE Trans Image Process; 2011 Jun; 20(6):1641-51. PubMed ID: 21118778
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Fast construction of assembly trees for molecular graphs.
    Artemova S; Grudinin S; Redon S
    J Comput Chem; 2011 Jun; 32(8):1589-98. PubMed ID: 21328401
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Comparative Monte Carlo efficiency by Monte Carlo analysis.
    Rubenstein BM; Gubernatis JE; Doll JD
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Sep; 82(3 Pt 2):036701. PubMed ID: 21230207
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Random walks on graphs for salient object detection in images.
    Gopalakrishnan V; Hu Y; Rajan D
    IEEE Trans Image Process; 2010 Dec; 19(12):3232-42. PubMed ID: 21078566
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Majority-vote model on random graphs.
    Pereira LF; Moreira FG
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jan; 71(1 Pt 2):016123. PubMed ID: 15697674
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 4.