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 *

158 related articles for article (PubMed ID: 24955135)

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

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

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

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

  • 5. Improved algorithms for enumerating tree-like chemical graphs with given path frequency.
    Ishida Y; Zhao L; Nagamochi H; Akutsu T
    Genome Inform; 2008; 21():53-64. PubMed ID: 19425147
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut.
    Ishida Y; Kato Y; Zhao L; Nagamochi H; Akutsu T
    J Chem Inf Model; 2010 May; 50(5):934-46. PubMed ID: 20415496
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming.
    Zhu J; Azam NA; Zhang F; Shurbevski A; Haraguchi K; Zhao L; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(6):3233-3245. PubMed ID: 34520360
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming.
    Azam NA; Zhu J; Sun Y; Shi Y; Shurbevski A; Zhao L; Nagamochi H; Akutsu T
    Algorithms Mol Biol; 2021 Aug; 16(1):18. PubMed ID: 34391471
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Enumeration Method for Structural Isomers Containing User-Defined Structures Based on Breadth-First Search Approach.
    Jindalertudomdee J; Hayashida M; Akutsu T
    J Comput Biol; 2016 Aug; 23(8):625-40. PubMed ID: 27348756
    [TBL] [Abstract][Full Text] [Related]  

  • 12. An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
    Azam NA; Shurbevski A; Nagamochi H
    Entropy (Basel); 2020 Aug; 22(9):. PubMed ID: 33286692
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Enumeration method for tree-like chemical compounds with benzene rings and naphthalene rings by breadth-first search order.
    Jindalertudomdee J; Hayashida M; Zhao Y; Akutsu T
    BMC Bioinformatics; 2016 Mar; 17():113. PubMed ID: 26932529
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Computing paths and cycles in biological interaction graphs.
    Klamt S; von Kamp A
    BMC Bioinformatics; 2009 Jun; 10():181. PubMed ID: 19527491
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Breadth-first search approach to enumeration of tree-like chemical compounds.
    Zhao Y; Hayashida M; Jindalertudomdee J; Nagamochi H; Akutsu T
    J Bioinform Comput Biol; 2013 Dec; 11(6):1343007. PubMed ID: 24372036
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. (p,q)-biclique counting and enumeration for large sparse bipartite graphs.
    Yang J; Peng Y; Ouyang D; Zhang W; Lin X; Zhao X
    VLDB J; 2023 Mar; ():1-25. PubMed ID: 37362202
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Enumerating consistent sub-graphs of directed acyclic graphs: an insight into biomedical ontologies.
    Peng Y; Jiang Y; Radivojac P
    Bioinformatics; 2018 Jul; 34(13):i313-i322. PubMed ID: 29949985
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.