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: 36449449)

  • 1. UniCon: A unified star-operation to efficiently find connected components on a cluster of commodity hardware.
    Kim C; Han C; Park HM
    PLoS One; 2022; 17(11):e0277527. PubMed ID: 36449449
    [TBL] [Abstract][Full Text] [Related]  

  • 2. PACC: Large scale connected component computation on Hadoop and Spark.
    Park HM; Park N; Myaeng SH; Kang U
    PLoS One; 2020; 15(3):e0229936. PubMed ID: 32187232
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 6. A MapReduce-Based Approach for Fast Connected Components Detection from Large-Scale Networks.
    Bhat SY; Abulaish M
    Big Data; 2024 Jan; ():. PubMed ID: 38285477
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A distributed query execution engine of big attributed graphs.
    Batarfi O; Elshawi R; Fayoumi A; Barnawi A; Sakr S
    Springerplus; 2016; 5(1):665. PubMed ID: 27350905
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs.
    Sharafeldeen A; Alrahmawy M; Elmougy S
    Sci Rep; 2023 Jan; 13(1):166. PubMed ID: 36599906
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Cooperative and out-of-core execution of the irregular wavefront propagation pattern on hybrid machines with Intel
    Gomes J; de Melo ACMA; Kong J; Kurc T; Saltz JH; Teodoro G
    Concurr Comput; 2018 Jul; 30(14):. PubMed ID: 30344454
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
    Dinh H; Rajasekaran S
    Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
    Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
    BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
    [TBL] [Abstract][Full Text] [Related]  

  • 13. GRAPES-DD: exploiting decision diagrams for index-driven search in biological graph databases.
    Licheri N; Bonnici V; Beccuti M; Giugno R
    BMC Bioinformatics; 2021 Apr; 22(1):209. PubMed ID: 33888059
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Using Apache Spark on genome assembly for scalable overlap-graph reduction.
    Paul AJ; Lawrence D; Song M; Lim SH; Pan C; Ahn TH
    Hum Genomics; 2019 Oct; 13(Suppl 1):48. PubMed ID: 31639049
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities.
    Barbu A; Zhu SC
    IEEE Trans Pattern Anal Mach Intell; 2005 Aug; 27(8):1239-53. PubMed ID: 16119263
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Tugging graphs faster: efficiently modifying path-preserving hierarchies for browsing paths.
    Archambault D; Munzner T; Auber D
    IEEE Trans Vis Comput Graph; 2011 Mar; 17(3):276-89. PubMed ID: 20421680
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Motif mining based on network space compression.
    Zhang Q; Xu Y
    BioData Min; 2015; 8(1):29. PubMed ID: 25525470
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Linear Time Vertex Partitioning on Massive Graphs.
    Mell P; Harang R; Gueye A
    Int J Comput Sci (Rabat); 2016; 5(1):1-11. PubMed ID: 27336059
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Memory and communication efficient algorithm for decentralized counting of nodes in networks.
    Saha A; Marshall JAR; Reina A
    PLoS One; 2021; 16(11):e0259736. PubMed ID: 34807921
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.