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 *

91 related articles for article (PubMed ID: 20415496)

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

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

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

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

  • 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. Subgraph queries by context-free grammars.
    Sevon P; Eronen L
    J Integr Bioinform; 2008 Aug; 5(2):. PubMed ID: 20134073
    [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. 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]  

  • 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. Advanced exact structure searching in large databases of chemical compounds.
    Trepalin SV; Skorenko AV; Balakin KV; Nasonov AF; Lang SA; Ivashchenko AA; Savchuk NP
    J Chem Inf Comput Sci; 2003; 43(3):852-60. PubMed ID: 12767143
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Optimal parallel algorithm for shortest paths problem on interval graphs.
    Mishra PK
    J Zhejiang Univ Sci; 2004 Sep; 5(9):1135-43. PubMed ID: 15323010
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A multi-queue branch-and-bound algorithm for anytime optimal search with biological applications.
    Lathrop RH; Sazhin A; Sun Y; Steffin N; Irani SS
    Genome Inform; 2001; 12():73-82. PubMed ID: 11791226
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution.
    Song YS; Wu Y; Gusfield D
    Bioinformatics; 2005 Jun; 21 Suppl 1():i413-22. PubMed ID: 15961486
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Exact parallel maximum clique algorithm for general and protein graphs.
    Depolli M; Konc J; Rozman K; Trobec R; Janežič D
    J Chem Inf Model; 2013 Sep; 53(9):2217-28. PubMed ID: 23965016
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Solving satisfiability problems using a novel microarray-based DNA computer.
    Lin CH; Cheng HP; Yang CB; Yang CN
    Biosystems; 2007; 90(1):242-52. PubMed ID: 17029765
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Scalable partitioning and exploration of chemical spaces using geometric hashing.
    Dutta D; Guha R; Jurs PC; Chen T
    J Chem Inf Model; 2006; 46(1):321-33. PubMed ID: 16426067
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Query Chem: a Google-powered web search combining text and chemical structures.
    Klekota J; Roth FP; Schreiber SL
    Bioinformatics; 2006 Jul; 22(13):1670-3. PubMed ID: 16672261
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Chemoinformatics-applications in food chemistry.
    Martinez-Mayorga K; Medina-Franco JL
    Adv Food Nutr Res; 2009; 58():33-56. PubMed ID: 19878857
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis.
    Kim H; Park H
    Bioinformatics; 2007 Jun; 23(12):1495-502. PubMed ID: 17483501
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Accurate prediction for atomic-level protein design and its application in diversifying the near-optimal sequence space.
    Fromer M; Yanover C
    Proteins; 2009 May; 75(3):682-705. PubMed ID: 19003998
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.