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 *

116 related articles for article (PubMed ID: 38907506)

  • 1. Impossibility result for Markov chain Monte Carlo sampling from microcanonical bipartite graph ensembles.
    Preti G; De Francisci Morales G; Riondato M
    Phys Rev E; 2024 May; 109(5):L053301. PubMed ID: 38907506
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Generation of complex bipartite graphs by using a preferential rewiring process.
    Ohkubo J; Tanaka K; Horiguchi T
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Sep; 72(3 Pt 2):036120. PubMed ID: 16241528
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Connectivity of Triangulation Flip Graphs in the Plane.
    Wagner U; Welzl E
    Discrete Comput Geom; 2022; 68(4):1227-1284. PubMed ID: 36466128
    [TBL] [Abstract][Full Text] [Related]  

  • 5. networksis: A Package to Simulate Bipartite Graphs with Fixed Marginals Through Sequential Importance Sampling.
    Admiraal R; Handcock MS
    J Stat Softw; 2008 Feb; 24(8):. PubMed ID: 29129971
    [TBL] [Abstract][Full Text] [Related]  

  • 6. (p,q)-biclique counting and enumeration for large sparse bipartite graphs.
    Yang J; Peng Y; Ouyang D; Zhang W; Lin X; Zhao X
    VLDB J; 2023 Mar; ():1-25. PubMed ID: 37362202
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs.
    Erdős PL; Mezei TR; Miklós I; Soltész D
    PLoS One; 2018; 13(8):e0201995. PubMed ID: 30102714
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Subgraph ensembles and motif discovery using an alternative heuristic for graph isomorphism.
    Baskerville K; Paczuski M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Nov; 74(5 Pt 1):051903. PubMed ID: 17279935
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Complementary algorithms for graphs and percolation.
    Lee MJ
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Aug; 76(2 Pt 2):027702. PubMed ID: 17930184
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A clustering-based biased Monte Carlo approach to protein titration curve prediction.
    Sathanur AV; Baker NA
    Proc Int Conf Mach Learn Appl; 2020 Dec; 2020():. PubMed ID: 34661203
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Biclique: an R package for maximal biclique enumeration in bipartite graphs.
    Lu Y; Phillips CA; Langston MA
    BMC Res Notes; 2020 Feb; 13(1):88. PubMed ID: 32085812
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Layered graph matching with composite cluster sampling.
    Lin L; Liu X; Zhu SC
    IEEE Trans Pattern Anal Mach Intell; 2010 Aug; 32(8):1426-42. PubMed ID: 20558875
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.
    Liang Z; Wei H
    Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Minimizing the Number of Edges via Edge Concentration in Dense Layered Graphs.
    Onoue Y; Kukimoto N; Sakamoto N; Koyamada K
    IEEE Trans Vis Comput Graph; 2016 Jun; 22(6):1652-1661. PubMed ID: 26955033
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Fast and asymptotic computation of the fixation probability for Moran processes on graphs.
    Alcalde Cuesta F; González Sequeiros P; Lozano Rojo Á
    Biosystems; 2015 Mar; 129():25-35. PubMed ID: 25625871
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types.
    Zhang Y; Phillips CA; Rogers GL; Baker EJ; Chesler EJ; Langston MA
    BMC Bioinformatics; 2014 Apr; 15():110. PubMed ID: 24731198
    [TBL] [Abstract][Full Text] [Related]  

  • 17. C4: Exploring Multiple Solutions in Graphical Models by Cluster Sampling.
    Porway J; Zhu SC
    IEEE Trans Pattern Anal Mach Intell; 2011 Sep; 33(9):1713-27. PubMed ID: 21321365
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Spectral partitioning in equitable graphs.
    Barucca P
    Phys Rev E; 2017 Jun; 95(6-1):062310. PubMed ID: 28709206
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Fast Sequential Creation of Random Realizations of Degree Sequences.
    Cloteaux B
    Internet Math; 2016; 12(3):205-219. PubMed ID: 27499709
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Bit-parallel sequence-to-graph alignment.
    Rautiainen M; Mäkinen V; Marschall T
    Bioinformatics; 2019 Oct; 35(19):3599-3607. PubMed ID: 30851095
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.