The present invention provides a method and system for drug repurposing. In accordance with a disclosed embodiment, the method may include selecting a set of positive drugs for an indication and listing a set of pathways for the set of positive drugs and a set of negative drugs. Further, the method shall include associating a pathway for each drug with an index value, based on an action of the each drug on the pathway. A pathway weight shall be calculated from the index value of the each pathway based on a frequency of occurrence of the each pathway in the set of positive drugs and in the set of negative drugs. A drug score for a drug to be repurposed shall be identified from the negative set of drugs, based on the pathway weight. The drug with a relatively high drug score can be repurposed for the indication.
|
8. A drug repurposing computing device, comprising a processor and a memory coupled to the processor which is configured to be capable of executing programmed instructions comprising and stored in the memory to:
select a set of positive drugs for an indication;
list a set of pathways for the set of positive drugs and a set of negative drugs;
determine when an action is associated with each of the set of positive drugs and the set of negative drugs acting on each of the pathways;
associate each of the pathways for each of the set of positive drugs and the set of negative drugs with a first index value of a plurality of index values, when the determination indicates that an action is associated with each of the set of positive drugs and the set of negative drugs on each of the pathways;
calculate a pathway weight for each of the pathways based at least on the first index value of the plurality of index values and on a frequency of occurrence of the each pathway in the set of positive drugs and in the set of negative drugs; and
identify a drug score for a drug from the negative set of drugs, based on the pathway weight;
associate each of the pathways for of the set of positive drugs and the set of negative drugs with a second index value of the plurality of index values, when the determination indicates that an action is not associated with each of the set of positive drugs and the set of negative drugs on each of the pathways;
calculate the pathway weight for each of the pathways based at least on the first index value and the second index value of the plurality of index values and on a frequency of occurrence of the each pathway in the set of positive drugs and in the set of negative drugs;
calculate a probability score of the drug as a ratio of the drug score and a summation of a set of pathway weights, whereby each pathway weight is a positive value; and
repurpose a drug for the indication, based on the probability score of the drug.
15. A non-transitory computer readable medium having stored thereon instructions for repurposing a drug comprising executable code which when executed by a processor, causes the processor to perform steps comprising:
selecting a set of positive drugs for an indication;
listing a set of pathways for the set of positive drugs and a set of negative drugs;
determining when an action is associated with each of the set of positive drugs and the set of negative drugs acting on each of the pathways;
associating each of the pathways for each of the set of positive drugs and the set of negative drugs with a first index value of a plurality of index values, when the determination indicates that an action is associated with each of the set of positive drugs and the set of negative drugs on each of the pathways;
calculating a pathway weight for each of the pathways based at least on the first index value of the plurality of index values and on a frequency of occurrence of the each pathway in the set of positive drugs and in the set of negative drugs;
identifying a drug score for a drug from the negative set of drugs, based on the pathway weight;
associating each of the pathways for of the set of positive drugs and the set of negative drugs with a second index value of the plurality of index values, when the determination indicates that an action is not associated with each of the set of positive drugs and the set of negative drugs on each of the pathways;
calculating the pathway weight for each of the pathways based at least on the first index value and the second index value of the plurality of index values and on a frequency of occurrence of the each pathway in the set of positive drugs and in the set of negative drugs;
calculating a probability score of the drug as a ratio of the drug score and a summation of a set of pathway weights, whereby each pathway weight is a positive value; and
repurposing a drug for the indication, based on the probability score of the drug.
1. A method for drug repurposing, the method comprising:
selecting, by a drug repurposing computing device, a set of positive drugs for an indication;
listing, by the drug repurposing computing device, a set of pathways for the set of positive drugs and a set of negative drugs;
determining, by the drug repurposing computing device, when an action is associated with each of the set of positive drugs and the set of negative drugs acting on each of the pathways;
associating, by the drug repurposing computing device, each of the pathways for each of the set of positive drugs and the set of negative drugs with a first index value of a plurality of index values, when the determination indicates that an action is associated with each of the set of positive drugs and the set of negative drugs on each of the pathways;
calculating, by the drug repurposing computing device, a pathway weight for each of the pathways based at least on the first index value of the plurality of index values and on a frequency of occurrence of the each pathway in the set of positive drugs and in the set of negative drugs;
identifying, by the drug repurposing computing device, a drug score for a drug from the negative set of drugs, based on the pathway weight;
associating, by the drug repurposing computing device, each of the pathways for of the set of positive drugs and the set of negative drugs with a second index value of the plurality of index values, when the determination indicates that an action is not associated with each of the set of positive drugs and the set of negative drugs on each of the pathways;
calculating, by the drug repurposing computing device, the pathway weight for each of the pathways based at least on the first index value and the second index value of the plurality of index values and on a frequency of occurrence of the each pathway in the set of positive drugs and in the set of negative drugs;
calculating, by the drug repurposing computing device, a probability score of the drug as a ratio of the drug score and a summation of a set of pathway weights, whereby each pathway weight is a positive value; and
repurposing, by the drug repurposing computing device, a drug for the indication, based on the probability score of the drug.
2. The method of
refining of the repurposed drug, based on a predetermined set of criteria.
3. The method of
4. The method of
5. The method of
6. The method of
7. The method of
9. The device of
10. The device of
11. The device of
12. The device of
13. The device of
14. The device of
16. The medium of
17. The medium of
18. The medium of
19. The medium of
20. The medium of
21. The medium of
|
This application claims the benefit of Indian Patent Application Serial No. 676/CHE/2014 filed Feb. 13, 2014, which is hereby incorporated by reference in its entirety.
The present invention relates generally to a method and system for drug repurposing. More specifically, the present invention relates to a method and system for identifying approved drugs for cure of new therapeutic indications.
Drug repurposing is a strategy by which new or additional value is usually generated from a drug by targeting diseases other than those diseases for which the drug was originally intended. The drug repositioning strategy has been known to resolve a problem of high expenditure in discovering new remedies for diseases. Advantages of the drug repurposing include reduced research and development costs, and improved probability of success as a repositioned drug will have passed related toxicology and safety assessments.
Currently individual in-silico approaches are adapted for the drug repurposing. Certain approaches that apply a mechanism of action fail to provide an informatics view of data related to the drug, pathways and an indication to be treated. Hence there is a need for an alternate method and system that takes the informatics view of the data related to the drug, the indication, the pathway and target information for building a pathway frequency based model. This pathway frequency based model can be used for prediction of fitment of the repurposed drug for the indication.
The alternate system and method must also include a clustering approach for generation of an alternate scoring and prediction mechanism for the repurposed drugs. Thus a unique system and method for drug repurposing is proposed.
The present invention provides a method and system for drug repurposing. In accordance with a disclosed embodiment, the method may include selecting a set of positive drugs for an indication and listing a set of pathways for the set of positive drugs and a set of negative drugs. Further, the method shall include associating a pathway for each drug with an index value, based on an action of the each drug on the pathway. A pathway weight shall be calculated from the index value of the each pathway based on a frequency of occurrence of the each pathway in the set of positive drugs and in the set of negative drugs. A drug score for a drug to be repurposed shall be identified from the negative set of drugs, based on the pathway weight.
In an additional embodiment, a system for drug repurposing is disclosed. The system comprises a selection unit that can select a list of positive drugs for an indication. A lookup table shall enlist a set of pathways for the set of positive drugs and a set of negative drugs. Further, an indexing unit can be configured to associate a pathway for each drug with an index value, based on an action of the each drug on the pathway. The system shall further include a calculation unit, configured to calculate a pathway weight from the index value of the each pathway based on a frequency of occurrence of the each pathway in the set of positive drugs and in the set of negative drugs; and a drug score for the each drug based on the pathway weight.
These and other features, aspects, and advantages of the present invention will be better understood with reference to the following description and claims.
While systems and methods are described herein by way of example and embodiments, those skilled in the art recognize that systems and methods proposed for drug repurposing are not limited to the embodiments or drawings described. It should be understood that the drawings and description are not intended to be limiting to the particular form disclosed. Rather, the intention is to cover all modifications, equivalents and alternatives falling within the spirit and scope of the appended claims. Any headings used herein are for organizational purposes only and are not meant to limit the scope of the description or the claims. As used herein, the word “may” is used in a permissive sense (i.e., meaning having the potential to) rather than the mandatory sense (i.e., meaning must). Similarly, the words “include”, “including”, and “includes” mean including, but not limited to.
Disclosed embodiments provide computer-implemented methods, systems, and computer-program products for repurposing a drug. More specifically the methods, and systems disclosed implement a mechanism of action approach, for accelerating the repurposing of the drug, based on a premise that drugs acting in the same indication can act similarly at mechanistic level.
Further, at step 204, a set of pathways for the set of positive drugs and the set of negative drugs can be listed. At step 206, an action of a drug on each pathway shall be determined. In an event the drug acts on a target on the each pathway a value of one shall be associated with an index value of the pathway, at step 208. However in an event the drug acts on a target on the each pathway, a value of zero can be associated with the index value at step 210. At step 212, a pathway weight can be calculated from the index value of the each pathway. The pathway weight shall be based on a frequency of occurrence of the each pathway in the set of positive drugs and in the set of negative drugs.
In an instance, a binary matrix of the set of positive drugs and the set of negative drugs can be formed. The binary matrix can be a matrix where a first column can consists of the set of pathways and the first row can consists of the set of positive drugs and the set of negative drugs for the indication. Against each pathway, an index value of zero or one can be associated based on whether a drug acts on the each pathway. In an event the drug acts upon the each pathway, the index value can be one. In an event the drug does not act upon the each pathway, the index value can be zero. The binary matrix can be illustrated as below:
Positive
Positive
Positive
Negative
Negative
drug 1
drug 2
drug n
drug 1
drug n
Pathway 1
1
1
0
0
1
Pathway 2
0
0
1
1
0
Pathway 3
1
1
1
0
0
. . .
0
1
1
1
0
A drug score shall be identified for a drug, from the set of negative drugs, based on a pathway weight at step 214. In the disclosed embodiment, the drug score can be calculated as a summation of a product of the pathway weight with the index value of the each pathway. At step 216, a probability score can be calculated from the drug score as a ratio of the drug score and a summation of a set of pathway weights. Based on the probability score of a drug, the drug maybe repurposed at step 218. At step 220, the repurposed drug maybe refined based on a set of predetermined criteria. In the disclosed embodiment, the predetermined set of criteria can include a physiochemical property of the drug, a side effect of the drug, and a QT interval.
One or more of the above-described techniques can be implemented in or involve one or more computer systems.
With reference to
A computing environment may have additional features. For example, the computing environment 400 includes storage 440, one or more input devices 440, one or more output devices 460, and one or more communication connections 470. An interconnection mechanism (not shown) such as a bus, controller, or network interconnects the components of the computing environment 400. Typically, operating system software (not shown) provides an operating environment for other software executing in the computing environment 400, and coordinates activities of the components of the computing environment 400.
The storage 440 may be removable or non-removable, and includes magnetic disks, magnetic tapes or cassettes, CD-ROMs, CD-RWs, DVDs, or any other medium which can be used to store information and which can be accessed within the computing environment 400. In some embodiments, the storage 440 stores instructions for the software 480.
The input device(s) 450 may be a touch input device such as a keyboard, mouse, pen, trackball, touch screen, or game controller, a voice input device, a scanning device, a digital camera, or another device that provides input to the computing environment 400. The output device(s) 460 may be a display, printer, speaker, or another device that provides output from the computing environment 400.
The communication connection(s) 470 enable communication over a communication medium to another computing entity. The communication medium conveys information such as computer-executable instructions, audio or video information, or other data in a modulated data signal. A modulated data signal is a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media include wired or wireless techniques implemented with an electrical, optical, RF, infrared, acoustic, or other carrier.
Implementations can be described in the general context of computer-readable media. Computer-readable media are any available media that can be accessed within a computing environment. By way of example, and not limitation, within the computing environment 400, computer-readable media include memory 420, storage 440, communication media, and combinations of any of the above.
Having described and illustrated the principles of our invention with reference to described embodiments, it will be recognized that the described embodiments can be modified in arrangement and detail without departing from such principles. It should be understood that the programs, processes, or methods described herein are not related or limited to any particular type of computing environment, unless indicated otherwise. Various types of general purpose or specialized computing environments may be used with or perform operations in accordance with the teachings described herein. Elements of the described embodiments shown in software may be implemented in hardware and vice versa.
As will be appreciated by those ordinary skilled in the art, the foregoing example, demonstrations, and method steps may be implemented by suitable code on a processor base system, such as general purpose or special purpose computer. It should also be noted that different implementations of the present technique may perform some or all the steps described herein in different orders or substantially concurrently, that is, in parallel. Furthermore, the functions may be implemented in a variety of programming languages. Such code, as will be appreciated by those of ordinary skilled in the art, may be stored or adapted for storage in one or more tangible machine readable media, such as on memory chips, local or remote hard disks, optical disks or other media, which may be accessed by a processor based system to execute the stored code. Note that the tangible media may comprise paper or another suitable medium upon which the instructions are printed. For instance, the instructions may be electronically captured via optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
The following description is presented to enable a person of ordinary skill in the art to make and use the invention and is provided in the context of the requirement for a obtaining a patent. The present description is the best presently-contemplated method for carrying out the present invention. Various modifications to the preferred embodiment will be readily apparent to those skilled in the art and the generic principles of the present invention may be applied to other embodiments, and some features of the present invention may be used without the corresponding use of other features. Accordingly, the present invention is not intended to be limited to the embodiment shown but is to be accorded the widest scope consistent with the principles and features described herein.
While the foregoing has described certain embodiments and the best mode of practicing the invention, it is understood that various implementations, modifications and examples of the subject matter disclosed herein may be made. It is intended by the following claims to cover the various implementations, modifications, and variations that may fall within the scope of the subject matter described.
Bundela, Saurabh, Boloor, Krutin Kumar, Durgad, Pooja, Patrao, Rajesh Lawrence, Pn, Deepak
Patent | Priority | Assignee | Title |
Patent | Priority | Assignee | Title |
6859735, | May 08 1998 | Microsoft Technology Licensing, LLC | Computer systems for identifying pathways of drug action |
7660709, | Mar 18 2004 | GENEGO, INC | Bioinformatics research and analysis system and methods associated therewith |
20080161228, | |||
20100161301, | |||
20120011156, | |||
20130138478, | |||
20140193517, | |||
20160171173, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Feb 03 2015 | Infosys Limited | (assignment on the face of the patent) | / | |||
Apr 14 2017 | BUNDELA, SAURABH | Infosys Limited | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 042975 | /0212 | |
Apr 17 2017 | BOLOOR, KRUTIN KUMAR | Infosys Limited | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 042975 | /0212 | |
Apr 17 2017 | DURGAD, POOJA | Infosys Limited | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 042975 | /0212 | |
Apr 18 2017 | PATRAO, RAJESH LAWRENCE | Infosys Limited | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 042975 | /0212 | |
Jun 22 2017 | PN, DEEPAK | Infosys Limited | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 042975 | /0212 |
Date | Maintenance Fee Events |
May 18 2022 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
Date | Maintenance Schedule |
Nov 27 2021 | 4 years fee payment window open |
May 27 2022 | 6 months grace period start (w surcharge) |
Nov 27 2022 | patent expiry (for year 4) |
Nov 27 2024 | 2 years to revive unintentionally abandoned end. (for year 4) |
Nov 27 2025 | 8 years fee payment window open |
May 27 2026 | 6 months grace period start (w surcharge) |
Nov 27 2026 | patent expiry (for year 8) |
Nov 27 2028 | 2 years to revive unintentionally abandoned end. (for year 8) |
Nov 27 2029 | 12 years fee payment window open |
May 27 2030 | 6 months grace period start (w surcharge) |
Nov 27 2030 | patent expiry (for year 12) |
Nov 27 2032 | 2 years to revive unintentionally abandoned end. (for year 12) |