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 *

131 related articles for article (PubMed ID: 21848281)

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

  • 2. Algorithm for exhaustive and nonredundant organic stereoisomer generation.
    Contreras ML; Alvarez J; Guajardo D; Rozas R
    J Chem Inf Model; 2006; 46(6):2288-98. PubMed ID: 17125171
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Heuristics for chemical compound matching.
    Hattori M; Okuno Y; Goto S; Kanehisa M
    Genome Inform; 2003; 14():144-53. PubMed ID: 15706529
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Stereoisomers of compounds with symmetric constitutions.
    Siebert CD; Tampe N
    Arch Pharm (Weinheim); 2005 Nov; 338(11):534-8. PubMed ID: 16281306
    [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. 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]  

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

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

  • 10. A novel graph-based similarity measure for 2D chemical structures.
    Le SQ; Ho TB; Phan TT
    Genome Inform; 2004; 15(2):82-91. PubMed ID: 15706494
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A dynamic programming algorithm to predict synthesis processes of tree-structured compounds with graph grammar.
    Zhao Y; Tamura T; Hayashida M; Akutsu T
    Genome Inform; 2010; 24():218-29. PubMed ID: 22081602
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Efficient extraction of mapping rules of atoms from enzymatic reaction data.
    Akutsu T
    J Comput Biol; 2004; 11(2-3):449-62. PubMed ID: 15285901
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Power keys: a novel class of topological descriptors based on exhaustive subgraph enumeration and their application in substructure searching.
    Liu P; Agrafiotis DK; Rassokhin DN
    J Chem Inf Model; 2011 Nov; 51(11):2843-51. PubMed ID: 21955134
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Enumeration of 166 billion organic small molecules in the chemical universe database GDB-17.
    Ruddigkeit L; van Deursen R; Blum LC; Reymond JL
    J Chem Inf Model; 2012 Nov; 52(11):2864-75. PubMed ID: 23088335
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A space-efficient algorithm for the constrained pairwise sequence alignment problem.
    He D; Arslan AN
    Genome Inform; 2005; 16(2):237-46. PubMed ID: 16901106
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. BWM*: A Novel, Provable, Ensemble-based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design.
    Jou JD; Jain S; Georgiev IS; Donald BR
    J Comput Biol; 2016 Jun; 23(6):413-24. PubMed ID: 26744898
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Searching for pharmacophoric patterns in databases of three-dimensional chemical structures.
    Willett P
    J Mol Recognit; 1995; 8(5):290-303. PubMed ID: 8619950
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An unenumerative DNA computing model for vertex coloring problem.
    Xu J; Qiang X; Yang Y; Wang B; Yang D; Luo L; Pan L; Wang S
    IEEE Trans Nanobioscience; 2011 Jun; 10(2):94-8. PubMed ID: 21742570
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.