Identification of functionally related enzymes by learning-to-rank methods

Enzyme sequences and structures are routinely used in the biological sciences as queries to search for functionally related enzymes in online databases. To this end, one usually departs from some notion of similarity, comparing two enzymes by looking for correspondences in their sequences, structures or surfaces. For a given query, the search operation results in a ranking of the enzymes in the database, from very similar to dissimilar enzymes, while information about the biological function of annotated database enzymes is ignored. In this work we show that rankings of that kind can be substantially improved by applying kernel-based learning algorithms. This approach enables the detection of statistical dependencies between similarities of the active cleft and the biological function of annotated enzymes. This is in contrast to search-based approaches, which do not take annotated training data into account. Similarity measures based on the active cleft are known to outperform sequence-based or structure-based measures under certain conditions. We consider the Enzyme Commission (EC) classification hierarchy for obtaining annotated enzymes during the training phase. The results of a set of sizeable experiments indicate a consistent and significant improvement for a set of similarity measures that exploit information about small cavities in the surface of enzymes

Fast and Robust Small Infrared Target Detection Using Absolute Directional Mean Difference Algorithm

Infrared small target detection in an infrared search and track (IRST) system is a challenging task. This situation becomes more complicated when high gray-intensity structural backgrounds appear in the field of view (FoV) of the infrared seeker. While the majority of the infrared small target detection algorithms neglect directional information, in this paper, a directional approach is presented to suppress structural backgrounds and develop a more effective detection algorithm. To this end, a similar concept to the average absolute gray difference (AAGD) is utilized to construct a novel directional small target detection algorithm called absolute directional mean difference (ADMD). Also, an efficient implementation procedure is presented for the proposed algorithm. The proposed algorithm effectively enhances the target area and eliminates background clutter. Simulation results on real infrared images prove the significant effectiveness of the proposed algorithm.Comment: The Final version (Accepted in Signal Processing journal

Chemoinformatics Research at the University of Sheffield: A History and Citation Analysis

This paper reviews the work of the Chemoinformatics Research Group in the Department of Information Studies at the University of Sheffield, focusing particularly on the work carried out in the period 1985-2002. Four major research areas are discussed, these involving the development of methods for: substructure searching in databases of three-dimensional structures, including both rigid and flexible molecules; the representation and searching of the Markush structures that occur in chemical patents; similarity searching in databases of both two-dimensional and three-dimensional structures; and compound selection and the design of combinatorial libraries. An analysis of citations to 321 publications from the Group shows that it attracted a total of 3725 residual citations during the period 1980-2002. These citations appeared in 411 different journals, and involved 910 different citing organizations from 54 different countries, thus demonstrating the widespread impact of the Group's work

The specificity and robustness of long-distance connections in weighted, interareal connectomes

Brain areas' functional repertoires are shaped by their incoming and outgoing structural connections. In empirically measured networks, most connections are short, reflecting spatial and energetic constraints. Nonetheless, a small number of connections span long distances, consistent with the notion that the functionality of these connections must outweigh their cost. While the precise function of these long-distance connections is not known, the leading hypothesis is that they act to reduce the topological distance between brain areas and facilitate efficient interareal communication. However, this hypothesis implies a non-specificity of long-distance connections that we contend is unlikely. Instead, we propose that long-distance connections serve to diversify brain areas' inputs and outputs, thereby promoting complex dynamics. Through analysis of five interareal network datasets, we show that long-distance connections play only minor roles in reducing average interareal topological distance. In contrast, areas' long-distance and short-range neighbors exhibit marked differences in their connectivity profiles, suggesting that long-distance connections enhance dissimilarity between regional inputs and outputs. Next, we show that -- in isolation -- areas' long-distance connectivity profiles exhibit non-random levels of similarity, suggesting that the communication pathways formed by long connections exhibit redundancies that may serve to promote robustness. Finally, we use a linearization of Wilson-Cowan dynamics to simulate the covariance structure of neural activity and show that in the absence of long-distance connections, a common measure of functional diversity decreases. Collectively, our findings suggest that long-distance connections are necessary for supporting diverse and complex brain dynamics.Comment: 18 pages, 8 figure