Prediction of Protein-Protein Interactions and Essential Genes Through Data Integration

Total Page:16

File Type:pdf, Size:1020Kb

Prediction of Protein-Protein Interactions and Essential Genes Through Data Integration Prediction of Protein-Protein Interactions and Essential Genes Through Data Integration by Max Kotlyar A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Department of Medical Biophysics University of Toronto Copyright °c 2011 by Max Kotlyar Abstract Prediction of Protein-Protein Interactions and Essential Genes Through Data Integration Max Kotlyar Doctor of Philosophy Graduate Department of Department of Medical Biophysics University of Toronto 2011 The currently known network of human protein-protein interactions (PPIs) is pro- viding new insights into diseases and helping to identify potential therapies. However, according to several estimates, the known interaction network may represent only 10% of the entire interactome – indicating that more comprehensive knowledge of the inter- actome could have a major impact on understanding and treating diseases. The primary aim of this thesis was to develop computational methods to provide increased coverage of the interactome. A secondary aim was to gain a better understanding of the link between networks and phenotype, by analyzing essential mouse genes. Two algorithms were developed to predict PPIs and provide increased coverage of the interactome: F pClass and mixed co-expression. F pClass differs from previous PPI prediction methods in two key ways: it integrates both positive and negative evidence for protein interactions, and it identifies synergies between predictive features. Through these approaches F pClass provides interaction networks with significantly improved reli- ability and interactome coverage. Compared to previous predicted human PPI networks, FpClass provides a network with over 10 times more interactions, about 2 times more pro- teins and a lower false discovery rate. This network includes 595 disease related proteins from OMIM and Cancer Gene Census which have no previously known interactions. The second method, mixed co-expression, aims to predict transient PPIs, which have proven ii difficult to detect by computational and experimental methods. Mixed co-expression makes predictions using gene co-expression and performs significantly better (p < 0.05) than the previous method for predicting PPIs from co-expression. It is especially effective for identifying interactions of transferases and signal transduction proteins. For the second aim of the thesis, we investigated the relationship between gene es- sentiality and diverse gene/protein features based on gene expression, PPI and gene co-expression networks, gene/protein sequence, Gene Ontology, and orthology. We iden- tified non-redundant features closely associated with essentiality, including centrality in PPI and gene co-expression networks. We found that no single predictive feature was effective for all essential genes; most features, including centrality, were less effective for genes associated with postnatal lethality and infertility. These results suggest that understanding phenotype will require integrating measures of network topology with in- formation about the biology of the network’s nodes and edges. iii Acknowledgements Many people helped me complete this thesis and made the PhD experience much more enjoyable. First, I would like to thank my supervisor, Dr. Igor Jurisica, for providing a huge amount of help with all aspects of the thesis and great encouragement throughout the whole process. I would also like to thank the Jurisica Lab, past and present. Special thanks to: Kristen, for amazing editing help and great collaborations; Daniela, for soli- darity throughout the PhD process and very helpful thesis edits; Abraham, for excellent editing and ideas; Levi, for helping me adopt R and introducing the concept of apples with peanut butter; Dan, for urgent help with editing and biology questions; Kevin for lots of help with the cluster, I2D, and biology questions; Yun, for text mining and very helpful ideas; Richard, for getting me through many computer crashes; Christian, for keeping the cluster going despite my repeated attempts to crash it; Ali, Dave, and Wing, for lots of Navigator help; Adrian, Attila, and Frederic for help with I2D; Elize, for great solidarity and support; Anthony for JavaScript help; Amira, Chiara, Fiona, and Periklis, for lots of help with slides and biology; Sara and Serene, for encouragement and reviewing ideas; Mahima and Dene for great discussions and debates. And of course family, for incredible support – no thesis without them. iv Contents 1 Introduction 1 1.1 Mapping the human interactome . 1 1.2 Types of PPIs . 4 1.3 Experimental PPI Identification Methods . 5 1.3.1 Small-scale screens . 5 1.3.2 HTP screens . 5 1.4 Computational PPI Identification Methods . 8 1.4.1 Methods using genomic analysis . 9 1.4.2 Methods using protein primary structure . 9 1.4.3 Methods using protein domains . 10 1.4.4 Methods using protein tertiary structure . 11 1.4.5 Methods analyzing interaction networks . 12 1.4.6 Methods using data integration . 12 1.5 PPIs networks and phenotype . 13 1.6 Summary of Research Contributions . 15 1.6.1 Chapter 2 . 15 1.6.2 Chapter 3 . 15 1.6.3 Chapter 4 . 15 2 Predicting human PPIs using non-independent features 17 v 2.1 Introduction . 18 2.2 Results . 23 2.2.1 Complementarity of computational and HTP experimental methods 23 2.2.2 False discovery rates of predictions . 25 2.2.3 Coverage of predicted networks . 28 2.2.4 Evidence for novel predicted PPIs . 33 2.3 Discussion . 37 2.3.1 Evaluating predictions . 37 2.3.2 Using predictive features in novel ways . 38 2.3.3 Predicting interactions of disease genes . 40 2.4 Methods . 43 2.4.1 Predicting interactions . 43 2.4.2 Calculating enrichment of PPI sets among predictions . 45 2.5 Supplemental Materials and Methods . 46 2.5.1 Links to data tables . 46 2.5.2 Datasets . 46 2.5.3 Prediction overview . 47 2.5.4 Features of individual proteins: description and sources . 48 2.5.5 Calculating interaction scores from features of individual proteins 49 2.5.6 Features of protein pairs . 55 2.5.7 Score integration . 57 3 Predicting Transient PPIs From Gene Co-expression 58 3.1 Introduction . 60 3.2 Results . 65 3.2.1 Correlation distributions of stably and transiently interacting pro- teins have significant differences . 65 vi 3.2.2 Transient interactions have significantly lower correlations than stable interactions . 67 3.2.3 Predictions of PPIs from gene co-expression are improved by con- sidering local information . 68 3.2.4 Mixed approach improves recall of different interaction types . 73 3.2.5 Mixed and local approaches work best when expression datasets have genes with high variance . 75 3.3 Discussion . 77 3.4 Conclusions . 79 3.5 Methods . 80 3.5.1 Selection of gene expression datasets . 80 3.5.2 Processing of gene expression datasets . 80 3.5.3 Transient and stable interactions . 81 3.5.4 Transiently and stably interacting proteins . 81 3.5.5 Selection of protein pairs for test sets . 81 3.5.6 Testing for significant differences in correlation distribution tails . 82 3.5.7 Interaction prediction approaches . 83 3.5.8 Calculating significance of performance differences . 84 3.5.9 Selection of functional categories . 85 3.5.10 Software . 85 3.6 Supplemental Materials . 86 3.6.1 Links to data tables . 86 4 Predicting Essential Mouse Genes 87 4.1 Introduction . 88 4.2 Results . 90 4.2.1 Defining essential and non-essential mouse genes . 90 4.2.2 Identifying features related to essentiality . 91 vii 4.2.3 Key features of essential genes . 96 4.2.4 Differences among essential genes . 99 4.2.5 Predicting essential genes . 101 4.3 Discussion . 103 4.3.1 Features from gene expression . 105 4.3.2 Features based on gene and protein sequence . 106 4.3.3 Networks and essentiality . 109 4.4 Conclusions . 111 4.5 Methods . 112 4.5.1 Gene phenotypes . 112 4.5.2 Gene expression . 112 4.5.3 Gene co-expression networks . 114 4.5.4 PPI networks . 117 4.5.5 Gene length . 118 4.5.6 Gene Ontology . 118 4.5.7 Ortholog information . 118 4.5.8 Protein structure . 119 4.5.9 Protein disorder . 119 4.5.10 Sequence biases . 119 4.5.11 Assessing relationships between predictive variables and essentiality 120 4.5.12 Identifying non-redundant predictive features . 121 4.5.13 Identifying significant differences between different types of essen- tial genes . 123 4.5.14 Predicting essential genes . 123 4.6 Supplemental Materials . 123 4.6.1 Links to data tables . 123 viii 5 Discussion 125 5.1 FpClass: extending coverage of the human interactome . 126 5.1.1 Contributions and limitations . 127 5.2 Mixed co-expression: identifying transient interactions and interaction context . 129 5.2.1 Contributions and limitations . 130 5.3 Characterizing and predicting essential mouse genes . 131 5.3.1 Contributions and Limitations . 132 5.4 Future improvements to introduced methods . 133 5.5 Future applications of methods and results . 135 5.5.1 Prediction of pathways and functional modules . 135 5.5.2 Prediction of protein function . 135 5.5.3 Prediction of disease genes . 136 5.5.4 Identification of module regulators . 136 5.6 Conclusions . 136 Bibliography 138 ix Abbreviations AUC Area under receiver operating characteristic (ROC) CDS Coding sequence DIP Database of Interacting Proteins false positives FDR False discovery rate (= false positives + true positives ) false positives FPR False positive.
Recommended publications
  • Gene Prediction and Genome Annotation
    A Crash Course in Gene and Genome Annotation Lieven Sterck, Bioinformatics & Systems Biology VIB-UGent [email protected] ProCoGen Dissemination Workshop, Riga, 5 nov 2013 “Conifer sequencing: basic concepts in conifer genomics” “This Project is financially supported by the European Commission under the 7th Framework Programme” Genome annotation: finding the biological relevant features on a raw genomic sequence (in a high throughput manner) ProCoGen Dissemination Workshop, Riga, 5 nov 2013 Thx to: BSB - annotation team • Lieven Sterck (Ectocarpus, higher plants, conifers, … ) • Yao-cheng Lin (Fungi, conifers, …) • Stephane Rombauts (green alga, mites, …) • Bram Verhelst (green algae) • Pierre Rouzé • Yves Van de Peer ProCoGen Dissemination Workshop, Riga, 5 nov 2013 Annotation experience • Plant genomes : A.thaliana & relatives (e.g. A.lyrata), Poplar, Physcomitrella patens, Medicago, Tomato, Vitis, Apple, Eucalyptus, Zostera, Spruce, Oak, Orchids … • Fungal genomes: Laccaria bicolor, Melampsora laricis- populina, Heterobasidion, other basidiomycetes, Glomus intraradices, Pichia pastoris, Geotrichum Candidum, Candida ... • Algal genomes: Ostreococcus spp, Micromonas, Bathycoccus, Phaeodactylum (and other diatoms), E.hux, Ectocarpus, Amoebophrya … • Animal genomes: Tetranychus urticae, Brevipalpus spp (mites), ... ProCoGen Dissemination Workshop, Riga, 5 nov 2013 Why genome annotation? • Raw sequence data is not useful for most biologists • To be meaningful to them it has to be converted into biological significant knowledge
    [Show full text]
  • Gene Structure Prediction
    Gene finding Lorenzo Cerutti Swiss Institute of Bioinformatics EMBNet course, September 2002 Gene finding EMBNet 2002 Introduction Gene finding is about detecting coding regions and infer gene structure Gene finding is difficult DNA sequence signals have low information content (degenerated and highly unspe- • cific) It is difficult to discriminate real signals • Sequencing errors • Prokaryotes High gene density and simple gene structure • Short genes have little information • Overlapping genes • Eukaryotes Low gene density and complex gene structure • Alternative splicing • Pseudo-genes • 1 Gene finding EMBNet 2002 Gene finding strategies Homology method Gene structure can be deduced by homology • Requires a not too distant homologous sequence • Ab initio method Requires two types of information • . compositional information . signal information 2 Gene finding EMBNet 2002 Gene finding: Homology method 3 Gene finding EMBNet 2002 Homology method Principles of the homology method. Coding regions evolve slower than non-coding regions, i.e. local sequence similarity • can be used as a gene finder. Homologous sequences reflect a common evolutionary origin and possibly a common • gene structure, i.e. gene structure can be solved by homology (mRNAs, ESTs, proteins, domains). Standard homology search methods can be used (BLAST, Smith-Waterman, ...). • Include ”gene syntax” information (start/stop codons, ...). • Homology methods are also useful to confirm predictions inferred by other methods 4 Gene finding EMBNet 2002 Homology method: a simple view Gene of unknown structure Homology with a gene of known structure Exon 1 Exon 2 Exon 3 Find DNA signals ATG GT {TAA,TGA,TAG} AG 5 Gene finding EMBNet 2002 Procrustes Procrustes is a software to predict gene structure from homology found in pro- teins (Gelfand et al., 1996) Principle of the algorithm • .
    [Show full text]
  • A Curated Benchmark of Enhancer-Gene Interactions for Evaluating Enhancer-Target Gene Prediction Methods
    University of Massachusetts Medical School eScholarship@UMMS Open Access Articles Open Access Publications by UMMS Authors 2020-01-22 A curated benchmark of enhancer-gene interactions for evaluating enhancer-target gene prediction methods Jill E. Moore University of Massachusetts Medical School Et al. Let us know how access to this document benefits ou.y Follow this and additional works at: https://escholarship.umassmed.edu/oapubs Part of the Bioinformatics Commons, Computational Biology Commons, Genetic Phenomena Commons, and the Genomics Commons Repository Citation Moore JE, Pratt HE, Purcaro MJ, Weng Z. (2020). A curated benchmark of enhancer-gene interactions for evaluating enhancer-target gene prediction methods. Open Access Articles. https://doi.org/10.1186/ s13059-019-1924-8. Retrieved from https://escholarship.umassmed.edu/oapubs/4118 Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 License. This material is brought to you by eScholarship@UMMS. It has been accepted for inclusion in Open Access Articles by an authorized administrator of eScholarship@UMMS. For more information, please contact [email protected]. Moore et al. Genome Biology (2020) 21:17 https://doi.org/10.1186/s13059-019-1924-8 RESEARCH Open Access A curated benchmark of enhancer-gene interactions for evaluating enhancer-target gene prediction methods Jill E. Moore, Henry E. Pratt, Michael J. Purcaro and Zhiping Weng* Abstract Background: Many genome-wide collections of candidate cis-regulatory elements (cCREs) have been defined using genomic and epigenomic data, but it remains a major challenge to connect these elements to their target genes. Results: To facilitate the development of computational methods for predicting target genes, we develop a Benchmark of candidate Enhancer-Gene Interactions (BENGI) by integrating the recently developed Registry of cCREs with experimentally derived genomic interactions.
    [Show full text]
  • There Is a Lot of Research on Gene Prediction Methods
    LBNL #58992 Fungal Genomic Annotation Igor V. Grigoriev1, Diego A. Martinez2 and Asaf A. Salamov1 1US Department of Energy Joint Genome Institute, Walnut Creek, CA 94598 ([email protected], [email protected]); 2Los Alamos National Laboratory Joint Genome Institute, P.O. Box 1663 Los Alamos, NM 87545 ([email protected]). Sequencing technology in the last decade has advanced at an incredible pace. Currently there are hundreds of microbial genomes available with more still to come. Automated genome annotation aims to analyze this amount of sequence data in a high-throughput fashion and help researches to understand the biology of these organisms. Manual curation of automatically annotated genomes validates the predictions and set up 'gold' standards for improving the methodologies used. Here we review the methods and tools used for annotation of fungal genomes in different genome sequencing centers. 1. INTRODUCTION In recent years the power of DNA sequencing has dramatically increased, with dedicated centers running 24 hours a day 7 days a week able to produce as much as 2 gigabases of raw sequence or more a month. The researchers who work on a variety of fungi are fortunate, as most fungal genomes are under 50 megabases and produce high- quality draft assembly almost as easily as bacteria. This feature of fungal genomes is a key reason that the first sequenced eukaryotic genome was of the ascomycete Saccharomyces cerevisiae (Goffeau et al. 1996). As of the submission of this chapter, one can obtain draft sequences of more than 100 fungal genomes (Table 1) and the list is growing. While some are species of the same genus (e.g., Aspergillus has three members and more coming), there still remains a height of data that could confuse and bury a researcher for many years.
    [Show full text]
  • Gene Prediction Using Deep Learning
    FACULDADE DE ENGENHARIA DA UNIVERSIDADE DO PORTO Gene prediction using Deep Learning Pedro Vieira Lamares Martins Mestrado Integrado em Engenharia Informática e Computação Supervisor: Rui Camacho (FEUP) Second Supervisor: Nuno Fonseca (EBI-Cambridge, UK) July 22, 2018 Gene prediction using Deep Learning Pedro Vieira Lamares Martins Mestrado Integrado em Engenharia Informática e Computação Approved in oral examination by the committee: Chair: Doctor Jorge Alves da Silva External Examiner: Doctor Carlos Manuel Abreu Gomes Ferreira Supervisor: Doctor Rui Carlos Camacho de Sousa Ferreira da Silva July 22, 2018 Abstract Every living being has in their cells complex molecules called Deoxyribonucleic Acid (or DNA) which are responsible for all their biological features. This DNA molecule is condensed into larger structures called chromosomes, which all together compose the individual’s genome. Genes are size varying DNA sequences which contain a code that are often used to synthesize proteins. Proteins are very large molecules which have a multitude of purposes within the individual’s body. Only a very small portion of the DNA has gene sequences. There is no accurate number on the total number of genes that exist in the human genome, but current estimations place that number between 20000 and 25000. Ever since the entire human genome has been sequenced, there has been an effort to consistently try to identify the gene sequences. The number was initially thought to be much higher, but it has since been furthered down following improvements in gene finding techniques. Computational prediction of genes is among these improvements, and is nowadays an area of deep interest in bioinformatics as new tools focused on the theme are developed.
    [Show full text]
  • "An Overview of Gene Identification: Approaches, Strategies, and Considerations"
    An Overview of Gene Identification: UNIT 4.1 Approaches, Strategies, and Considerations Modern biology has officially ushered in a new era with the completion of the sequencing of the human genome in April 2003. While often erroneously called the “post-genome” era, this milestone truly marks the beginning of the “genome era,” a time in which the availability of sequence data for many genomes will have a significant effect on how science is performed in the 21st century. While complete human sequence data is now available at an overall accuracy of 99.99%, the mere availability of all of these As, Cs, Ts, and Gs still does not answer some of the basic questions regarding the human genome—how many genes actually comprise the genome, how many of these genes code for multiple gene products, and where those genes actually lie along the complement of human chromosomes. Current estimates, based on preliminary analyses of the draft sequence, place the number of human genes at ∼30,000 (International Human Genome Sequencing Consortium, 2001). This number is in stark contrast to previously-suggested estimates, which had ranged as high as 140,000. A number that is in the 30,000 range brings into question the one-gene, one-protein hypothesis, underscoring the importance of processes such as alternative splicing in the generation of multiple gene products from a single gene. Finding all of the genes and the positions of those genes within the human genome sequence—and in other model organism genome sequences as well—requires the devel- opment and application of robust computational methods, some of which are listed in Table 4.1.1.
    [Show full text]
  • A Benchmark Study of Ab Initio Gene Prediction Methods in Diverse Eukaryotic Organisms
    A benchmark study of ab initio gene prediction methods in diverse eukaryotic organisms Nicolas Scalzitti Laboratoire ICube Anne Jeannin-Girardon Laboratoire ICube https://orcid.org/0000-0003-4691-904X Pierre Collet Laboratoire ICube Olivier Poch Laboratoire ICube Julie Dawn Thompson ( [email protected] ) Laboratoire ICube https://orcid.org/0000-0003-4893-3478 Research article Keywords: genome annotation, gene prediction, protein prediction, benchmark study. Posted Date: March 3rd, 2020 DOI: https://doi.org/10.21203/rs.2.19444/v2 License: This work is licensed under a Creative Commons Attribution 4.0 International License. Read Full License Version of Record: A version of this preprint was published on April 9th, 2020. See the published version at https://doi.org/10.1186/s12864-020-6707-9. 1 A benchmark study of ab initio gene prediction 2 methods in diverse eukaryotic organisms 3 Nicolas Scalzitti1, Anne Jeannin-Girardon1, Pierre Collet1, Olivier Poch1, Julie D. 4 Thompson1* 5 6 1 Department of Computer Science, ICube, CNRS, University of Strasbourg, Strasbourg, France 7 *Corresponding author: 8 Email: [email protected] 9 10 Abstract 11 Background: The draft genome assemblies produced by new sequencing technologies 12 present important challenges for automatic gene prediction pipelines, leading to less accurate 13 gene models. New benchmark methods are needed to evaluate the accuracy of gene prediction 14 methods in the face of incomplete genome assemblies, low genome coverage and quality, 15 complex gene structures, or a lack of suitable sequences for evidence-based annotations. 16 Results: We describe the construction of a new benchmark, called G3PO (benchmark for 17 Gene and Protein Prediction PrOgrams), designed to represent many of the typical challenges 18 faced by current genome annotation projects.
    [Show full text]
  • Bioinformatics: a Practical Guide to the Analysis of Genes and Proteins, Second Edition Andreas D
    BIOINFORMATICS A Practical Guide to the Analysis of Genes and Proteins SECOND EDITION Andreas D. Baxevanis Genome Technology Branch National Human Genome Research Institute National Institutes of Health Bethesda, Maryland USA B. F. Francis Ouellette Centre for Molecular Medicine and Therapeutics Children’s and Women’s Health Centre of British Columbia University of British Columbia Vancouver, British Columbia Canada A JOHN WILEY & SONS, INC., PUBLICATION New York • Chichester • Weinheim • Brisbane • Singapore • Toronto BIOINFORMATICS SECOND EDITION METHODS OF BIOCHEMICAL ANALYSIS Volume 43 BIOINFORMATICS A Practical Guide to the Analysis of Genes and Proteins SECOND EDITION Andreas D. Baxevanis Genome Technology Branch National Human Genome Research Institute National Institutes of Health Bethesda, Maryland USA B. F. Francis Ouellette Centre for Molecular Medicine and Therapeutics Children’s and Women’s Health Centre of British Columbia University of British Columbia Vancouver, British Columbia Canada A JOHN WILEY & SONS, INC., PUBLICATION New York • Chichester • Weinheim • Brisbane • Singapore • Toronto Designations used by companies to distinguish their products are often claimed as trademarks. In all instances where John Wiley & Sons, Inc., is aware of a claim, the product names appear in initial capital or ALL CAPITAL LETTERS. Readers, however, should contact the appropriate companies for more complete information regarding trademarks and registration. Copyright ᭧ 2001 by John Wiley & Sons, Inc. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic or mechanical, including uploading, downloading, printing, decompiling, recording or otherwise, except as permitted under Sections 107 or 108 of the 1976 United States Copyright Act, without the prior written permission of the Publisher.
    [Show full text]
  • Progress in Gene Prediction: Principles and Challenges Srabanti Maji and Deepak Garg*
    Send Orders of Reprints at [email protected] Current Bioinformatics, 2013, 8, 000-000 1 Progress in Gene Prediction: Principles and Challenges Srabanti Maji and Deepak Garg* Department of Computer Science and Engineering, Thapar University, Patiala-147004, India Abstract: Bioinformatics is a promising and innovative research field in 21st century. Automatic gene prediction has been an actively researched field of bioinformatics. Despite a high number of techniques specifically dedicated to bioinformatics problems as well as many successful applications, we are in the beginning of a process to massively integrate the aspects and experiences in the different core subjects such as biology, medicine, computer science, engineering, chemistry, physics, and mathematics. Presently, a large number of gene identification tools are based on computational intelligence approaches. Here, we have discussed the existing conventional as well as computational methods to identify gene(s) and various gene predictors are compared. The paper includes some drawbacks of the presently available methods and also, the probable guidelines for future directions are discussed. Keywords: Bioinformatics, gene identification, DNA, content sensor, splice site, dynamic programming, neural networks, SVM. 1. INTRODUCTION identification in eukaryotic organisms, their advantages as well as the limitations [14-16]. A large number of gene In the field of bioinformatics, gene identification from identification tools are available publicly in the Web site large DNA sequence is known to be a significant setback. http://www.nslij-genetics.org/gene/. A new algorithm for The human genome project was completed in April 2003, the gene identification, CONTRAST is also studied and reported exact number of genes encoded by the human genome is still [17].
    [Show full text]
  • PATTERNS of DIPEPTIDE USAGE for GENE PREDICTION a Thesis
    PATTERNS OF DIPEPTIDE USAGE FOR GENE PREDICTION A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Engineering By DAYANANDA SAGAR GANGADHARAIAH B.E., Visvesvaraya Technological University, 2005 2010 Wright State University WRIGHT STATE UNIVERSITY SCHOOL OF GRADUATE STUDIES July 2, 2010 I HEREBY RECOMMEND THAT THE THESIS PREPARED UNDER MY SUPERVISION BY Dayananda Sagar Gangadharaiah ENTITLED Patterns of Dipeptide usage for gene prediction BE ACCEPTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Master of Science in Computer Engineering. Travis E. Doom, Ph.D. Thesis Director Thomas Sudkamp, Ph.D. Department Chair Committee on Final Examination Travis E. Doom, Ph.D. Michael L. Raymer, Ph.D. Sridhar Ramachandran, Ph.D. John A. Bantle, Ph.D. Interim Dean, School of Graduate Studies DEDICATED TO MOTHER SHARADAMBE- THE GODDESS OF KNOWLEDGE ABSTRACT Dayananda Sagar Gangadharaiah. M.S.C.E., Department of Computer Science and Engineering, Wright State University, 2010. Patterns of dipeptide usage for gene prediction. As the number of complete genomes that have been sequenced continues to grow rapidly, the identification of genes regions in DNA sequence data remains one of the most important open problems in bio-informatics. Improving the accuracy of such gene finding tools by a small percentage would affect accurate predictions of many genes of an organism (Zhu et al., 2010). This thesis presents a novel approach for identifying coding regions of a genome based on dipeptide usage. The patterns in dipeptide usage are used to discriminate between coding and non-coding DNA regions. Two sample T-tests are used as tests of significance to determine the dipeptides that show significant difference in their occurrences in coding and non-coding regions.
    [Show full text]
  • Bioinformatics Is a New Discipline That Addresses the Need to Manage and Interpret the Data That in the Past Decade Was Massively Generated by Genomic Research
    SABU M. THAMPI Assistant Professor Dept. of CSE LBS College of Engineering Kasaragod, Kerala-671542 [email protected] Introduction Bioinformatics is a new discipline that addresses the need to manage and interpret the data that in the past decade was massively generated by genomic research. This discipline represents the convergence of genomics, biotechnology and information technology, and encompasses analysis and interpretation of data, modeling of biological phenomena, and development of algorithms and statistics. Bioinformatics is by nature a cross-disciplinary field that began in the 1960s with the efforts of Margaret O. Dayhoff, Walter M. Fitch, Russell F. Doolittle and others and has matured into a fully developed discipline. However, bioinformatics is wide-encompassing and is therefore difficult to define. For many, including myself, it is still a nebulous term that encompasses molecular evolution, biological modeling, biophysics, and systems biology. For others, it is plainly computational science applied to a biological system. Bioinformatics is also a thriving field that is currently in the forefront of science and technology. Our society is investing heavily in the acquisition, transfer and exploitation of data and bioinformatics is at the center stage of activities that focus on the living world. It is currently a hot commodity, and students in bioinformatics will benefit from employment demand in government, the private sector, and academia. With the advent of computers, humans have become ‘data gatherers’, measuring every aspect of our life with inferences derived from these activities. In this new culture, everything can and will become data (from internet traffic and consumer taste to the mapping of galaxies or human behavior).
    [Show full text]
  • Gnomon – NCBI Eukaryotic Gene Prediction Tool
    Gnomon – NCBI eukaryotic gene prediction tool A. Souvorov ,∗ Y. Kapustin, B. Kiryutin, V. Chetvernin, T. Tatusova, and D. Lipman National Center for Biotechnology Information, Bethesda MD February 25, 2010 ∗To whom correspondence should be addressed. 1 1 Methods NCBI gene prediction is a combination of homology searching with ab initio modeling. The use of ab initio is threefold: a) we use ab initio scores for evaluating the alignments and locating the optimal CDS in the alignments, b) in the case when we have a partial alignment we extend this alignment using the ab initio prediction, and c) when there is no experimental information we make an ab initio model. This process produces the gene models that could be classified as completely supported, part ia lly supported or not supported at all. The general philosophy behind this process is that we strongly prefer to use experimental information whenever it is available. Before we start a genome annotation we collect several data sets. First we collect all available cDNA for the studied organism and sometimes the cDNA for closely related organisms. Then we generate a Target protein set and a Search protein set. The former is a collection of the proteins that we believe should be found on the genome. Usually it includes all known proteins for the studied organism and several sets of known proteins for well-studied genomes. The latter set is a much wider collection of eukaryotic proteins. We try to align on the genome all proteins from the Target P r o t e i n S e t .
    [Show full text]