RecRWR: A Recursive Random Walk Method for Improved Identification of Diseases
نویسندگان
چکیده
منابع مشابه
RecRWR: A Recursive Random Walk Method for Improved Identification of Diseases
High-throughput methods such as next-generation sequencing or DNA microarrays lack precision, as they return hundreds of genes for a single disease profile. Several computational methods applied to physical interaction of protein networks have been successfully used in identification of the best disease candidates for each expression profile. An open problem for these methods is the ability to ...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملRandom recursive trees and the elephant random walk.
One class of random walks with infinite memory, so-called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We use a coupling between the two models to translate results from elephant random walks to the percolation process. We calculate, besides other quantities, exact...
متن کاملThe Random Walk Method for Intersecting Families
Let n,k,r and t be positive integers, and let [n] = {1,2, . . . ,n}. A family G ⊂ 2[n] is called r-wise t-intersecting if |G1∩·· ·∩Gr| ≥ t holds for all G1, . . . ,Gr ∈ G . Let us define a typical r-wise t-intersecting family Gi(n,r, t) and its k-uniform subfamily Fi(n,k,r, t), where 0 ≤ i ≤ ⌊n−t r ⌋, as follows: Gi(n,r, t) = {G ⊂ [n] : |G∩ [t + ri]| ≥ t +(r−1)i}, Fi(n,k,r, t) = Gi(n,r, t)∩ ([n...
متن کاملConvergence of a Random Walk Method for the Burgers Equation
We show that the solution of the Burgers equation can be approximated in LX(R), to within 0(m~1/*(lnm)2), by a random walk method generated by 0(m) particles. The nonlinear advection term of the equation is approximated by advecting the particles in a velocity field induced by the particles. The diffusive term is approximated by adding an appropriate random perturbation to the particle position...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BioMed Research International
سال: 2015
ISSN: 2314-6133,2314-6141
DOI: 10.1155/2015/747156