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 *

104 related articles for article (PubMed ID: 22081602)

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

  • 2. Integer programming-based method for grammar-based tree compression and its application to pattern extraction of glycan tree structures.
    Zhao Y; Hayashida M; Akutsu T
    BMC Bioinformatics; 2010 Dec; 11 Suppl 11(Suppl 11):S4. PubMed ID: 21172054
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Pair stochastic tree adjoining grammars for aligning and predicting pseudoknot RNA structures.
    Matsui H; Sato K; Sakakibara Y
    Bioinformatics; 2005 Jun; 21(11):2611-7. PubMed ID: 15784748
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Grammar-based compression approach to extraction of common rules among multiple trees of glycans and RNAs.
    Zhao Y; Hayashida M; Cao Y; Hwang J; Akutsu T
    BMC Bioinformatics; 2015 Apr; 16():128. PubMed ID: 25907438
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. Advances in mixed-integer programming methods for chemical production scheduling.
    Velez S; Maravelias CT
    Annu Rev Chem Biomol Eng; 2014; 5():97-121. PubMed ID: 24910915
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Computational systems biology in drug discovery and development: methods and applications.
    Materi W; Wishart DS
    Drug Discov Today; 2007 Apr; 12(7-8):295-303. PubMed ID: 17395089
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Algorithmic and complexity results for decompositions of biological networks into monotone subsystems.
    DasGupta B; Enciso GA; Sontag E; Zhang Y
    Biosystems; 2007; 90(1):161-78. PubMed ID: 17188805
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Design and development of chemical ontologies for reaction representation.
    Sankar P; Aghila G
    J Chem Inf Model; 2006; 46(6):2355-68. PubMed ID: 17125179
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human-viral Infection Patterns.
    Smoly I; Carmel A; Shemer-Avni Y; Yeger-Lotem E; Ziv-Ukelson M
    J Comput Biol; 2016 Mar; 23(3):165-79. PubMed ID: 26953875
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Algorithmic height compression of unordered trees.
    Ben-Naoum F; Godin C
    J Theor Biol; 2016 Jan; 389():237-52. PubMed ID: 26551155
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Identification of biochemical networks by S-tree based genetic programming.
    Cho DY; Cho KH; Zhang BT
    Bioinformatics; 2006 Jul; 22(13):1631-40. PubMed ID: 16585066
    [TBL] [Abstract][Full Text] [Related]  

  • 18. eSTGt: a programming and simulation environment for population dynamics.
    Spiro A; Shapiro E
    BMC Bioinformatics; 2016 Apr; 17(1):187. PubMed ID: 27117841
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures.
    Fukagawa D; Tamura T; Takasu A; Tomita E; Akutsu T
    BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S13. PubMed ID: 21342542
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Simplified partial digest problem: enumerative and dynamic programming algorithms.
    Blazewicz J; Burke E; Kasprzak M; Kovalev A; Kovalyov M
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):668-80. PubMed ID: 17975277
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.