In silico Studies on Selected Drug Targets for Combating Drug Resistance in Plasmodium falcifarum

With drug resistance becoming widespread in Plasmodium falciparum infections, the development of the alternative drugs is the desired strategy for prevention and cure of malaria. Three drug targets were selected to screen promising drug molecules from the GSK library of 13469 molecules. Using an in silico structure-based drug designing approach, the differences in binding energies of the substrate and inhibitor were exploited between target sites of parasite and human to design a drug molecule against Plasmodium. The docking studies have shown several promising molecules from GSK library with more effective binding as compared to the already known inhibitors for the drug targets. Though stronger interaction has been shown by several molecules as compared to the reference, few molecules have shown the potential as drug candidates though in vitro studies are required to validate the results. In case of thymidylate synthase-dihydrofolatereductase (TS-DHFR), three compounds have shown promise for future studies as potential drugs.

Revised PLWAP Tree with Non-frequent Items for Mining Sequential Pattern

Sequential pattern mining is a challenging task in data mining area with large applications. One among those applications is mining patterns from weblog. Recent times, weblog is highly dynamic and some of them may become absolute over time. In addition, users may frequently change the threshold value during the data mining process until acquiring required output or mining interesting rules. Some of the recently proposed algorithms for mining weblog, build the tree with two scans and always consume large time and space. In this paper, we build Revised PLWAP with Non-frequent Items (RePLNI-tree) with single scan for all items. While mining sequential patterns, the links related to the nonfrequent items are not considered. Hence, it is not required to delete or maintain the information of nodes while revising the tree for mining updated transactions. The algorithm supports both incremental and interactive mining. It is not required to re-compute the patterns each time, while weblog is updated or minimum support changed. The performance of the proposed tree is better, even the size of incremental database is more than 50% of existing one. For evaluation purpose, we have used the benchmark weblog dataset and found that the performance of proposed tree is encouraging compared to some of the recently proposed approaches.