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.
3. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding. Guturu P; Dantu R IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530 [TBL] [Abstract][Full Text] [Related]
4. Representing clusters using a maximum common edge substructure algorithm applied to reduced graphs and molecular graphs. Gardiner EJ; Gillet VJ; Willett P; Cosgrove DA J Chem Inf Model; 2007; 47(2):354-66. PubMed ID: 17309248 [TBL] [Abstract][Full Text] [Related]
5. Fast construction of assembly trees for molecular graphs. Artemova S; Grudinin S; Redon S J Comput Chem; 2011 Jun; 32(8):1589-98. PubMed ID: 21328401 [TBL] [Abstract][Full Text] [Related]
6. Step-by-step calculation of all maximum common substructures through a constraint satisfaction based algorithm. Cerruela García G; Luque Ruiz I; Gómez-Nieto MA J Chem Inf Comput Sci; 2004; 44(1):30-41. PubMed ID: 14741008 [TBL] [Abstract][Full Text] [Related]
8. Chiral molecules with polyhedral T, O, or I symmetry: theoretical solution to a difficult problem in stereochemistry. Narasimhan SK; Lu X; Luk YY Chirality; 2008 Aug; 20(8):878-84. PubMed ID: 18266212 [TBL] [Abstract][Full Text] [Related]
9. An efficient randomized algorithm for contact-based NMR backbone resonance assignment. Kamisetty H; Bailey-Kellogg C; Pandurangan G Bioinformatics; 2006 Jan; 22(2):172-80. PubMed ID: 16287932 [TBL] [Abstract][Full Text] [Related]
10. GenoLink: a graph-based querying and browsing system for investigating the function of genes and proteins. Durand P; Labarre L; Meil A; Divo JL; Vandenbrouck Y; Viari A; Wojcik J BMC Bioinformatics; 2006 Jan; 7():21. PubMed ID: 16417636 [TBL] [Abstract][Full Text] [Related]
11. [Development of antituberculous drugs: current status and future prospects]. Tomioka H; Namba K Kekkaku; 2006 Dec; 81(12):753-74. PubMed ID: 17240921 [TBL] [Abstract][Full Text] [Related]
12. Graph-mining algorithm for the evaluation of bond formability. Pennerath F; Niel G; Vismara P; Jauffret P; Laurenço C; Napoli A J Chem Inf Model; 2010 Feb; 50(2):221-39. PubMed ID: 20112969 [TBL] [Abstract][Full Text] [Related]
13. Understanding topological symmetry: a heuristic approach to its determination. Contreras ML; Alvarez J; Guajardo D; Rozas R J Comput Chem; 2008 Mar; 29(4):588-600. PubMed ID: 17721880 [TBL] [Abstract][Full Text] [Related]
14. Encoding the core electrons with graph concepts. Pogliani L J Chem Inf Comput Sci; 2004; 44(1):42-9. PubMed ID: 14741009 [TBL] [Abstract][Full Text] [Related]
15. Dynamic graph cuts for efficient inference in Markov Random Fields. Kohli P; Torr PH IEEE Trans Pattern Anal Mach Intell; 2007 Dec; 29(12):2079-88. PubMed ID: 17934219 [TBL] [Abstract][Full Text] [Related]
16. A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem. García-Arnau M; Manrique D; Rodríguez-Patón A; Sosík P Biosystems; 2007; 90(3):687-97. PubMed ID: 17418940 [TBL] [Abstract][Full Text] [Related]
17. A survey and new results on computer enumeration of polyhex and fusene hydrocarbons. Brinkmann G; Caporossi G; Hansen P J Chem Inf Comput Sci; 2003; 43(3):842-51. PubMed ID: 12767142 [TBL] [Abstract][Full Text] [Related]
19. A graph-based genetic algorithm and its application to the multiobjective evolution of median molecules. Brown N; McKay B; Gilardoni F; Gasteiger J J Chem Inf Comput Sci; 2004; 44(3):1079-87. PubMed ID: 15154776 [TBL] [Abstract][Full Text] [Related]
20. 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] [Next] [New Search]