2011
DOI: 10.1371/journal.pone.0014774
|View full text |Cite
|
Sign up to set email alerts
|

A Network-Based Multi-Target Computational Estimation Scheme for Anticoagulant Activities of Compounds

Abstract: BackgroundTraditional virtual screening method pays more attention on predicted binding affinity between drug molecule and target related to a certain disease instead of phenotypic data of drug molecule against disease system, as is often less effective on discovery of the drug which is used to treat many types of complex diseases. Virtual screening against a complex disease by general network estimation has become feasible with the development of network biology and system biology. More effective methods of c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
18
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 23 publications
(19 citation statements)
references
References 60 publications
(45 reference statements)
1
18
0
Order By: Relevance
“…Due to a global topological property of a network which could be applied to measure the integrity of the network, the network efficiency was assumed to be used as a measure for drug efficiency [13, 14, 25]. The NE of a graph G is measured by the shortest paths between pairs of nodes with the following NE=ijG1dij, where d ij is the length of the shortest path between nodes i and j and the sum is over all N ( N − 1)/2 pairs of nodes with a total number N of nodes in the graph G .…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Due to a global topological property of a network which could be applied to measure the integrity of the network, the network efficiency was assumed to be used as a measure for drug efficiency [13, 14, 25]. The NE of a graph G is measured by the shortest paths between pairs of nodes with the following NE=ijG1dij, where d ij is the length of the shortest path between nodes i and j and the sum is over all N ( N − 1)/2 pairs of nodes with a total number N of nodes in the graph G .…”
Section: Methodsmentioning
confidence: 99%
“…In recent years, computational polypharmacology approaches have been developed [1113]. Encouraged by the successes of using computational approaches to tackle various problems in different biological systems, we have developed a novel and valuable computational approach to evaluate the efficacy of ligands by calculating the influence on pathway network [14]. …”
Section: Introductionmentioning
confidence: 99%
“…Network efficiency (Latora & Marchiori, 2001), or critical node detection (Boginski & Commander, 2009) may serve as a starting measure to judge network integrity after multi-target action (Agoston et al, 2005; Csermely et al, 2005; Li et al, 2011c). Pathway analysis of molecular networks gives a more complex picture, and may reveal multiple intervention points affecting pathway-encoded functions, utilizing pathway cross-talks, or switching off compensatory circuits of network robustness.…”
Section: Areas Of Drug Design: An Assessment Of Network-related Admentioning
confidence: 99%
“…Also, a biological network-based multi-target computational estimation scheme was used for screening anticoagulant activity of a series of argatroban intermediates and eight natural products based on affinity predictions from their multi-target docking scores and network efficiency analysis [76]. This scheme has been evolved from the traditional single agent virtual screening method which relies on evaluating binding affinity of the agent to single target, on the other hand, this model has focused on a network screening strategy based on phenotypic data of drug molecules against a complex disease by general network estimation.…”
Section: Tight-integration With Computational Toolsmentioning
confidence: 99%