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 *

155 related articles for article (PubMed ID: 20401944)

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

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

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

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

  • 5. Learning graph matching.
    Caetano TS; McAuley JJ; Cheng L; Le QV; Smola AJ
    IEEE Trans Pattern Anal Mach Intell; 2009 Jun; 31(6):1048-58. PubMed ID: 19372609
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. Revealing biological modules via graph summarization.
    Navlakha S; Schatz MC; Kingsford C
    J Comput Biol; 2009 Feb; 16(2):253-64. PubMed ID: 19183002
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Discovering large conserved functional components in global network alignment by graph matching.
    Zhu Y; Li Y; Liu J; Qin L; Yu JX
    BMC Genomics; 2018 Sep; 19(Suppl 7):670. PubMed ID: 30255780
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Application of kernel functions for accurate similarity search in large chemical databases.
    Wang X; Huan J; Smalter A; Lushington GH
    BMC Bioinformatics; 2010 Apr; 11 Suppl 3(Suppl 3):S8. PubMed ID: 20438655
    [TBL] [Abstract][Full Text] [Related]  

  • 12. L-GRAAL: Lagrangian graphlet-based network aligner.
    Malod-Dognin N; Pržulj N
    Bioinformatics; 2015 Jul; 31(13):2182-9. PubMed ID: 25725498
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Algorithms for effective querying of compound graph-based pathway databases.
    Dogrusoz U; Cetintas A; Demir E; Babur O
    BMC Bioinformatics; 2009 Nov; 10():376. PubMed ID: 19917102
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Parameterized algorithmics for finding connected motifs in biological networks.
    Betzler N; van Bevern R; Fellows MR; Komusiewicz C; Niedermeier R
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1296-308. PubMed ID: 21282862
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 17. Mining coherent dense subgraphs across massive biological networks for functional discovery.
    Hu H; Yan X; Huang Y; Han J; Zhou XJ
    Bioinformatics; 2005 Jun; 21 Suppl 1():i213-21. PubMed ID: 15961460
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Graphical models and point pattern matching.
    Caetano TS; Caelli T; Schuurmans D; Barone DA
    IEEE Trans Pattern Anal Mach Intell; 2006 Oct; 28(10):1646-63. PubMed ID: 16986545
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An eigenspace projection clustering method for inexact graph matching.
    Caelli T; Kosinov S
    IEEE Trans Pattern Anal Mach Intell; 2004 Apr; 26(4):515-9. PubMed ID: 15382655
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.