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 *

131 related articles for article (PubMed ID: 25121135)

  • 1. Efficient and scalable graph similarity joins in MapReduce.
    Chen Y; Zhao X; Xiao C; Zhang W; Tang J
    ScientificWorldJournal; 2014; 2014():749028. PubMed ID: 25121135
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Approximate Graph Edit Distance in Quadratic Time.
    Riesen K; Ferrer M; Bunke H
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(2):483-494. PubMed ID: 26390496
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Self-organizing maps for learning the edit costs in graph matching.
    Neuhaus M; Bunke H
    IEEE Trans Syst Man Cybern B Cybern; 2005 Jun; 35(3):503-14. PubMed ID: 15971918
    [TBL] [Abstract][Full Text] [Related]  

  • 4. MapReduce Based Personalized Locality Sensitive Hashing for Similarity Joins on Large Scale Data.
    Wang J; Lin C
    Comput Intell Neurosci; 2015; 2015():217216. PubMed ID: 26089861
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Ligand-Based Virtual Screening Using Graph Edit Distance as Molecular Similarity Measure.
    Garcia-Hernandez C; Fernández A; Serratosa F
    J Chem Inf Model; 2019 Apr; 59(4):1410-1421. PubMed ID: 30920214
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An efficient algorithm for DNA fragment assembly in MapReduce.
    Xu B; Gao J; Li C
    Biochem Biophys Res Commun; 2012 Sep; 426(3):395-8. PubMed ID: 22960169
    [TBL] [Abstract][Full Text] [Related]  

  • 7. SING: subgraph search in non-homogeneous graphs.
    Di Natale R; Ferro A; Giugno R; Mongiovì M; Pulvirenti A; Shasha D
    BMC Bioinformatics; 2010 Feb; 11():96. PubMed ID: 20170516
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Graphing trillions of triangles.
    Burkhardt P
    Inf Vis; 2017 Jul; 16(3):157-166. PubMed ID: 28690426
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Efficient string similarity join in multi-core and distributed systems.
    Yan C; Zhao X; Zhang Q; Huang Y
    PLoS One; 2017; 12(3):e0172526. PubMed ID: 28278177
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Coupling Graphs, Efficient Algorithms and B-Cell Epitope Prediction.
    Liang Zhao ; Hoi SC; Li Z; Wong L; Nguyen H; Li J
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(1):7-16. PubMed ID: 26355502
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A binary linear programming formulation of the graph edit distance.
    Justice D; Hero A
    IEEE Trans Pattern Anal Mach Intell; 2006 Aug; 28(8):1200-14. PubMed ID: 16886857
    [TBL] [Abstract][Full Text] [Related]  

  • 14. ODES: an overlapping dense sub-graph algorithm.
    Long J; Hartman C
    Bioinformatics; 2010 Nov; 26(21):2788-9. PubMed ID: 20829442
    [TBL] [Abstract][Full Text] [Related]  

  • 15. PyGTED: Python Application for Computing Graph Traversal Edit Distance.
    Ebrahimpour Boroojeny A; Shrestha A; Sharifi-Zarchi A; Gallagher SR; Sahinalp SC; Chitsaz H
    J Comput Biol; 2020 Mar; 27(3):436-439. PubMed ID: 32160033
    [No Abstract]   [Full Text] [Related]  

  • 16. Detailed protein sequence alignment based on Spectral Similarity Score (SSS).
    Gupta K; Thomas D; Vidya SV; Venkatesh KV; Ramakumar S
    BMC Bioinformatics; 2005 Apr; 6():105. PubMed ID: 15850477
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Key-Node-Separated Graph Clustering and Layouts for Human Relationship Graph Visualization.
    Itoh T; Klein K
    IEEE Comput Graph Appl; 2015; 35(6):30-40. PubMed ID: 26415161
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Predicting drug-disease interactions by semi-supervised graph cut algorithm and three-layer data integration.
    Wu G; Liu J; Wang C
    BMC Med Genomics; 2017 Dec; 10(Suppl 5):79. PubMed ID: 29297383
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Automatic construction of molecular similarity networks for visual graph mining in chemical space of bioactive peptides: an unsupervised learning approach.
    Aguilera-Mendoza L; Marrero-Ponce Y; García-Jacas CR; Chavez E; Beltran JA; Guillen-Ramirez HA; Brizuela CA
    Sci Rep; 2020 Oct; 10(1):18074. PubMed ID: 33093586
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.