12033624
Computing motif correlations in proteins
Protein motifs, which are specific regions and conserved regions, are found by comparing multiple protein sequences. These conserved regions in general play an important role in protein functions and protein folds, for example, for their binding properties or enzymatic activities. The aim here is to find the existence correlations of protein motifs. The knowledge of protein motif/domain sharing should be important in shedding new light on the biologic functions of proteins and offering a basis in analyzing the evolution in the human genome or other genomes. The protein sequences used here are obtained from the PIR-NREF database and the protein motifs are retrieved from the PROSITE database. We apply data mining approach to discover the occurrence correlations of motif in protein sequences. The correlation of motifs mined can be used in evolution analyses and protein structure prediction. We discuss the latter, i.e., protein structure prediction in this study. The correlations mined are stored and maintained in a database system. The database is now available at http://bioinfo.csie.ncu.edu.tw/ProMotif/.
5048088
KinasePhos: a web tool for identifying protein kinase-specific phosphorylation sites
KinasePhos is a novel web server for computationally identifying catalytic kinase-specific phosphorylation sites. The known phosphorylation sites from public domain data sources are categorized by their annotated protein kinases. Based on the profile hidden Markov model, computational models are learned from the kinase-specific groups of the phosphorylation sites. After evaluating the learned models, the model with highest accuracy was selected from each kinase-specific group, for use in a web-based prediction tool for identifying protein phosphorylation sites. Therefore, this work developed a kinase-specific phosphorylation site prediction tool with both high sensitivity and specificity. The prediction tool is freely available at .
6014802
Identifying the combination of genetic factors that determine susceptibility to cervical cancer
Cervical cancer is common among women all over the world. Although infection with high-risk types of human papillomavirus (HPV) has been identified as the primary cause of cervical cancer, only some of those infected go on to develop cervical cancer. Obviously, the progression from HPV infection to cancer involves other environmental and host factors. Recent population-based twin and family studies have demonstrated the importance of the hereditary component of cervical cancer, associated with genetic susceptibility. Consequently, single-nucleotide polymorphism (SNP) markers and microsatellites should be considered genetic factors for determining what combinations of genetic factors are involved in precancerous changes to cervical cancer. This study employs a Bayesian network and four different decision tree algorithms, and compares the performance of these learning algorithms. The results of this study raise the possibility of investigations that could identify combinations of genetic factors, such as SNPs and microsatellites, that influence the risk associated with common complex multifactorial diseases, such as cervical cancer. The web site associated with this study is http://140.115.155.8/FactorAnalysis/.
18861193
An agent-based system to discover protein-protein interactions, identify protein complexes and proteins with multiple peptide mass fingerprints
Proteins "work together" by actually binding to form multicomponent complexes that carry out specific functions. Proteomic analyses based on the mass spectrum are now key methods to determine the components in protein complexes. The protein-protein interaction or functional association may be known to exist among the extracted protein spots while analyzing the proteins on the 2D gel. In this study, we develop an agent-based system, namely AgentMultiProtIdent, which integrated two protein identification tools and a variety of databases storing relations among proteins and used to discover protein-protein interactions and protein functional associations, and identify protein complexes and proteins with multiple peptide mass fingerprints as input. The system takes Multiple Peptide Mass Fingerprints (PMFs) as a whole in the protein complex or protein identification. With the relations among proteins, it may greatly improve the accuracy of identification of protein complexes. Also, possible relationship of the multiple peptide mass fingerprints, such as ontology relation, can be discovered by our system, especially in the identification of protein complexes. The agent-based system is now available on the Web at http://dbms104.csie.ncu.edu.tw/ approximately protein/NEW2/.
13750244
A database to aid probe design for virus identification
FENG-MAO LIN, HSIEN-DA HUANG, YU-CHUNG CHANG, PAK-LEONG CHAN, JORNG-TZONG HORNG, MING-TAT KO Department of Computer Science and Information Engineering, National Central University, No.300, Jungda Rd, Jhongli City, Taoyuan, Taiwan 320 ChungLi, 320, Taiwan Department of Biological Science and Technology & Institute of Bioinformatic, National ChiaoTung University, 1001 Ta Hsueh Road, Hsinchu, Taiwan 300 Hsin-Chu, 300, Taiwan Department of Biotechnology, Ming Chuan University, 250 Chung Shan North Road, Section 5, Taipei, 111, Taiwan Institute of Information Science, Academia Sinica, 128 Sec. 2, Academia Rd, Nankangm, Taipei, 115, Taiwan
3255925
A data mining method to predict transcriptional regulatory sites based on differentially expressed genes in human genome
Very large-scale gene expression analysis, i.e., UniGene and dbEST, are provided to find those genes with significantly differential expression in specific tissues. The differentially expressed genes in a specific tissue are potentially regulated concurrently by a combination of transcription factors. This study attempts to mine putative binding sites on how combinations of the known regulatory sites homologs and over-represented repetitive elements are distributed in the promoter regions of considered groups of differentially expressed genes. We propose a data mining approach to statistically discover the significantly tissue-specific combinations of known site homologs and over-represented repetitive sequences, which are distributed in the promoter regions of differential gene groups. The association rules mined would facilitate to predict putative regulatory elements and identify genes potentially co-regulated by the putative regulatory elements.
635773
Surface Alignment of 3D Spherical Harmonic Models: Application to Cardiac MRI Analysis
The spherical harmonic (SPHARM) description is a powerful surface modeling technique that can model arbitrarily shaped but simply connected 3D objects and has been used in many applications in medical imaging. Previous SPHARM techniques use the first order ellipsoid for establishing surface correspondence and aligning objects. However, this first order information may not be sufficient in many cases; a more general method for establishing surface correspondence would be to minimize the mean squared distance between two corresponding surfaces. In this paper, a new surface matching algorithm is proposed for 3D SPHARM models to achieve this goal. This algorithm employs a useful rotational property of spherical harmonic basis functions for a fast implementation. Applications of medical image analysis (e.g., spatio-temporal modeling of heart shape changes) are used to demonstrate this approach. Theoretical proofs and experimental results show that our approach is an accurate and flexible surface correspondence alignment method.
14443677
An Embedding Algorithm for Multiple Watermarks
A new algorithm for embedding several watermarks into the same original source is proposed in this paper. Instead of conventional watermark embedding algorithms that embed one watermark in one specific domain, we propose algorithms for embedding multiple watermarks into different compression domains to protect the ownership of the original images. The proposed schemes for embedding and extraction in different domains vary from the existing methods reported in the literature. Simulation results show their robustness for surviving intentional attacks and, hence, their effectiveness in protecting copyrights. They are also easy to implement.
19037242
iProClass: an integrated database of protein family, function and structure information
The iProClass database provides comprehensive, value-added descriptions of proteins and serves as a framework for data integration in a distributed networking environment. The protein information in iProClass includes family relationships as well as structural and functional classifications and features. The current version consists of about 830 000 non-redundant PIR-PSD, SWISS-PROT, and TrEMBL proteins organized with more than 36 000 PIR superfamilies, 145 000 families, 4000 domains, 1300 motifs and 550 000 FASTA similarity clusters. It provides rich links to over 50 database of protein sequences, families, functions and pathways, protein-protein interactions, post-translational modifications, protein expressions, structures and structural classifications, genes and genomes, ontologies, literature and taxonomy. Protein and superfamily summary reports present extensive annotation information and include membership statistics and graphical display of domains and motifs. iProClass employs an open and modular architecture for interoperability and scalability. It is implemented in the Oracle object-relational database system and is updated biweekly. The database is freely accessible from the web site at http://pir.georgetown.edu/iproclass/ and searchable by sequence or text string. The data integration in iProClass supports exploration of protein relationships. Such knowledge is fundamental to the understanding of protein evolution, structure and function and crucial to functional genomic and proteomic research.
7106859
Vector quantization based on genetic simulated annealing
Genetic algorithm (GA) has been successfully applied to codebook design for vector quantization (VQ). However, most conventional GA-based codebook design methods need long runtime because candidate solutions must be "ne tuned by LBG. In this paper, a partition-based GA is applied to codebook design, which is referred to as genetic vector quantization (GVQ). In addition, simulated annealing (SA) algorithm is also used in GVQ to get more promising results and the corresponding method is referred to as GSAVQ. Both GVQ and GSAVQ use the linear scaling technique during the calculation of objective functions and use special crossover and mutation operations in order to obtain better codebooks in much shorter CPU time. Experimental results show that both of them save more than 71}87% CPU time compared to LBG. For di!erent codebook sizes, GVQ outperforms LBG by 1.1}2.1 dB in PSNR, and GSAVQ outperforms LBG by 1.2}2.2 dB in PSNR. In addition, GVQ and GSAVQ need a little longer CPU time than, the maximum decent (MD) algorithm, but they outperform MD by 0.2}0.5 dB in PSNR. 2001 Elsevier Science B.V. All rights reserved.
6603995
Protein family classification and functional annotation
With the accelerated accumulation of genomic sequence data, there is a pressing need to develop computational methods and advanced bioinformatics infrastructure for reliable and large-scale protein annotation and biological knowledge discovery. The Protein Information Resource (PIR) provides an integrated public resource of protein informatics to support genomic and proteomic research. PIR produces the Protein Sequence Database of functionally annotated protein sequences. The annotation problems are addressed by a classification-driven and rule-based method with evidence attribution, coupled with an integrated knowledge base system being developed. The approach allows sensitive identification, consistent and rich annotation, and systematic detection of annotation errors, as well as distinction of experimentally verified and computationally predicted features. The knowledge base consists of two new databases, sequence analysis tools, and graphical interfaces. PIR-NREF, a non-redundant reference database, provides a timely and comprehensive collection of all protein sequences, totaling more than 1,000,000 entries. iProClass, an integrated database of protein family, function, and structure information, provides extensive value-added features for about 830,000 proteins with rich links to over 50 molecular databases. This paper describes our approach to protein functional annotation with case studies and examines common identification errors. It also illustrates that data integration in PIR supports exploration of protein relationships and may reveal protein functional associations beyond sequence homology.