The Language of genes Su Dong Kim Biointelligence Lab.

Slides:



Advertisements
Similar presentations
Chapter Chapter Summary Languages and Grammars Finite-State Machines with Output Finite-State Machines with No Output Language Recognition Turing.
Advertisements

1 Linguistics and translation theory Mark Shuttleworth Teaching Translation Swansea, 20 January 2006.
Cognitive Processes PSY 334 Chapter 11 – Language Structure.
Reconfigurable Computing S. Reda, Brown University Reconfigurable Computing (EN2911X, Fall07) Lecture 18: Application-Driven Hardware Acceleration (4/4)
Sónia Martins Bruno Martins José Cruz IGC, February 20 th, 2008.
(C) 2002, SNU Biointelligence Lab, Bioinformatic Quest for the Holy Grail: UG gene Su Dong Kim Biointelligence Lab. Interdisciplinary.
9/30/2004TCSS588A Isabelle Bichindaritz1 Introduction to Bioinformatics.
Comparative Genomics & Annotation The Foundation of Comparative Genomics The main methodological tasks of CG Annotation: Protein Gene Finding RNA Structure.
1 Introduction to Automata Theory Reading: Chapter 1.
People Graduates Rahul Satija - Footprinting and Statistical Alignment Joanna Davies - Integrative Genomics of Asthma Aziz Mithani - Comparison of Metabolic.
Evolution of Universal Grammar Pia Göser Universität Tübingen Seminar: Sprachevolution Dozent: Prof. Jäger
CSCI 6900/4900 Special Topics in Computer Science Automata and Formal Grammars for Bioinformatics Bioinformatics problems sequence comparison pattern/structure.
ARE THESE ALL BEARS? WHICH ONES ARE MORE CLOSELY RELATED?
Copyright © Curt Hill Languages and Grammars This is not English Class. But there is a resemblance.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 4.
CSA2050 Introduction to Computational Linguistics Lecture 1 What is Computational Linguistics?
AdvancedBioinformatics Biostatistics & Medical Informatics 776 Computer Sciences 776 Spring 2002 Mark Craven Dept. of Biostatistics & Medical Informatics.
Interactive Quiz Game Select the correct answer of each number. Click the letter that best answer to the questions below.
Probabilistic Context Free Grammars Grant Schindler 8803-MDM April 27, 2006.
Language Language - a system for combining symbols (such as words) so that an unlimited number of meaningful statements can be made for the purpose of.
CSC312 Automata Theory Lecture # 26 Chapter # 12 by Cohen Context Free Grammars.
Syntax.
(C) 2002, SNU Biointelligence Lab, Strategies for the development of a peptide computer Hubert Hug and Rainer Schuler Bioinformatics,
Ch 5. Language Change: A Preliminary Model 5.1 ~ 5.2 The Computational Nature of Language Learning and Evolution P. Niyogi 2006 Summarized by Kwonill,
TOPIC 7- EVIDENCE FOR THE THEORY OF EVOLUTION
BME435 BIOINFORMATICS.
Phylogeny and the Tree of Life
Chapter 14. Conclusions From “The Computational Nature of Language Learning and Evolution” Summarized by Seok Ho-Sik.
Genome Annotation (protein coding genes)
Molecular Evolution of PPHLN1 Gene in Relation to HERV-M Element
PSYC 206 Lifespan Development Bilge Yagmurlu.
An Introduction to Linguistics
Learning linguistic structure with simple and more complex recurrent neural networks Psychology February 2, 2017.
Biointelligence Laboratory, Seoul National University
Linguistics Linguistics can be defined as the scientific or systematic study of language. It is a science in the sense that it scientifically studies the.
PSYC 206 Lifespan Development Bilge Yagmurlu.
Copyright Pearson Prentice Hall
Genomics A Systematic Study of the Locations, Functions and Interactions of Many Genes at Once.
Introduction to Formal Languages
Course 1 Introduction to Formal Languages and Automata Theory (part 1)
What is linguistics?.
Stochastic Context-Free Grammars for Modeling RNA
Theory of Computation Theory of computation is mainly concerned with the study of how problems can be solved using algorithms.  Therefore, we can infer.
Formal Language Theory
Modern Evolutionary Classification Notes- Ch. 18.2
Exploring Cancer Incidence Rates:
Formal Language.
Algorithms for Biological Sequence Analysis
Stochastic Context-Free Grammars for Modeling RNA
Genomes and Their Evolution
Genome organization and Bioinformatics
Copyright Pearson Prentice Hall
Computational Biology Projects
Gene expression profiling diagnosis through DNA molecular computation
Subhayu Basu et al. , DNA8, (2002) MEC Seminar Su Dong Kim
LESSON 1 INTNRODUCTION HYE-JOO KWON, Ph.D /
Stochastic Context Free Grammars for RNA Structure Modeling
CS4705 Natural Language Processing
Relationship between Genotype and Phenotype
Natural Language Processing
Genetics, Evolutionary, and Behavior
CISC 467/667 Intro to Bioinformatics (Spring 2007) RNA secondary structure CISC667, S07, Lec19, Liao.
Generative Transformation
Learning linguistic structure with simple recurrent neural networks
HIDDEN MARKOV MODELS IN COMPUTATIONAL BIOLOGY
Copyright Pearson Prentice Hall
Copyright Pearson Prentice Hall
Chapter 18 Classification.
Copyright Pearson Prentice Hall
Reconfigurable Computing (EN2911X, Fall07)
Presentation transcript:

The Language of genes Su Dong Kim Biointelligence Lab. David D. Searls, Nature 420, 211-217 (2002) Su Dong Kim Biointelligence Lab. Interdisciplinary Program in Cognitive Science Seoul National University 27 MAY 2003 (C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Outline Introduction Mathematical linguistics and macromolecules Computational linguistics and genes Historical linguistics and evolution Literary linguistics and the genome (C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Introduction 1950s : ‘Modern era’ of Linguistics & Biology Linguistics Noam Chomsky Watson & Crick Universal Grammar Structure of DNA Formal Language Theory Molecular Biology (C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/

The Chomsky hierarchy and formal language theory (C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Mathematical linguistics and macromolecules Nucleic acid linguistics The language of RNA is at least context-free Natural languages seem to be beyond context-free Protein linguistics Grammar Operation Regular Concatenation Context-free Insertion Context sensitive Interleaving (C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Nucleic acid linguistics Grammar-style derivations of idealized versions of RNA structures : “She saw the man with telescope” a Stem b Branch c Pseudoknot d Attenuator (C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/

(C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/ Protein linguistics Protein domain arrangement and the Chomsky hierarchy a Context free ; Insertion b Context sensitive ; Interleaving (C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Computational linguistics and genes Computational biology string or words segment of a genome The Lexical Level Phonemes or Characters The Syntactic Level Grammar rules The Semantic Level Meaning The Pragmatic Level Context Colourless green ideas sleep furiously (C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/

History of gene-finding algorithms 1980s : The Lexical affair Oligonucleotide frequencies & periodicities Early 1990s : Lexical elements + Syntactic cast Gene grammar + general purpose parsor Advantages : alternative splicing & versatility Latter-day : Customized to a particular domain ‘Standard model’ gene structure hard-wired HMM (hidden Markov model) : GenScan & Genie HMM algorithm tRNA secondary structure Regular grammar Non-regular grammar (C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Historical linguistics and evolution Evolution of Languages & Species Different languages Different species Meme, cognates Gene, orthologues Glottochronology Evolutionary ‘Molecular clock’ Blending, Creolization Recombination, Mutation Noun + noun, Idioms Protein–protein interaction, Participation in Pathways (C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/

Literary linguistics and the genome Pfam protein domain of the yeast vs. the words in Romeo and Juliet Textual Criticism Bioinformatics (C) 2003, SNU Biointelligence Lab, http://bi.snu.ac.kr/