Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Dissertations

2005

Clustering

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Modeling Of Flexible Drug-Like Molecules : Qsar Of Gbr 12909 Analog Dat/Sert Selectivity, Kathleen Mary Gilbert May 2005

Modeling Of Flexible Drug-Like Molecules : Qsar Of Gbr 12909 Analog Dat/Sert Selectivity, Kathleen Mary Gilbert

Dissertations

The dopamine reuptake inhibitor GBR 12909 and related dialkyl piperazine and piperidine analogs have been studied as agonist substitution therapies acting on the dopamine transporter (DAT) to treat cocaine addiction. Undesirable binding to the serotonin transporter (SERT) can vary greatly depending on the specific substituents on the molecule. This study uses Comparative Molecular Field Analysis (CoMFA) and Comparative Molecular Similarity Indices (CoMSIA) techniques to determine a stable and predictive model for DAT/SERT selectivity for a set of flexible GBR 12909 analogs.

Families of analogs were constructed from six pairs of naphthyl-substituted piperazine and piperidine templates identified by hierarchical clustering as …


High-Dimensional Indexing Methods Utilizing Clustering And Dimensionality Reduction, Lijuan Zhang May 2005

High-Dimensional Indexing Methods Utilizing Clustering And Dimensionality Reduction, Lijuan Zhang

Dissertations

The emergence of novel database applications has resulted in the prevalence of a new paradigm for similarity search. These applications include multimedia databases, medical imaging databases, time series databases, DNA and protein sequence databases, and many others. Features of data objects are extracted and transformed into high-dimensional data points. Searching for objects becomes a search on points in the high-dimensional feature space. The dissimilarity between two objects is determined by the distance between two feature vectors. Similarity search is usually implemented as nearest neighbor search in feature vector spaces. The cost of processing k-nearest neighbor (k-NN) queries via a sequential …