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 *

140 related articles for article (PubMed ID: 24688697)

  • 1. Comparison and enumeration of chemical graphs.
    Akutsu T; Nagamochi H
    Comput Struct Biotechnol J; 2013; 5():e201302004. PubMed ID: 24688697
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Efficient enumeration of monocyclic chemical graphs with given path frequencies.
    Suzuki M; Nagamochi H; Akutsu T
    J Cheminform; 2014; 6():31. PubMed ID: 24955135
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Enumerating treelike chemical graphs with given path frequency.
    Fujiwara H; Wang J; Zhao L; Nagamochi H; Akutsu T
    J Chem Inf Model; 2008 Jul; 48(7):1345-57. PubMed ID: 18588284
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programming.
    Imada T; Ota S; Nagamochi H; Akutsu T
    J Chem Inf Model; 2011 Nov; 51(11):2788-807. PubMed ID: 21848281
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. On Finding and Enumerating Maximal and Maximum
    Phillips CA; Wang K; Baker EJ; Bubier JA; Chesler EJ; Langston MA
    Algorithms; 2019 Jan; 12(1):. PubMed ID: 31448059
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs.
    Li J; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):633-646. PubMed ID: 28113952
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Scaffold hopping using clique detection applied to reduced graphs.
    Barker EJ; Buttar D; Cosgrove DA; Gardiner EJ; Kitts P; Willett P; Gillet VJ
    J Chem Inf Model; 2006; 46(2):503-11. PubMed ID: 16562978
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
    Nishiyama Y; Shurbevski A; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):77-90. PubMed ID: 29994050
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm.
    Raymond JW; Gardiner EJ; Willett P
    J Chem Inf Comput Sci; 2002; 42(2):305-16. PubMed ID: 11911700
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Exploiting graph kernels for high performance biomedical relation extraction.
    Panyam NC; Verspoor K; Cohn T; Ramamohanarao K
    J Biomed Semantics; 2018 Jan; 9(1):7. PubMed ID: 29382397
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Dual graph convolutional neural network for predicting chemical networks.
    Harada S; Akita H; Tsubaki M; Baba Y; Takigawa I; Yamanishi Y; Kashima H
    BMC Bioinformatics; 2020 Apr; 21(Suppl 3):94. PubMed ID: 32321421
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. A linear delay algorithm for enumerating all connected induced subgraphs.
    Alokshiya M; Salem S; Abed F
    BMC Bioinformatics; 2019 Jun; 20(Suppl 12):319. PubMed ID: 31216984
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.
    Shimizu M; Nagamochi H; Akutsu T
    BMC Bioinformatics; 2011 Dec; 12 Suppl 14(Suppl 14):S3. PubMed ID: 22373441
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Multi-way association extraction and visualization from biological text documents using hyper-graphs: applications to genetic association studies for diseases.
    Mukhopadhyay S; Palakal M; Maddu K
    Artif Intell Med; 2010 Jul; 49(3):145-54. PubMed ID: 20382004
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A novel graph kernel on chemical compound classification.
    Jiang Q; Ma J
    J Bioinform Comput Biol; 2018 Dec; 16(6):1850026. PubMed ID: 30567474
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Maximum common subgraph: some upper bound and lower bound results.
    Huang X; Lai J; Jennings SF
    BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S6. PubMed ID: 17217524
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank.
    Azam NA; Shurbevski A; Nagamochi H
    Entropy (Basel); 2020 Nov; 22(11):. PubMed ID: 33287063
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.