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 *

122 related articles for article (PubMed ID: 33287063)

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

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

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

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

  • 5. An extended dual graph library and partitioning algorithm applicable to pseudoknotted RNA structures.
    Jain S; Saju S; Petingi L; Schlick T
    Methods; 2019 Jun; 162-163():74-84. PubMed ID: 30928508
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. Identification of novel RNA design candidates by clustering the extended RNA-As-Graphs library.
    Jain S; Zhu Q; Paz ASP; Schlick T
    Biochim Biophys Acta Gen Subj; 2020 Jun; 1864(6):129534. PubMed ID: 31954797
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 11. Inverse folding with RNA-As-Graphs produces a large pool of candidate sequences with target topologies.
    Jain S; Tao Y; Schlick T
    J Struct Biol; 2020 Mar; 209(3):107438. PubMed ID: 31874236
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Bond topology of chain, ribbon and tube silicates. Part II. Geometrical analysis of infinite 1D arrangements of (TO
    Day MC; Hawthorne FC; Rostami A
    Acta Crystallogr A Found Adv; 2024 May; 80(Pt 3):258-281. PubMed ID: 38683645
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO
    Day MC; Hawthorne FC
    Acta Crystallogr A Found Adv; 2022 May; 78(Pt 3):212-233. PubMed ID: 35502713
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Some isomorphic properties of
    Ghorai G; Pal M
    Springerplus; 2016; 5(1):2104. PubMed ID: 28066695
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Network Theory Tools for RNA Modeling.
    Kim N; Petingi L; Schlick T
    WSEAS Trans Math; 2013 Sep; 9(12):941-955. PubMed ID: 25414570
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Factorization and pseudofactorization of weighted graphs.
    Sheridan K; Berleant J; Bathe M; Condon A; Williams VV
    Discrete Appl Math; 2023 Oct; 337():81-105. PubMed ID: 37213330
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Graph generative and adversarial strategy-enhanced node feature learning and self-calibrated pairwise attribute encoding for prediction of drug-related side effects.
    Xuan P; Xu K; Cui H; Nakaguchi T; Zhang T
    Front Pharmacol; 2023; 14():1257842. PubMed ID: 37731739
    [No Abstract]   [Full Text] [Related]  

    [Next]    [New Search]
    of 7.