Back to Results
First PageMeta Content
Cograph / Tree / Clique-sum / Clique problem / Graph theory / Graph operations / Clique


Common Pharmacophore Identification Using Frequent Clique Detection Algorithm Yevgeniy Podolyan and George Karypis University of Minnesota, Department of Computer Science and Computer Engineering Minneapolis, MN[removed]Oc
Add to Reading List

Document Date: 2012-08-16 12:29:06


Open Document

File Size: 386,61 KB

Share Result on Facebook

Company

OpenEye / Intel / /

Facility

George Karypis University of Minnesota / /

IndustryTerm

pharmacophore identification algorithms / above algorithms / possible low-energy conformations / proposed frequent clique mining algorithms / sampling10 algorithms / genetic algorithm / graph mining algorithms / graphs representing low-energy conformations / low-energy conformations / clique-mining methods / frequent graph mining / frequent subgraph mining / pharmacophore identification using frequent clique mining / depth-first search / conformer miner / pruned exhaustive search method / proposed frequent clique mining approach / chemical structures / chemical bonds / /

OperatingSystem

Linux / /

Organization

Department of Computer Science and Computer Engineering Minneapolis / University of Minnesota / /

Position

unified conformer miner / multiple conformer miner / representative / /

Product

Omega19 software / generated using OpenEye’s Omega19 software / Omega19 / /

ProvinceOrState

Minnesota / /

Technology

graph mining algorithms / above algorithms / loop UCM algorithm / Gibbs sampling10 algorithms / Xeon processor / proposed frequent clique mining algorithms / Linux / high-throughput screening / existing algorithms / genetic algorithm / two proposed algorithms / drug design / 3 algorithm / second algorithm / pharmacophore identification algorithms / UCM algorithm / two algorithms / /

SocialTag