222 related articles for article (PubMed ID: 17309248)
1. 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]
2. Scaffold hopping using clique detection applied to reduced graphs.
Barker EJ; Buttar D; Cosgrove DA; Gardiner EJ; Kitts P; Willett P; Gillet VJ
J Chem Inf Model; 2006; 46(2):503-11. PubMed ID: 16562978
[TBL] [Abstract][Full Text] [Related]
3. Toward an improved clustering of large data sets using maximum common substructures and topological fingerprints.
Böcker A
J Chem Inf Model; 2008 Nov; 48(11):2097-107. PubMed ID: 18956832
[TBL] [Abstract][Full Text] [Related]
4. Database clustering with a combination of fingerprint and maximum common substructure methods.
Stahl M; Mauser H
J Chem Inf Model; 2005; 45(3):542-8. PubMed ID: 15921444
[TBL] [Abstract][Full Text] [Related]
5. Training similarity measures for specific activities: application to reduced graphs.
Birchall K; Gillet VJ; Harper G; Pickett SD
J Chem Inf Model; 2006; 46(2):577-86. PubMed ID: 16562986
[TBL] [Abstract][Full Text] [Related]
6. SwiFT: an index structure for reduced graph descriptors in virtual screening and clustering.
Fischer JR; Rarey M
J Chem Inf Model; 2007; 47(4):1341-53. PubMed ID: 17567122
[TBL] [Abstract][Full Text] [Related]
7. The reduced graph descriptor in virtual screening and data-driven clustering of high-throughput screening data.
Harper G; Bravi GS; Pickett SD; Hussain J; Green DV
J Chem Inf Comput Sci; 2004; 44(6):2145-56. PubMed ID: 15554685
[TBL] [Abstract][Full Text] [Related]
8. MultiMCS: a fast algorithm for the maximum common substructure problem on multiple molecules.
Hariharan R; Janakiraman A; Nilakantan R; Singh B; Varghese S; Landrum G; Schuffenhauer A
J Chem Inf Model; 2011 Apr; 51(4):788-806. PubMed ID: 21446748
[TBL] [Abstract][Full Text] [Related]
9. Clustering gene expression data using graph separators.
Kaba B; Pinet N; Lelandais G; Sigayret A; Berry A
In Silico Biol; 2007; 7(4-5):433-52. PubMed ID: 18391236
[TBL] [Abstract][Full Text] [Related]
10. A cluster-based strategy for assessing the overlap between large chemical libraries and its application to a recent acquisition.
Engels MF; Gibbs AC; Jaeger EP; Verbinnen D; Lobanov VS; Agrafiotis DK
J Chem Inf Model; 2006; 46(6):2651-60. PubMed ID: 17125205
[TBL] [Abstract][Full Text] [Related]
11. A hierarchical clustering approach for large compound libraries.
Böcker A; Derksen S; Schmidt E; Teckentrup A; Schneider G
J Chem Inf Model; 2005; 45(4):807-15. PubMed ID: 16045274
[TBL] [Abstract][Full Text] [Related]
12. Evolving interpretable structure-activity relationships. 1. Reduced graph queries.
Birchall K; Gillet VJ; Harper G; Pickett SD
J Chem Inf Model; 2008 Aug; 48(8):1543-57. PubMed ID: 18630899
[TBL] [Abstract][Full Text] [Related]
13. Representation of the molecular topology of cyclical structures by means of cycle graphs. 2. Application to clustering of chemical databases.
Luque Ruiz I; Cerruela García G; Gómez-Nieto MA
J Chem Inf Comput Sci; 2004; 44(4):1383-93. PubMed ID: 15272846
[TBL] [Abstract][Full Text] [Related]
14. LEGClust- a clustering algorithm based on layered entropic subgraphs.
Santos JM; Marques de Sa J; Alexandre LA
IEEE Trans Pattern Anal Mach Intell; 2008 Jan; 30(1):62-75. PubMed ID: 18000325
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. Novel method for geometry optimization of molecular clusters: application to benzene clusters.
Takeuchi H
J Chem Inf Model; 2007; 47(1):104-9. PubMed ID: 17238254
[TBL] [Abstract][Full Text] [Related]
17. From Wiener index to molecules.
Cerruela García G; Luque Ruiz I; Gómez-Nieto MA; Cabrero Doncel JA; Guevara Plaza A
J Chem Inf Model; 2005; 45(2):231-8. PubMed ID: 15807483
[TBL] [Abstract][Full Text] [Related]
18. Maximum symmetrical split of molecular graphs. Application to organic synthesis design.
Vismara P; Tognetti Y; Laurenço C
J Chem Inf Model; 2005; 45(3):685-95. PubMed ID: 15921458
[TBL] [Abstract][Full Text] [Related]
19. Smooth graphs for visual exploration of higher-order state transitions.
Blaas J; Botha CP; Grundy E; Jones MW; Laramee RS; Post FH
IEEE Trans Vis Comput Graph; 2009; 15(6):969-76. PubMed ID: 19834161
[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]
