Search

Growing grapevine (Vitis vinifera) is a key contribution to the economy of many countries. Tools provided by genomics and bioinformatics did help researchers in obtaining biological knowledge about the different cultivars. Several genetic markers for common diseases were identified. Recently, the impact of microbiome has been proved to be of fundamental importance both in humans and in plants for its ability to confer protection or induce diseases. In this review we report current knowledge about grapevine microbiome, together with a description of the available computational methodologies for meta-omics analysis. [ABSTRACT FROM AUTHOR]

Motivation: The identification of drug–target interaction (DTI) represents a costly and time-consuming step in drug discovery and design. Computational methods capable of predicting reliable DTI play an important role in the field. Recently, recommendation methods relying on network-based inference (NBI) have been proposed. However, such approaches implement naive topology-based inference and do not take into account important features within the drug–target domain.Results: In this article, we present a new NBI method, called domain tuned-hybrid (DT-Hybrid), which extends a well-established recommendation technique by domain-based knowledge including drug and target similarity. DT-Hybrid has been extensively tested using the last version of an experimentally validated DTI database obtained from DrugBank. Comparison with other recently proposed NBI methods clearly shows that DT-Hybrid is capable of predicting more reliable DTIs.Availability: DT-Hybrid has been developed in R and it is available, along with all the results on the predictions, through an R package at the following URL: http://sites.google.com/site/ehybridalgo/.Contact: apulvirenti@dmi.unict.itSupplementary information: Supplementary data are available at Bioinformatics online. [ABSTRACT FROM AUTHOR]

The BITS2012 meeting, held in Catania on May 2-4, 2012, brought together almost 100 Italian researchers working in the field of Bioinformatics, as well as students in the same or related disciplines. About 90 original research works were presented either as oral communication or as posters, representing a landscape of Italian current research in bioinformatics. This preface provides a brief overview of the meeting and introduces the manuscripts that were accepted for publication in this supplement, after a strict and careful peer-review by an International board of referees. [ABSTRACT FROM AUTHOR]

Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image understanding. Since subgraph isomorphism is a computationally hard problem, indexing techniques have been intensively exploited to speed up the process. Such systems filter out those graphs which cannot contain the query, and apply a subgraph isomorphism algorithm to each residual candidate graph. The applicability of such systems is limited to databases of small graphs, because their filtering power degrades on large graphs. Results: In this paper, SING (Subgraph search In Non-homogeneous Graphs), a novel indexing system able to cope with large graphs, is presented. The method uses the notion of feature, which can be a small subgraph, subtree or path. Each graph in the database is annotated with the set of all its features. The key point is to make use of feature locality information. This idea is used to both improve the filtering performance and speed up the subgraph isomorphism task. Conclusions: Extensive tests on chemical compounds, biological networks and synthetic graphs show that the proposed system outperforms the most popular systems in query time over databases of medium and large graphs. Other specific tests show that the proposed system is effective for single large graphs. [ABSTRACT FROM AUTHOR]

Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these graph databases, a key role is played by systems that search for all exact or approximate occurrences of a query graph. To deal efficiently with graph searching, advanced methods for indexing, representation and matching of graphs have been proposed. Results: This paper presents GraphFind. The system implements efficient graph searching algorithms together with advanced filtering techniques that allow approximate search. It allows users to select candidate subgraphs rather than entire graphs. It implements an effective data storage based also on low-support data mining. Conclusions: GraphFind is compared with Frowns, GraphGrep and gIndex. Experiments show that GraphFind outperforms the compared systems on a very large collection of small graphs. The proposed low-support mining technique which applies to any searching system also allows a significant index space reduction. [ABSTRACT FROM AUTHOR]

Uveal melanoma (UM) is the most common primary intraocular malignant tumor in adults and, although its genetic background has been extensively studied, little is known about the contribution of non-coding RNAs (ncRNAs) to its pathogenesis. Indeed, its competitive endogenous RNA (ceRNA) regulatory network comprising microRNAs (miRNAs), long non-coding RNAs (lncRNAs) and mRNAs has been insufficiently explored. Thanks to UM findings from The Cancer Genome Atlas (TCGA), it is now possible to statistically elaborate these data to identify the expression relationships among RNAs and correlative interaction data. In the present work, we propose the VECTOR (uVeal mElanoma Correlation NeTwORk) database, an interactive tool that identifies and visualizes the relationships among RNA molecules, based on the ceRNA model. The VECTOR database contains: (i) the TCGA-derived expression correlation values of miRNA-mRNA, miRNA-lncRNA and lncRNA-mRNA pairs combined with predicted or validated RNA-RNA interactions; (ii) data of sense-antisense sequence overlapping; (iii) correlation values of Transcription Factor (TF)-miRNA, TF-lncRNA, and TF-mRNA pairs associated with ChiPseq data; (iv) expression data of miRNAs, lncRNAs and mRNAs both in UM and physiological tissues. The VECTOR web interface can be queried, by inputting the gene name, to retrieve all the information about RNA signaling and visualize this as a graph. Finally, VECTOR provides a very detailed picture of ceRNA networks in UM and could be a very useful tool for researchers studying RNA signaling in UM. The web version of Vector is freely available at the URL reported at the end of the Introduction. [ABSTRACT FROM AUTHOR]