GRaSP: a graph-based residue neighborhood strategy to predict binding sites
نویسندگان
چکیده
منابع مشابه
A Strategy for Drawing a Conceptual Neighborhood Graph Schematically
Locate the relations in R1¥{r *} on the x-axis at (a, 0, 0) (a∈Z), such that the length of each link becomes two. Leave the relations that have no link with the other relations in R1. In a similar way, locate the relations in R2¥{r *} on the y-axis. For each Ci, identify R’s subset Ri that is self-symmetric with respect to Ci. Then, among the relations in Ri, identify the relation r * that has ...
متن کاملCommon Neighborhood Graph
Let G be a simple graph with vertex set {v1, v2, … , vn}. The common neighborhood graph of G, denoted by con(G), is a graph with vertex set {v1, v2, … , vn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper, we compute the common neighborhood of some composite graphs. In continue, we investigate the relation between hamiltoni...
متن کاملa paradigm shift away from method-wise teaching to strategy-wise teaching: an investigation of reconstructive strategy versus communicative strategy
چکیده: هدف اصلی این مطالعه ی توصیفی تحقیقی در حقیقت تلاشی پساروش-گرا به منظور رسیدن به نتیجه ای منطقی در انتخاب مناسبترین راهکار آموزشی بر گرفته از چارچوب راهبردی مطرح شده توسط والدمر مارتن بوده که به بهترین شکل سازگار و مناسب با سامانه ی آموزشی ایران باشد. از این رو، دو راهکار آموزشی، راهکار ارتباطی و راهکار بازساختی، برای تحقیق و بررسی انتخاب شدند. صریحاً اینکه، در راستای هدف اصلی این پژوهش، ر...
15 صفحه اولA GRASP for graph planarization
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. In this paper, we describe a GRASP for the graph planarization problem, extending the heuristic of Goldschmidt and Takvorian [Networks, v. 24, pp. 69–73, 1994]. We review basic concepts of GRASP: construction and local search algorithms. The implementation of GRASP for graph planarization is...
متن کاملIncorporating Nucleosome Occupancy to Predict Transcription Factor Binding Sites
Bo Jiang April 29, 2007 ABSTRACT Traditional methods to identify potential binding sites of known transcription factors usually neglect abundant information hidden in a large genomic scale. Recent researches, however, reveal that the intrinsic nucleosome organization in genome can be predicted and may help in directing transcription factors towards their target sites. In this paper, we present ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2020
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btaa805