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 *

81 related articles for article (PubMed ID: 17563313)

  • 1. Discovering topological motifs using a compact notation.
    Parida L
    J Comput Biol; 2007 Apr; 14(3):300-23. PubMed ID: 17563313
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Detecting list-colored graph motifs in biological networks using branch-and-bound strategy.
    Huang Y; Zhong C
    Comput Biol Med; 2019 Apr; 107():1-9. PubMed ID: 30738296
    [TBL] [Abstract][Full Text] [Related]  

  • 4. The Application of the Weighted k-Partite Graph Problem to the Multiple Alignment for Metabolic Pathways.
    Chen W; Hendrix W; Samatova NF
    J Comput Biol; 2017 Dec; 24(12):1195-1211. PubMed ID: 28891687
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Do motifs reflect evolved function?--No convergent evolution of genetic regulatory network subgraph topologies.
    Knabe JF; Nehaniv CL; Schilstra MJ
    Biosystems; 2008; 94(1-2):68-74. PubMed ID: 18611431
    [TBL] [Abstract][Full Text] [Related]  

  • 6. k-Partite cliques of protein interactions: A novel subgraph topology for functional coherence analysis on PPI networks.
    Liu Q; Chen YP; Li J
    J Theor Biol; 2014 Jan; 340():146-54. PubMed ID: 24056214
    [TBL] [Abstract][Full Text] [Related]  

  • 7. RANGI: a fast list-colored graph motif finding algorithm.
    Rudi AG; Shahrivari S; Jalili S; Moghadam Kashani ZR
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(2):504-13. PubMed ID: 23929873
    [TBL] [Abstract][Full Text] [Related]  

  • 8. acc-Motif: Accelerated Network Motif Detection.
    Meira LA; Máximo VR; Fazenda ÁL; da Conceição AF
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(5):853-62. PubMed ID: 26356858
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Object recognition through topo-geometric shape models using error-tolerant subgraph isomorphisms.
    Baloch S; Krim H
    IEEE Trans Image Process; 2010 May; 19(5):1191-200. PubMed ID: 20040418
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Extended Graph-Based Models for Enhanced Similarity Search in Cavbase.
    Krotzky T; Fober T; Hüllermeier E; Klebe G
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(5):878-90. PubMed ID: 26356860
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Energy function-based approaches to graph coloring.
    Di Blas A; Jagota A; Hughey R
    IEEE Trans Neural Netw; 2002; 13(1):81-91. PubMed ID: 18244411
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm.
    Grindley HM; Artymiuk PJ; Rice DW; Willett P
    J Mol Biol; 1993 Feb; 229(3):707-21. PubMed ID: 8381875
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 17. Computing atom mappings for biochemical reactions without subgraph isomorphism.
    Heinonen M; Lappalainen S; Mielikäinen T; Rousu J
    J Comput Biol; 2011 Jan; 18(1):43-58. PubMed ID: 21210731
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Biological network motif detection: principles and practice.
    Wong E; Baur B; Quader S; Huang CH
    Brief Bioinform; 2012 Mar; 13(2):202-15. PubMed ID: 22396487
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Identifying protein complexes based on multiple topological structures in PPI networks.
    Chen B; Wu FX
    IEEE Trans Nanobioscience; 2013 Sep; 12(3):165-72. PubMed ID: 23974659
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.