WIPER: Weighted in-Path Edge Ranking for biomolecular association networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge ranking of weighted trees

In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for multitrees with diameter at most 10. Note that the same problem but for trees is linearly solvable. We give an O(log n)-approximation polynomial time algorithm for edge ranking of weighted trees.

متن کامل

Ranking Communities in Weighted Networks

Real-world networks exhibit significant community structure. Communities are sometimes explicitly known or defined (e.g., virtual groups that one joins in an online social network, departments in an organization), but are often determined using a community detection or a clustering algorithm. Given a weighted network, with edge weights denoting interaction strengths between vertices, and a mapp...

متن کامل

Edge-tenacity in Networks

Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...

متن کامل

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

Weighted Random Walks for Meta-Path Expansion in Heterogeneous Networks

In social networks, users and items are joined in a complex web of relations, which can be modeled as heterogeneous information networks. Such networks include a variety of object types and the rich relations among them. Recent research has shown that a hybrid recommendation approach combining components built from extended meta-paths in the network can improve the accuracy of recommendations i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantitative Biology

سال: 2019

ISSN: 2095-4689,2095-4697

DOI: 10.1007/s40484-019-0180-y