BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

369 related articles for article (PubMed ID: 20170516)

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

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

  • 3. A coding method for efficient subgraph querying on vertex- and edge-labeled graphs.
    Zhu L; Song Q; Guo Y; Du L; Zhu X; Wang G
    PLoS One; 2014; 9(5):e97178. PubMed ID: 24853266
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Fast Subgraph Matching Strategies Based on Pattern-Only Heuristics.
    Aparo A; Bonnici V; Micale G; Ferro A; Shasha D; Pulvirenti A; Giugno R
    Interdiscip Sci; 2019 Mar; 11(1):21-32. PubMed ID: 30790228
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A (sub)graph isomorphism algorithm for matching large graphs.
    Cordella LP; Foggia P; Sansone C; Vento M
    IEEE Trans Pattern Anal Mach Intell; 2004 Oct; 26(10):1367-72. PubMed ID: 15641723
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. GraphFind: enhancing graph searching by low support data mining techniques.
    Ferro A; Giugno R; Mongiovì M; Pulvirenti A; Skripin D; Shasha D
    BMC Bioinformatics; 2008 Apr; 9 Suppl 4(Suppl 4):S10. PubMed ID: 18460171
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Representation and searching of carbohydrate structures using graph-theoretic techniques.
    Bruno IJ; Kemp NM; Artymiuk PJ; Willett P
    Carbohydr Res; 1997 Oct; 304(1):61-7. PubMed ID: 9403995
    [TBL] [Abstract][Full Text] [Related]  

  • 9. SIGMA: a set-cover-based inexact graph matching algorithm.
    Mongiovì M; Di Natale R; Giugno R; Pulvirenti A; Ferro A; Sharan R
    J Bioinform Comput Biol; 2010 Apr; 8(2):199-218. PubMed ID: 20401944
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A query language for biological networks.
    Leser U
    Bioinformatics; 2005 Sep; 21 Suppl 2():ii33-9. PubMed ID: 16204121
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A subgraph isomorphism algorithm and its application to biochemical data.
    Bonnici V; Giugno R; Pulvirenti A; Shasha D; Ferro A
    BMC Bioinformatics; 2013; 14 Suppl 7(Suppl 7):S13. PubMed ID: 23815292
    [TBL] [Abstract][Full Text] [Related]  

  • 12. An novel frequent probability pattern mining algorithm based on circuit simulation method in uncertain biological networks.
    He J; Wang C; Qiu K; Zhong W
    BMC Syst Biol; 2014; 8 Suppl 3(Suppl 3):S6. PubMed ID: 25350277
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Top-k similar graph matching using TraM in biological networks.
    Amin MS; Finley RL; Jamil HM
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(6):1790-804. PubMed ID: 22732692
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Motif discovery in biological network using expansion tree.
    Patra S; Mohapatra A
    J Bioinform Comput Biol; 2018 Dec; 16(6):1850024. PubMed ID: 30415600
    [TBL] [Abstract][Full Text] [Related]  

  • 16. [A retrieval method of drug molecules based on graph collapsing].
    Qu JW; Lv XQ; Liu ZM; Liao Y; Sun PH; Wang B; Tang Z
    Beijing Da Xue Xue Bao Yi Xue Ban; 2018 Apr; 50(2):368-374. PubMed ID: 29643542
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Subgraph queries by context-free grammars.
    Sevon P; Eronen L
    J Integr Bioinform; 2008 Aug; 5(2):. PubMed ID: 20134073
    [TBL] [Abstract][Full Text] [Related]  

  • 18. G-Hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases.
    Wang X; Smalter A; Huan J; Lushington GH
    Adv Database Technol; 2009; 360():472-480. PubMed ID: 20428322
    [TBL] [Abstract][Full Text] [Related]  

  • 19. SAGA: a subgraph matching tool for biological graphs.
    Tian Y; McEachin RC; Santos C; States DJ; Patel JM
    Bioinformatics; 2007 Jan; 23(2):232-9. PubMed ID: 17110368
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Discriminative Feature Selection for Uncertain Graph Classification.
    Kong X; Yu PS; Wang X; Ragin AB
    Proc SIAM Int Conf Data Min; 2013; 2013():82-93. PubMed ID: 25949925
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 19.