Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.creator | Luo, Weimin | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/6752 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Discovering patterns from drug protein interactions based on their molecular fingerprints and applications in drug design | en_US |
| dcterms.abstract | Unveiling rules that govern drug-protein interactions is of paramount importance in drug discovery. However, up to now, not much work has been done in this field. Unlimited amount of knowledge in this field are acquired, with much left unknown. To fill this gap, we propose a novel method called Drug Protein Analysis (DPA) to discover patterns from the drug protein interactions. Given a set of drug-protein interactions, DPA performs its tasks in several steps: (i) for each drug involved, its substructures are converted into its fingerprints; (ii) for each protein involved, its protein domains are converted into its fingerprints; (iii) a dependency measure between each drug substructure and protein domain is then computed based on the known interactions between the drugs and proteins, (iv) the dependency measures are then used to predict previously unknown drug-protein interactions. DPA is superior to other extent methods due to the following advantages: first, it is able to perform its tasks effectively without any 3D information about drug and protein structures, which are required in other methods; second, it makes use of molecular fingerprints, which are information-rich and fast to compute. From a set of known drug-targets interaction data including enzymes, ion channels and protein-coupled receptors, DPA extracts a set of chemical substructures, which are shared by drugs and can be bind to a set of protein domains. Experiment results show that it is useful for predicting new drug-protein interaction as well as protein-ligand interactions. It can also be used to tackle problems such as ligand specificity thereby facilitating the drug discovery process. To show the capability of DPA, a novel Evolutionary Algorithm in Drug molecular Design (EvoDD) is proposed. EvoDD is an Evolutionary Algorithm (EA), which can determine a molecular structure with certain desirable properties. It possesses the following characteristics. (i) it encodes molecular designs in graphs and therefore does not require post-processing of a string- or tree-based genetic structures into molecular design, (ii) it uses a novel crossover operator that can facilitate the exchange of characteristics between two molecular graphs and does not require chemistry rules known in advanced; (iii) it uses a set of novel mutation operators to facilitate the introduction of minor variations in each molecular graph in either the labeling or the structure, (iv) it uses atomics-based and fragment-based approaches to handle different size of molecule, and (v) the value of the fitness function it uses is made to depend on the property descriptors of the design encoded in a molecular graph. The patterns discovered from DPA can be used as a descriptor for the fitness function for EvoDD to guide the EA to converge. EvoDD has been tested with different data sets and the results are very promising. | en_US |
| dcterms.extent | 74 leaves : ill. ; 30 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2012 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Phil. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.LCSH | Drug development. | en_US |
| dcterms.LCSH | Drugs -- Research -- Data processing | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b25301573.pdf | For All Users | 1.95 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/6752