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 *

113 related articles for article (PubMed ID: 38907506)

  • 21. Marathon: An Open Source Software Library for the Analysis of Markov-Chain Monte Carlo Algorithms.
    Rechner S; Berger A
    PLoS One; 2016; 11(1):e0147935. PubMed ID: 26824442
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Constructing small genome graphs via string compression.
    Qiu Y; Kingsford C
    Bioinformatics; 2021 Jul; 37(Suppl_1):i205-i213. PubMed ID: 34252955
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
    Del Genio CI; Kim H; Toroczkai Z; Bassler KE
    PLoS One; 2010 Apr; 5(4):e10012. PubMed ID: 20386694
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Cyclization in bipartite random graphs.
    Lushnikov AA
    Phys Rev E; 2020 Mar; 101(3-1):032306. PubMed ID: 32289946
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Breaking of Ensemble Equivalence in Networks.
    Squartini T; de Mol J; den Hollander F; Garlaschelli D
    Phys Rev Lett; 2015 Dec; 115(26):268701. PubMed ID: 26765034
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Graph Matching between Bipartite and Unipartite Networks: to Collapse, or not to Collapse, that is the Question.
    Arroyo J; Priebe CE; Lyzinski V
    IEEE Trans Netw Sci Eng; 2021; 8(4):3019-3033. PubMed ID: 35224127
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Transduction on Directed Graphs via Absorbing Random Walks.
    De J; Zhang X; Lin F; Cheng L; De J; Xiaowei Zhang ; Feng Lin ; Li Cheng ; De J; Cheng L; Zhang X; Lin F
    IEEE Trans Pattern Anal Mach Intell; 2018 Jul; 40(7):1770-1784. PubMed ID: 28809671
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Link and subgraph likelihoods in random undirected networks with fixed and partially fixed degree sequences.
    Foster JG; Foster DV; Grassberger P; Paczuski M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Oct; 76(4 Pt 2):046112. PubMed ID: 17995065
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Graph animals, subgraph sampling, and motif search in large networks.
    Baskerville K; Grassberger P; Paczuski M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Sep; 76(3 Pt 2):036107. PubMed ID: 17930306
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Highly scalable maximum likelihood and conjugate Bayesian inference for ERGMs on graph sets with equivalent vertices.
    Yin F; Butts CT
    PLoS One; 2022; 17(8):e0273039. PubMed ID: 36018834
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Rewiring dynamical networks with prescribed degree distribution for enhancing synchronizability.
    Dadashi M; Barjasteh I; Jalili M
    Chaos; 2010 Dec; 20(4):043119. PubMed ID: 21198089
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Large-Scale Clustering With Structured Optimal Bipartite Graph.
    Zhang H; Nie F; Li X
    IEEE Trans Pattern Anal Mach Intell; 2023 Aug; 45(8):9950-9963. PubMed ID: 37200121
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Forced Edges and Graph Structure.
    Cloteaux B
    J Res Natl Inst Stand Technol; 2019; 124():1-9. PubMed ID: 34877169
    [TBL] [Abstract][Full Text] [Related]  

  • 34. The Complexity of Optimal Design of Temporally Connected Graphs.
    Akrida EC; Gąsieniec L; Mertzios GB; Spirakis PG
    Theory Comput Syst; 2017; 61(3):907-944. PubMed ID: 32025196
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Non-Graph Data Clustering via O(n) Bipartite Graph Convolution.
    Zhang H; Shi J; Zhang R; Li X
    IEEE Trans Pattern Anal Mach Intell; 2023 Jul; 45(7):8729-8742. PubMed ID: 37015533
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Approximate Counting of Graphical Realizations.
    Erdős PL; Kiss SZ; Miklós I; Soukup L
    PLoS One; 2015; 10(7):e0131300. PubMed ID: 26161994
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Variational Hybrid Monte Carlo for Efficient Multi-Modal Data Sampling.
    Sun S; Zhao J; Gu M; Wang S
    Entropy (Basel); 2023 Mar; 25(4):. PubMed ID: 37190347
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Estimating Graph Robustness Through the Randic Index.
    De Meo P; Messina F; Rosaci D; Sarne GML; Vasilakos AV
    IEEE Trans Cybern; 2018 Nov; 48(11):3232-3242. PubMed ID: 29990094
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Robust and Fast Markov Chain Monte Carlo Sampling of Diffusion MRI Microstructure Models.
    Harms RL; Roebroeck A
    Front Neuroinform; 2018; 12():97. PubMed ID: 30618702
    [TBL] [Abstract][Full Text] [Related]  

  • 40. A scalable, knowledge-based analysis framework for genetic association studies.
    Baurley JW; Conti DV
    BMC Bioinformatics; 2013 Oct; 14():312. PubMed ID: 24152222
    [TBL] [Abstract][Full Text] [Related]  

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