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 *

117 related articles for article (PubMed ID: 24372036)

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

  • 2. Parallelization of enumerating tree-like chemical compounds by breadth-first search order.
    Hayashida M; Jindalertudomdee J; Zhao Y; Akutsu T
    BMC Med Genomics; 2015; 8 Suppl 2(Suppl 2):S15. PubMed ID: 26044861
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

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

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

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

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

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

  • 14. Accelerating chemical database searching using graphics processing units.
    Liu P; Agrafiotis DK; Rassokhin DN; Yang E
    J Chem Inf Model; 2011 Aug; 51(8):1807-16. PubMed ID: 21696144
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Designing an A* algorithm for calculating edit distance between rooted-unordered trees.
    Horesh Y; Mehr R; Unger R
    J Comput Biol; 2006; 13(6):1165-76. PubMed ID: 16901235
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A Branch-and-Bound Approach for Tautomer Enumeration.
    Thalheim T; Wagner B; Kühne R; Middendorf M; Schüürmann G
    Mol Inform; 2015 May; 34(5):263-75. PubMed ID: 27490272
    [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. Ligand-based virtual screening and in silico design of new antimalarial compounds using nonstochastic and stochastic total and atom-type quadratic maps.
    Marrero-Ponce Y; Iyarreta-Veitía M; Montero-Torres A; Romero-Zaldivar C; Brandt CA; Avila PE; Kirchgatter K; Machado Y
    J Chem Inf Model; 2005; 45(4):1082-100. PubMed ID: 16045304
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Is chemical synthetic accessibility computationally predictable for drug and lead-like molecules? A comparative assessment between medicinal and computational chemists.
    Bonnet P
    Eur J Med Chem; 2012 Aug; 54():679-89. PubMed ID: 22749644
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Protein β-sheet prediction using an efficient dynamic programming algorithm.
    Sabzekar M; Naghibzadeh M; Eghdami M; Aydin Z
    Comput Biol Chem; 2017 Oct; 70():142-155. PubMed ID: 28881217
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.