Interoperability of CABRI Services and Biochemical Pathways Databases

Common Access to Biological Resources and Information (CABRI) service is a 'one-stop-shop' for materials that are collected by a number of European culture collections that engage themselves in a quality service for the scientific community by adhering to Quality Guidelines for the management of resources and related information. It includes collections' catalogues that can be searched in an SRS implementation. A simple search facility, including a synonym search and a shopping cart, is also available. Within the European Biological Resource Centres Network (EBRCN) project, an extension and improvement of the catalogues' information is under way. This includes adding links to bibliographic databanks and sequence databases. Revision of 'in-house' controlled vocabularies used by data annotators is under way, in order to improve the setting up of external links, and new links to biochemical pathways databases are being set up for some of the catalogues.     

Predicting Co-Author Relationship in Medical Co-Authorship Networks

Research collaborations are encouraged because a synergistic effect yielding good results often appears. However, creating and organizing a strong research group is a difficult task. One of the greatest concerns of an individual researcher is locating potential collaborators whose expertise complement his best. In this paper, we propose a method that makes link predictions in co-authorship networks, where topological features between authors such as Adamic/Adar, Common Neighbors, Jaccard''s Coefficient, Preferential Attachment, Katz_β, and PropFlow may be good indicators of their future collaborations. Firstly, these topological features were systematically extracted from the network. Then, supervised models were used to learn the best weights associated with different topological features in deciding co-author relationships. Finally, we tested our models on the co-authorship networks in the research field of Coronary Artery Disease and obtained encouraging accuracy (the precision, recall, F1 score and AUC were, respectively, 0.696, 0.677, 0.671 and 0.742 for Logistic Regression, and respectively, 0.697, 0.678, 0.671 and 0.743 for SVM). This suggests that our models could be used to build and manage strong research groups.     

A Noise-Filtering Method for Link Prediction in Complex Networks

Link prediction plays an important role in both finding missing links in networked systems and complementing our understanding of the evolution of networks. Much attention from the network science community are paid to figure out how to efficiently predict the missing/future links based on the observed topology. Real-world information always contain noise, which is also the case in an observed network. This problem is rarely considered in existing methods. In this paper, we treat the existence of observed links as known information. By filtering out noises in this information, the underlying regularity of the connection information is retrieved and then used to predict missing or future links. Experiments on various empirical networks show that our method performs noticeably better than baseline algorithms.     

Link Prediction in Criminal Networks: A Tool for Criminal Intelligence Analysis

The problem of link prediction has recently received increasing attention from scholars in network science. In social network analysis, one of its aims is to recover missing links, namely connections among actors which are likely to exist but have not been reported because data are incomplete or subject to various types of uncertainty. In the field of criminal investigations, problems of incomplete information are encountered almost by definition, given the obvious anti-detection strategies set up by criminals and the limited investigative resources. In this paper, we work on a specific dataset obtained from a real investigation, and we propose a strategy to identify missing links in a criminal network on the basis of the topological analysis of the links classified as marginal, i.e. removed during the investigation procedure. The main assumption is that missing links should have opposite features with respect to marginal ones. Measures of node similarity turn out to provide the best characterization in this sense. The inspection of the judicial source documents confirms that the predicted links, in most instances, do relate actors with large likelihood of co-participation in illicit activities.     

Influence of Reciprocal Links in Social Networks

How does reciprocal links affect the function of real social network? Does reciprocal link and non-reciprocal link play the same role? Previous researches haven''t displayed a clear picture to us until now according to the best of our knowledge. Motivated by this, in this paper, we empirically study the influence of reciprocal links in two representative real datasets, Sina Weibo and Douban. Our results demonstrate that the reciprocal links play a more important role than non-reciprocal ones in information diffusion process. In particular, not only coverage but also the speed of the information diffusion can be significantly enhanced by considering the reciprocal effect. We give some possible explanations from the perspectives of network connectivity and efficiency. This work may shed some light on the in-depth understanding and application of the reciprocal effect in directed online social networks.     

Detection of the dominant direction of information flow and feedback links in densely interconnected regulatory networks

Background  

Finding the dominant direction of flow of information in densely interconnected regulatory or signaling networks is required in many applications in computational biology and neuroscience. This is achieved by first identifying and removing links which close up feedback loops in the original network and hierarchically arranging nodes in the remaining network. In mathematical language this corresponds to a problem of making a graph acyclic by removing as few links as possible and thus altering the original graph in the least possible way. The exact solution of this problem requires enumeration of all cycles and combinations of removed links, which, as an NP-hard problem, is computationally prohibitive even for modest-size networks.     

基于元分析的抗玉米丝黑穗病QTL比较定位

以玉米遗传连锁图谱IBM2 2005 Neighbors为参考图谱,通过映射整合不同试验中的抗玉米丝黑穗病QTL,构建QTL综合图谱。在国内外种质中,共发现22个抗病QTL,分布在除第7染色体外的9条玉米染色体上。采用元分析技术,获得2个“一致性”抗病QTL,图距分别为8.79 cM和18.92cM。从MaizeGDB网站下载“一致性”QTL区间内基因和标记的原始序列;采用NCBI网站在线软件BLASTx通过同源比对在2个“一致性”QTL区间内初步获得4个抗病位置候选基因。借助比较基因电子定位策略,将69个水稻和玉米抗性基因定位于玉米IBM2图谱上,在2个“一致性”QTL区间内分别发现1个水稻抗性基因,初步推断为抗病位置候选基因。本文结果为抗玉米丝黑穗病QTL精细定位和分子育种提供了基础。     

玉米抗甘蔗花叶病毒基因的比较定位

收集了玉米抗甘蔗花叶病毒基因/QTL定位信息, 借助玉米遗传图谱IBM2 2005 Neighbors进行了整合。在国内外研究中, 累计报道81个抗病毒基因位点, 分布在玉米7条染色体上, 比较定位发现这些位点集中分布于第3和6染色体。采用元分析技术, 确定3个“一致性”抗病毒QTL, 其中1个位于第3染色体, 在遗传图谱IBM2 2005 Neighbors上覆盖的范围为6.44 cM; 2个位于第6染色体, 覆盖范围分别为6.16 cM和27.48 cM。借助比较基因组学策略, 在第3染色体“一致性”QTL区间内筛选出4个抗病位置候选基因。该研究结果为确定和克隆抗病主效基因提供了基础。     

Matching–centrality decomposition and the forecasting of new links in networks

Networks play a prominent role in the study of complex systems of interacting entities in biology, sociology, and economics. Despite this diversity, we demonstrate here that a statistical model decomposing networks into matching and centrality components provides a comprehensive and unifying quantification of their architecture. The matching term quantifies the assortative structure in which node makes links with which other node, whereas the centrality term quantifies the number of links that nodes make. We show, for a diverse set of networks, that this decomposition can provide a tight fit to observed networks. Then we provide three applications. First, we show that the model allows very accurate prediction of missing links in partially known networks. Second, when node characteristics are known, we show how the matching–centrality decomposition can be related to this external information. Consequently, it offers us a simple and versatile tool to explore how node characteristics explain network architecture. Finally, we demonstrate the efficiency and flexibility of the model to forecast the links that a novel node would create if it were to join an existing network.     

微生物学融合式网络课程建设方法探析

微生物学面授导学与网络课程的相互融合可有效推进微生物学教学改革、提升教学质量。从网络课程建设中“教学目标”、“教学内容”、“教学情境”、“教学效果”4个主要教学环节入手,提出将微生物学传统教学与网络教学相融合,构建面授导学与网络信息化有机整合的教学模式。通过增加教学过程中的兴趣性、自主性和创新性,实现教学质量与教学效果的有效提升。     

Generic Information Can Retrieve Known Biological Associations: Implications for Biomedical Knowledge Discovery

Motivation

Weighted semantic networks built from text-mined literature can be used to retrieve known protein-protein or gene-disease associations, and have been shown to anticipate associations years before they are explicitly stated in the literature. Our text-mining system recognizes over 640,000 biomedical concepts: some are specific (i.e., names of genes or proteins) others generic (e.g., ‘Homo sapiens’). Generic concepts may play important roles in automated information retrieval, extraction, and inference but may also result in concept overload and confound retrieval and reasoning with low-relevance or even spurious links. Here, we attempted to optimize the retrieval performance for protein-protein interactions (PPI) by filtering generic concepts (node filtering) or links to generic concepts (edge filtering) from a weighted semantic network. First, we defined metrics based on network properties that quantify the specificity of concepts. Then using these metrics, we systematically filtered generic information from the network while monitoring retrieval performance of known protein-protein interactions. We also systematically filtered specific information from the network (inverse filtering), and assessed the retrieval performance of networks composed of generic information alone.

Results

Filtering generic or specific information induced a two-phase response in retrieval performance: initially the effects of filtering were minimal but beyond a critical threshold network performance suddenly drops. Contrary to expectations, networks composed exclusively of generic information demonstrated retrieval performance comparable to unfiltered networks that also contain specific concepts. Furthermore, an analysis using individual generic concepts demonstrated that they can effectively support the retrieval of known protein-protein interactions. For instance the concept “binding” is indicative for PPI retrieval and the concept “mutation abnormality” is indicative for gene-disease associations.

Conclusion

Generic concepts are important for information retrieval and cannot be removed from semantic networks without negative impact on retrieval performance.     

Application of network theory to potential mycorrhizal networks

The concept of a common mycorrhizal network implies that the arrangement of plants and mycorrhizal fungi in a community shares properties with other networks. A network is a system of nodes connected by links. Here we apply network theory to mycorrhizas to determine whether the architecture of a potential common mycorrhizal network is random or scale-free. We analyzed mycorrhizal data from an oak woodland from two perspectives: the phytocentric view using trees as nodes and fungi as links and the mycocentric view using fungi as nodes and trees as links. From the phytocentric perspective, the distribution of potential mycorrhizal links, as measured by the number of ectomycorrhizal morphotypes on trees of Quercus garryana, was random with a short tail, implying that all the individuals of this species are more or less equal in linking to fungi in a potential network. From the mycocentric perspective, however, the distribution of plant links to fungi was scale-free, suggesting that certain fungus species may act as hubs with frequent connections to the network. Parallels exist between social networks and mycorrhizas that suggest future lines of study on mycorrhizal networks.     

Application of the recommendation architecture to telecommunications network management.

The recommendation architecture has been proposed as a system architecture which can enable a system to learn to perform a complex combination of interrelated functions. The capability of a system with the recommendation architecture to learn to manage complex telecommunication backbone networks has been investigated. A network model with a number of nodes and links and carrying realistic but randomly generated traffic was used as the target for the management system. Traffic data taken from the model was used as input to the recommendation architecture system. The traffic data was organized into inputs once every 5 minutes, and the management system organized these inputs into a hierarchy of repetition similarity. It was demonstrated that the outputs of this hierarchy provided information on the condition of the network. This output information was a compressed version of the inputs which correlated with major network conditions.     

Java editor for biological pathways

SUMMARY: A visual Java-based tool for drawing and annotating biological pathways was developed. This tool integrates the possibilities of charting elements with different attributes (size, color, labels), drawing connections between elements in distinct characteristics (color, structure, width, arrows), as well as adding links to molecular biology databases, promoter sequences, information on the function of the genes or gene products, and references. It is easy to use and system independent. The result of the editing process is a PNG (portable network graphics) file for the images and XML (extended markup language) file for the appropriate links.     

What Can Interaction Webs Tell Us About Species Roles?

The group model is a useful tool to understand broad-scale patterns of interaction in a network, but it has previously been limited in use to food webs, which contain only predator-prey interactions. Natural populations interact with each other in a variety of ways and, although most published ecological networks only include information about a single interaction type (e.g., feeding, pollination), ecologists are beginning to consider networks which combine multiple interaction types. Here we extend the group model to signed directed networks such as ecological interaction webs. As a specific application of this method, we examine the effects of including or excluding specific interaction types on our understanding of species roles in ecological networks. We consider all three currently available interaction webs, two of which are extended plant-mutualist networks with herbivores and parasitoids added, and one of which is an extended intertidal food web with interactions of all possible sign structures (+/+, -/0, etc.). Species in the extended food web grouped similarly with all interactions, only trophic links, and only nontrophic links. However, removing mutualism or herbivory had a much larger effect in the extended plant-pollinator webs. Species removal even affected groups that were not directly connected to those that were removed, as we found by excluding a small number of parasitoids. These results suggest that including additional species in the network provides far more information than additional interactions for this aspect of network structure. Our methods provide a useful framework for simplifying networks to their essential structure, allowing us to identify generalities in network structure and better understand the roles species play in their communities.     

Cumulative Effect in Information Diffusion: Empirical Study on a Microblogging Network

Cumulative effect in social contagion underlies many studies on the spread of innovation, behavior, and influence. However, few large-scale empirical studies are conducted to validate the existence of cumulative effect in information diffusion on social networks. In this paper, using the population-scale dataset from the largest Chinese microblogging website, we conduct a comprehensive study on the cumulative effect in information diffusion. We base our study on the diffusion network of message, where nodes are the involved users and links characterize forwarding relationship among them. We find that multiple exposures to the same message indeed increase the possibility of forwarding it. However, additional exposures cannot further improve the chance of forwarding when the number of exposures crosses its peak at two. This finding questions the cumulative effect hypothesis in information diffusion. Furthermore, to clarify the forwarding preference among users, we investigate both structural motif in the diffusion network and temporal pattern in information diffusion process. Findings provide some insights for understanding the variation of message popularity and explain the characteristics of diffusion network.