Leaders in Social Networks, the Delicious Case

Finding pertinent information is not limited to search engines. Online communities can amplify the influence of a small number of power users for the benefit of all other users. Users' information foraging in depth and breadth can be greatly enhanced by choosing suitable leaders. For instance in delicious.com, users subscribe to leaders' collection which lead to a deeper and wider reach not achievable with search engines. To consolidate such collective search, it is essential to utilize the leadership topology and identify influential users. Google's PageRank, as a successful search algorithm in the World Wide Web, turns out to be less effective in networks of people. We thus devise an adaptive and parameter-free algorithm, the LeaderRank, to quantify user influence. We show that LeaderRank outperforms PageRank in terms of ranking effectiveness, as well as robustness against manipulations and noisy data. These results suggest that leaders who are aware of their clout may reinforce the development of social networks, and thus the power of collective search

Uncovering packaging features of co-regulated modules based on human protein interaction and transcriptional regulatory networks

<p>Abstract</p> <p>Background</p> <p>Network co-regulated modules are believed to have the functionality of packaging multiple biological entities, and can thus be assumed to coordinate many biological functions in their network neighbouring regions.</p> <p>Results</p> <p>Here, we weighted edges of a human protein interaction network and a transcriptional regulatory network to construct an integrated network, and introduce a probabilistic model and a bipartite graph framework to exploit human co-regulated modules and uncover their specific features in packaging different biological entities (genes, protein complexes or metabolic pathways). Finally, we identified 96 human co-regulated modules based on this method, and evaluate its effectiveness by comparing it with four other methods.</p> <p>Conclusions</p> <p>Dysfunctions in co-regulated interactions often occur in the development of cancer. Therefore, we focussed on an example co-regulated module and found that it could integrate a number of cancer-related genes. This was extended to causal dysfunctions of some complexes maintained by several physically interacting proteins, thus coordinating several metabolic pathways that directly underlie cancer.</p

A Graph Mining Study for GCC International Airports

In the last few years, Gulf Cooperation Council countries (GCC) allocated billions of dollars for expanding and upgrading its airports, therefore many studies and researches were held in order to analyze the crucial impact airports have on the economical development of these countries. This study aims to analyze airports network in GCC countries and reveal the facts hidden beneath it. The author prepared a genuine dataset about GCC airports network and represented it as a graph dataset. Using an open source software called Gephi [1], the author applied data mining techniques on the airports graph with the aid of several graphical metrics like degree centrality, betweenness and closeness centrality, and other types of metrics. The author was able to reveal some interesting facts about the airports in GCC countries. These facts showed that airports like Dubai International airport is considered an important continental hub for aviation, while other airports like Kuwait airport has a limited influence and importance in GCC airports network

Prediction of quantitative phenotypes based on genetic networks: a case study in yeast sporulation

<p>Abstract</p> <p>Background</p> <p>An exciting application of genetic network is to predict phenotypic consequences for environmental cues or genetic perturbations. However, <it>de novo </it>prediction for quantitative phenotypes based on network topology is always a challenging task.</p> <p>Results</p> <p>Using yeast sporulation as a model system, we have assembled a genetic network from literature and exploited Boolean network to predict sporulation efficiency change upon deleting individual genes. We observe that predictions based on the curated network correlate well with the experimentally measured values. In addition, computational analysis reveals the robustness and hysteresis of the yeast sporulation network and uncovers several patterns of sporulation efficiency change caused by double gene deletion. These discoveries may guide future investigation of underlying mechanisms. We have also shown that a hybridized genetic network reconstructed from both temporal microarray data and literature is able to achieve a satisfactory prediction accuracy of the same quantitative phenotypes.</p> <p>Conclusions</p> <p>This case study illustrates the value of predicting quantitative phenotypes based on genetic network and provides a generic approach.</p

An algorithm for network-based gene prioritization that encodes knowledge both in nodes and in links

Background: Candidate gene prioritization aims to identify promising new genes associated with a disease or a biological process from a larger set of candidate genes. In recent years, network-based methods - which utilize a knowledge network derived from biological knowledge - have been utilized for gene prioritization. Biological knowledge can be encoded either through the network's links or nodes. Current network-based methods can only encode knowledge through links. This paper describes a new network-based method that can encode knowledge in links as well as in nodes. Results: We developed a new network inference algorithm called the Knowledge Network Gene Prioritization (KNGP) algorithm which can incorporate both link and node knowledge. The performance of the KNGP algorithm was evaluated on both synthetic networks and on networks incorporating biological knowledge. The results showed that the combination of link knowledge and node knowledge provided a significant benefit across 19 experimental diseases over using link knowledge alone or node knowledge alone. Conclusions: The KNGP algorithm provides an advance over current network-based algorithms, because the algorithm can encode both link and node knowledge. We hope the algorithm will aid researchers with gene prioritization. © 2013 Kimmel, Visweswaran

Prioritizing disease candidate genes by a gene interconnectedness-based approach

<p>Abstract</p> <p>Background</p> <p>Genome-wide disease-gene finding approaches may sometimes provide us with a long list of candidate genes. Since using pure experimental approaches to verify all candidates could be expensive, a number of network-based methods have been developed to prioritize candidates. Such tools usually have a set of parameters pre-trained using available network data. This means that re-training network-based tools may be required when existing biological networks are updated or when networks from different sources are to be tried.</p> <p>Results</p> <p>We developed a parameter-free method, interconnectedness (ICN), to rank candidate genes by assessing the closeness of them to known disease genes in a network. ICN was tested using 1,993 known disease-gene associations and achieved a success rate of ~44% using a protein-protein interaction network under a test scenario of simulated linkage analysis. This performance is comparable with those of other well-known methods and ICN outperforms other methods when a candidate disease gene is not directly linked to known disease genes in a network. Interestingly, we show that a combined scoring strategy could enable ICN to achieve an even better performance (~50%) than other methods used alone.</p> <p>Conclusions</p> <p>ICN, a user-friendly method, can well complement other network-based methods in the context of prioritizing candidate disease genes.</p