G protein coupled receptors (GPCRs) are one of the most prominent and abundant family of membrane proteins in the human genome. Since they are main targets of many drugs, GPCR research has grown significantly in recen...
详细信息
ISBN:
(纸本)9783642341236
G protein coupled receptors (GPCRs) are one of the most prominent and abundant family of membrane proteins in the human genome. Since they are main targets of many drugs, GPCR research has grown significantly in recent years. However the fact that only few structures of GPCRs are known still remains as an important challenge. therefore, the classification of GPCRs is a significant problem provoked from increasing gap between orphan GPCR sequences and a small amount of annotated ones. this work employs motif distillation using defined parameters, distinguishing power evaluation method and general weighted set cover problem in order to determine the minimum set of motifs which can cover a particular GPCR subfamily. Our results indicate that in Family A Peptide subfamily, 91% of all proteins listed in GPCRdb can be covered by using only 691 different motifs, which can be employed later as an invaluable source for developing a third level GPCR classification tool.
A basic task in protein analysis is to discover a set of sequence patterns that characterizes the function of a protein family. To address this task, we introduce a synthesized pattern representation called Aligned Pa...
详细信息
ISBN:
(纸本)9783642341236
A basic task in protein analysis is to discover a set of sequence patterns that characterizes the function of a protein family. To address this task, we introduce a synthesized pattern representation called Aligned pattern (AP) Cluster to discover potential functional segments in protein sequences. We apply our algorithm to identify and display the binding segments for the Cytochrome C. and Ubiquitin protein families. the resulting AP Clusters correspond to protein binding segments that surround the binding residues. When compared to the results from the protein annotation databases, PROSITE and pFam, ours are more efficient in computation and comprehensive in quality. the significance of the AP Cluster is that it is able to capture subtle variations of the binding segments in protein families. It thus could help to reduce time-consuming simulations and experimentation in the protein analysis.
Accurately predicting the binding affinities of large sets of diverse molecules against a range of macromolecular targets is an extremely challenging task. the scoring functions that attempt such computational predict...
详细信息
ISBN:
(纸本)9783642341236
Accurately predicting the binding affinities of large sets of diverse molecules against a range of macromolecular targets is an extremely challenging task. the scoring functions that attempt such computational prediction exploiting structural data are essential for analysing the outputs of Molecular Docking, which is in turn an important technique for drug discovery, chemical biology and structural biology. Conventional scoring functions assume a predetermined theory-inspired functional form for the relationship between the variables that characterise the complex and its predicted binding affinity. the inherent problem of this approach is in the difficulty of explicitly modelling the various contributions of intermolecular interactions to binding affinity. Recently, a new family of 3D structure-based regression models for binding affinity prediction has been introduced which circumvent the need for modelling assumptions. these machine learning scoring functions have been shown to widely outperform conventional scoring functions. However, to date no direct comparison among machine learning scoring functions has been made. Here the performance of the two most popular machine learning scoring functions for this task is analysed under exactly the same experimental conditions.
the purpose of our research is the elucidation of glycan recognitionpatterns. Glycans are composed of monosaccharides and have complex structures with branches due to the fact that monosaccharides have multiple poten...
详细信息
ISBN:
(纸本)9783642341236
the purpose of our research is the elucidation of glycan recognitionpatterns. Glycans are composed of monosaccharides and have complex structures with branches due to the fact that monosaccharides have multiple potential binding positions compared to amino acids. Each monosaccharide can potentially be bound by up to five other monosaccharides, compared to two for any amino acid. Glycans are often bound to proteins and lipids on the cell surface and play important roles in biological processes. Lectins in particular are proteins that recognize and bind to glycans. In general, lectins bind to the terminal monosaccharides of glycans on glycoconjugates. However, it is suggested that some lectins recognize not only terminal monosaccharides, but also internal monosaccharides, possibly influencing the binding affinity. Such analyses are difficult without novel bioinformatics techniques. thus, in order to better understand the glycan recognition mechanism of such biomolecules, we have implemented a novel algorithm for aligning glycan tree structures, which we provide as a web tool called MCAW (Multiple Carbohydrate Alignment with Weights). From our web tool, we have analyzed several different lectins, and our results could confirm the existence of well-known glycan motifs. Our work can now be used in several other analyses of glycan structures, such as in the development of glycan score matrices as well as in state model determination of probabilistic tree models. therefore, this work is a fundamental step in glycan pattern analysis to progress glycobiology research.
the aim of the paper is to experimentally examine the plausibility of Relevance Vector Machines (RVM) for protein secondary structure prediction. We restrict our attention to detecting strands which represent an espec...
详细信息
ISBN:
(纸本)9783642341236
the aim of the paper is to experimentally examine the plausibility of Relevance Vector Machines (RVM) for protein secondary structure prediction. We restrict our attention to detecting strands which represent an especially problematic element of the secondary structure. the commonly adopted local principle of secondary structure prediction is applied, which implies comparison of a sliding window in the given polypeptide chain with a number of reference amino-acid sequences cut out of the training proteins as benchmarks representing the classes of secondary structure. As distinct from the classical RVM, the novel version applied in this paper allows for selective combination of several tentative window comparison modalities. Experiments on the RS126 data set have shown its ability to essentially decrease the number of reference fragments in the resulting decision rule and to select a subset of the most appropriate comparison modalities within the given set of the tentative ones.
In this work we analyze the contribution of preprocessing steps for Latin handwriting recognition. A preprocessing pipeline based on geometric heuristics and image statistics is used. this pipeline is applied to Frenc...
详细信息
ISBN:
(纸本)9780769547749;9781467322621
In this work we analyze the contribution of preprocessing steps for Latin handwriting recognition. A preprocessing pipeline based on geometric heuristics and image statistics is used. this pipeline is applied to French and English handwriting recognition in an HMM based framework. Results show that preprocessing improves recognition performance for the two tasks. the Maximum Likelihood (ML)-trained HMM system reaches a competitive WER of 16.7% and outperforms many sophisticated systems for the French handwriting recognition task. the results for English handwriting are comparable to other ML-trained HMM recognizers. Using MLP preprocessing a WER of 35.3% is achieved.
In this paper, we extend the concept of moment-based normalization of images from digit recognition to the recognition of handwritten text. Image moments provide robust estimates for text characteristics such as size ...
详细信息
ISBN:
(纸本)9780769547749;9781467322621
In this paper, we extend the concept of moment-based normalization of images from digit recognition to the recognition of handwritten text. Image moments provide robust estimates for text characteristics such as size and position of words within an image. For handwriting recognitionthe normalization procedure is applied to image slices independently. Additionally, a novel moment-based algorithm for line-thickness normalization is presented. the proposed normalization methods are evaluated on the RIMES database of French handwriting and the IAM database of English handwriting. For RIMES we achieve an improvement from 16.7% word error rate to 13.4% and for IAM from 46.6% to 37.3%.
patternrecognition is a wide field in progress. In particular, handwriting recognition has known a great development in the recent years. Several solutions have been directed towards the use of Bayesian networks, whi...
详细信息
ISBN:
(纸本)9781467316583
patternrecognition is a wide field in progress. In particular, handwriting recognition has known a great development in the recent years. Several solutions have been directed towards the use of Bayesian networks, which have shown their ability to solve complex problems in many areas, and that is thanks to their ability to model inaccuracies, which are lacunae highly present in the manuscript field. In this paper, we recall the basics of these networks and the difficulties come across in their learning and inference algorithms to make a good decision. We present a state of using the BNs and especially RBDs in the patternrecognition and more exactly in the character recognition. We show, through the various considered works, the contribution of this technique in solving the limitations of the Markov models and its ability to represent efficiently the temporal notion and the dependencies between the variables during the writing process. Moreover, we retain the recorded limitations and some development perspectives.
We present a software tool created for human-computer interaction based on hand gestures. the underlying algorithm utilizes computer vision techniques. the tool is able to recognize in real-time six different hand sig...
详细信息
this paper provides a survey on the evolution of the evolving connectionist systems (ECOS) paradigm, from simple ECOS introduced in 1998 to evolving spiking neural networks (eSNN) and neurogenetic systems. It presents...
详细信息
暂无评论