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 *

249 related articles for article (PubMed ID: 28757680)

  • 1. Parallel Algorithms for Switching Edges in Heterogeneous Graphs.
    Bhuiyan H; Khan M; Chen J; Marathe M
    J Parallel Distrib Comput; 2017 Jun; 104():19-35. PubMed ID: 28757680
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Efficient rewirings for enhancing synchronizability of dynamical networks.
    Rad AA; Jalili M; Hasler M
    Chaos; 2008 Sep; 18(3):037104. PubMed ID: 19045478
    [TBL] [Abstract][Full Text] [Related]  

  • 3. DHPV: a distributed algorithm for large-scale graph partitioning.
    Adoni WYH; Nahhal T; Krichen M; El Byed A; Assayad I
    J Big Data; 2020; 7(1):76. PubMed ID: 32953386
    [TBL] [Abstract][Full Text] [Related]  

  • 4. TurboBC: A Memory Efficient and Scalable GPU Based Betweenness Centrality Algorithm in the Language of Linear Algebra.
    Artiles O; Saeed F
    Proc Int Workshops Parallel Proc; 2021 Aug; 2021():. PubMed ID: 35440894
    [TBL] [Abstract][Full Text] [Related]  

  • 5. FlexGraph: Flexible partitioning and storage for scalable graph mining.
    Park C; Park HM; Kang U
    PLoS One; 2020; 15(1):e0227032. PubMed ID: 31978075
    [TBL] [Abstract][Full Text] [Related]  

  • 6. SNAP: A General Purpose Network Analysis and Graph Mining Library.
    Leskovec J; Sosič R
    ACM Trans Intell Syst Technol; 2016 Oct; 8(1):. PubMed ID: 28344853
    [TBL] [Abstract][Full Text] [Related]  

  • 7. An improved neural network model for the two-page crossing number problem.
    He H; Sýkora O; Mäkinen E
    IEEE Trans Neural Netw; 2006 Nov; 17(6):1642-6. PubMed ID: 17131678
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. General upper bounds on the runtime of parallel evolutionary algorithms.
    Lässig J; Sudholt D
    Evol Comput; 2014; 22(3):405-37. PubMed ID: 24195490
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Fast GPU-Based Generation of Large Graph Networks From Degree Distributions.
    Alam M; Perumalla K
    Front Big Data; 2021; 4():737963. PubMed ID: 34901842
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Implementation of the DPM Monte Carlo code on a parallel architecture for treatment planning applications.
    Tyagi N; Bose A; Chetty IJ
    Med Phys; 2004 Sep; 31(9):2721-5. PubMed ID: 15487756
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Isolate sets partition benefits community detection of parallel Louvain method.
    Qie H; Li S; Dou Y; Xu J; Xiong Y; Gao Z
    Sci Rep; 2022 May; 12(1):8248. PubMed ID: 35581228
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. A permutation method for network assembly.
    Means SA; Bläsche C; Laing CR
    PLoS One; 2020; 15(10):e0240888. PubMed ID: 33095802
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A New Augmentation Based Algorithm for Extracting Maximal Chordal Subgraphs.
    Bhowmick S; Chen TY; Halappanavar M
    J Parallel Distrib Comput; 2015 Feb; 76():132-144. PubMed ID: 25767331
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Extending molecular simulation time scales: Parallel in time integrations for high-level quantum chemistry and complex force representations.
    Bylaska EJ; Weare JQ; Weare JH
    J Chem Phys; 2013 Aug; 139(7):074114. PubMed ID: 23968079
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Loops and multiple edges in modularity maximization of networks.
    Cafieri S; Hansen P; Liberti L
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Apr; 81(4 Pt 2):046102. PubMed ID: 20481781
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 13.