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 *

125 related articles for article (PubMed ID: 33286692)

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

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

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

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

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

  • 8. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

  • 9. On the centrality of vertices of molecular graphs.
    Randić M; Novič M; Vračko M; Plavšić D
    J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
    Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B
    Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 13. Genus Ranges of 4-Regular Rigid Vertex Graphs.
    Buck D; Dolzhenko E; Jonoska N; Saito M; Valencia K
    Electron J Comb; 2015; 22(3):. PubMed ID: 27807395
    [TBL] [Abstract][Full Text] [Related]  

  • 14. On the Extremal Wiener Polarity Index of Hückel Graphs.
    Wang H
    Comput Math Methods Med; 2016; 2016():3873597. PubMed ID: 27247613
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
    Fujita M; Shimada Y; Kimura T; Ikeguchi T
    PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 19. Total Irregularity Strengths of an Arbitrary Disjoint Union of (3,6)- Fullerenes.
    Shabbir A; Nadeem MF; Ovais A; Ashraf F; Nasir S
    Comb Chem High Throughput Screen; 2022; 25(3):500-509. PubMed ID: 33297913
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Seeing the results of a mutation with a vertex weighted hierarchical graph.
    Knisley DJ; Knisley JR
    BMC Proc; 2014; 8(Suppl 2 Proceedings of the 3rd Annual Symposium on Biologica):S7. PubMed ID: 25237394
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.