DOCSLIB.ORG

Applications of Case-Based Reasoning in Molecular Biology

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Applications of Case-Based Reasoning in Molecular Biology Articles Applications of Case-Based Reasoning in Molecular Biology Igor Jurisica and Janice Glasgow ■ Case-based reasoning (CBR) is a computational problems by recalling old problems and their reasoning paradigm that involves the storage and solutions and adapting these previous experi- retrieval of past experiences to solve novel prob- ences represented as cases. A case generally lems. It is an approach that is particularly relevant comprises an input problem, an output solu- in scientific domains, where there is a wealth of data but often a lack of theories or general princi- tion, and feedback in terms of an evaluation of ples. This article describes several CBR systems that the solution. CBR is founded on the premise have been developed to carry out planning, analy- that similar problems have similar solutions. sis, and prediction in the domain of molecular bi- Thus, one of the primary goals of a CBR system ology. is to find the most similar, or most relevant, cases for new input problems. The effective- ness of CBR depends on the quality and quan- tity of cases in a case base. In some domains, even a small number of cases provide good so- lutions, but in other domains, an increased number of unique cases improves problem- he domain of molecular biology can be solving capabilities of CBR systems because characterized by substantial amounts of there are more experiences to draw on. Howev- Tcomplex data, many unknowns, a lack of er, larger case bases can also decrease the effi- complete theories, and rapid evolution; rea- ciency of a system. The reader can find detailed soning is often based on experience rather descriptions of the CBR process and systems in than general knowledge. Experts remember Kolodner (1993). More recent research direc- positive experiences for possible reuse of solu- tions are presented in Leake (1996), and prac- tions; negative experiences are used to avoid tically oriented descriptions of CBR can be potentially unsuccessful outcomes. Similar to found in Bergman et al. (1999) and Watson other scientific domains, problem solving in (1997). molecular biology can benefit from systematic The remainder of this article describes sever- knowledge management using techniques al CBR systems that have been developed to from AI. Case-based reasoning (CBR) is partic- address problems in molecular biology. We be- ularly applicable to this problem domain be- gin with a description of a recent CBR system cause it (1) supports rich and evolvable repre- for planning protein-crystallization experi- sentation of experiences—problems, solutions, ments, followed by summaries of earlier CBR and feedback; (2) provides efficient and flexible systems for gene finding, knowledge discovery ways to retrieve these experiences; and (3) ap- in a sequence database, and protein- structure plies analogical reasoning to solve novel prob- determination. We conclude with a discussion lems. of issues related to the application of CBR in CBR is a paradigm that involves solving new the domain. Copyright © 2004, American Association for Artificial Intelligence. All rights reserved. 0738-4602-2004 / $2.00 SPRING 2004 85 Articles CBR and Protein Crystallization growth that are effective in many settings. For example, Jancarik and Kim (1991) proposed a One of the fundamental challenges in modern set of 48 agents that are often used during crys- molecular biology is the elucidation and un- tallization. Although advances have been made derstanding of the laws by which proteins through practical experience, a need remains adopt their three-dimensional structure. Pro- for systematic and principled studies to im- teins are involved in every biochemical process prove our deep understanding of the crystal- that maintains life in a living organism. lization process and provide a basis for the Through an increased understanding of pro- planning of successful new experiments. One tein structure, we gain insight into the func- of the difficulties in planning crystal growth ex- tions of these important molecules. Currently, periments is that “the history of experiments is the most powerful method for protein-struc- not well known, because crystal growers do not ture determination is single-crystal X-ray dif- monitor parameters” (Ducruix and Giege 1992, fraction, although new breakthroughs in nu- p. 14). One recent approach attempted to opti- clear magnetic resonance (NMR) (Kim and mize the 48-agent screen from crystallization Szyperski 2003) and in silico (Bysrtoff and Shao data on 755 different proteins (Kimber et al. 2002) approaches are growing in their impor- 2003). Not surprisingly, the study showed that tance. A crystallography experiment begins one can eliminate certain conditions (in this with a well-formed crystal that ideally diffracts case, 9) and still not lose any crystal or use only X-rays to high resolution. For proteins, this 6 conditions and still detect crystals for 338 process is often limited by the difficulty of proteins (60.6 percent). These results are en- growing crystals suitable for diffraction, which couraging. However, proteins have different is partially the result of the large number of pa- properties, and thus, the selection of more or rameters affecting the crystallization outcome less useful crystallizing conditions might never (such as purity of proteins, intrinsic physico- be universal across all proteins. In addition, chemical, biochemical, biophysical, and bio- when a particular condition produces differen- logical parameters) and the unknown correla- tial results across many proteins, it still might tions between the variation of a parameter and provide valuable information. the propensity for a given macromolecule to The BIOLOGICAL MACROMOLECULAR CRYSTALLIZA- crystallize. The CBR system described in this section ad- TION DATABASE (BMCD) (Gilliland, Tung, and Lad- dresses the problem of planning for a novel ner 2002) stores data from published crystal- protein-crystallization experiment. The poten- lization papers (positive examples of successful tial impact of such a system is far reaching: Ac- plans for growing crystals), including informa- celerating the process of crystallization implies tion about the macromolecule itself, the crys- an increased knowledge of protein structure, tallization methods used, and the crystal data. which is critical to medicine, drug design, and Attempts have been made to apply statistical enzyme studies and to a more complete under- and machine learning techniques to the BMCD. standing of fundamental molecular biology. These efforts include approaches that use clus- ter analysis (Farr, Peryman, and Samuzdi 1998), Protein Crystallization inductive learning (Hennessy et al. 1994), and Conceptually, protein crystal growth can be di- correlation analysis combined with a Bayesian vided into two phases: (1) search and (2) opti- technique (Hennessy et al. 2000) to extract mization. Approximate crystallization condi- knowledge from the database. Previous studies tions are identified during the search phase, were limited because negative results are not but the optimization phase varies these condi- reported in the database and because many tions to ultimately yield high-quality crystals. crystallization experiments are not repro- Improving these phases can lead to accelerated ducible because of an incomplete method de- protein-structure determination and function scription, missing details, or erroneous data resolution. Optimally, discovering the princi- (which is the result of often skimpy and vague ples of crystal growth will eliminate protein primary literature). Consequently, the BMCD is crystallization as a bottleneck in modern struc- not currently being used in a strongly predic- tural biology. tive fashion. The crystallization of macromolecules is cur- Significant advancement in this field has re- rently primarily empirical. Because of its unpre- sulted from the use of high-throughput robotic dictability and high irreproducibility, it has setups for the search phase of crystal growth. been considered by some to be an art rather This advancement vastly increases the number than a science (Ducruix and Giege 1992) or an of conditions that can initially be tested and al- “exact art and subtle science.” Experience alone so improves reliability and systematicity for ap- has produced experimental protocols for crystal proximating conditions for crystallization in 86 AI MAGAZINE Articles the search phase. However, it also results in proteins. If we consider only 15 possible condi- thousands of initial crystallization experiments tions, each having 15 possible values, the result carried out daily that require expert evaluation would be 4.3789e+017 possible experiments. based on visual criteria. Thus, our CBR system Assume that 2 proteins react similarly when includes an image analysis subsystem that is tested against a large set (over 1,500) of precip- used to automatically classify the initial out- itating agents in the search phase of crystalliza- comes in the search phase. This classification tion. Then, the planning strategies successfully forms the basis for the similarity measure for used for the one can profitably be applied to CBR. We incorporate knowledge discovery the other. Thus, it is important to identify a tools to assist in the optimization and the un- suitable set of precipitating agents to sort the derstanding of the protein-crystallization outcomes of reactions for a relatively large process. group of proteins. New crystallization chal- lenges are then approached by the execution
Load more

Recommended publications
  • Functional Effects Detailed Research Plan
    GeCIP Detailed Research Plan Form Background The Genomics England Clinical Interpretation Partnership (GeCIP) brings together researchers, clinicians and trainees from both academia and the NHS to analyse, refine and make new discoveries from the data from the 100,000 Genomes Project. The aims of the partnerships are: 1. To optimise: • clinical data and sample collection • clinical reporting • data validation and interpretation. 2. To improve understanding of the implications of genomic findings and improve the accuracy and reliability of information fed back to patients. To add to knowledge of the genetic basis of disease. 3. To provide a sustainable thriving training environment. The initial wave of GeCIP domains was announced in June 2015 following a first round of applications in January 2015. On the 18th June 2015 we invited the inaugurated GeCIP domains to develop more detailed research plans working closely with Genomics England. These will be used to ensure that the plans are complimentary and add real value across the GeCIP portfolio and address the aims and objectives of the 100,000 Genomes Project. They will be shared with the MRC, Wellcome Trust, NIHR and Cancer Research UK as existing members of the GeCIP Board to give advance warning and manage funding requests to maximise the funds available to each domain. However, formal applications will then be required to be submitted to individual funders. They will allow Genomics England to plan shared core analyses and the required research and computing infrastructure to support the proposed research. They will also form the basis of assessment by the Project’s Access Review Committee, to permit access to data.
    [Show full text]
  • Algorithms for Computational Biology 8Th International Conference, Alcob 2021 Missoula, MT, USA, June 7–11, 2021 Proceedings
    Lecture Notes in Bioinformatics 12715 Subseries of Lecture Notes in Computer Science Series Editors Sorin Istrail Brown University, Providence, RI, USA Pavel Pevzner University of California, San Diego, CA, USA Michael Waterman University of Southern California, Los Angeles, CA, USA Editorial Board Members Søren Brunak Technical University of Denmark, Kongens Lyngby, Denmark Mikhail S. Gelfand IITP, Research and Training Center on Bioinformatics, Moscow, Russia Thomas Lengauer Max Planck Institute for Informatics, Saarbrücken, Germany Satoru Miyano University of Tokyo, Tokyo, Japan Eugene Myers Max Planck Institute of Molecular Cell Biology and Genetics, Dresden, Germany Marie-France Sagot Université Lyon 1, Villeurbanne, France David Sankoff University of Ottawa, Ottawa, Canada Ron Shamir Tel Aviv University, Ramat Aviv, Tel Aviv, Israel Terry Speed Walter and Eliza Hall Institute of Medical Research, Melbourne, VIC, Australia Martin Vingron Max Planck Institute for Molecular Genetics, Berlin, Germany W. Eric Wong University of Texas at Dallas, Richardson, TX, USA More information about this subseries at http://www.springer.com/series/5381 Carlos Martín-Vide • Miguel A. Vega-Rodríguez • Travis Wheeler (Eds.) Algorithms for Computational Biology 8th International Conference, AlCoB 2021 Missoula, MT, USA, June 7–11, 2021 Proceedings 123 Editors Carlos Martín-Vide Miguel A. Vega-Rodríguez Rovira i Virgili University University of Extremadura Tarragona, Spain Cáceres, Spain Travis Wheeler University of Montana Missoula, MT, USA ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Bioinformatics ISBN 978-3-030-74431-1 ISBN 978-3-030-74432-8 (eBook) https://doi.org/10.1007/978-3-030-74432-8 LNCS Sublibrary: SL8 – Bioinformatics © Springer Nature Switzerland AG 2021 This work is subject to copyright.
    [Show full text]
  • Computational Biology and Bioinformatics
    Vol. 30 ISMB 2014, pages i1–i2 BIOINFORMATICS EDITORIAL doi:10.1093/bioinformatics/btu304 Editorial This special issue of Bioinformatics serves as the proceedings of The conference used a two-tier review system, a continuation the 22nd annual meeting of Intelligent Systems for Molecular and refinement of a process begun with ISMB 2013 in an effort Biology (ISMB), which took place in Boston, MA, July 11–15, to better ensure thorough and fair reviewing. Under the revised 2014 (http://www.iscb.org/ismbeccb2014). The official confer- process, each of the 191 submissions was first reviewed by at least ence of the International Society for Computational Biology three expert referees, with a subset receiving between four and (http://www.iscb.org/), ISMB, was accompanied by 12 Special eight reviews, as needed. These formal reviews were frequently Interest Group meetings of one or two days each, two satellite supplemented by online discussion among reviewers and Area meetings, a High School Teachers Workshop and two half-day Chairs to resolve points of dispute and reach a consensus on tutorials. Since its inception, ISMB has grown to be the largest each paper. Among the 191 submissions, 29 were conditionally international conference in computational biology and bioinfor- accepted for publication directly from the first round review Downloaded from matics. It is expected to be the premiere forum in the field for based on an assessment of the reviewers that the paper was presenting new research results, disseminating methods and tech- clearly above par for the conference. A subset of 16 papers niques and facilitating discussions among leading researchers, were viewed as potentially in the top tier but raised significant practitioners and students in the field.
    [Show full text]
  • BIOINFORMATICS ISCB NEWS Doi:10.1093/Bioinformatics/Btp280
    Vol. 25 no. 12 2009, pages 1570–1573 BIOINFORMATICS ISCB NEWS doi:10.1093/bioinformatics/btp280 ISMB/ECCB 2009 Stockholm Marie-France Sagot1, B.J. Morrison McKay2,∗ and Gene Myers3 1INRIA Grenoble Rhône-Alpes and University of Lyon 1, Lyon, France, 2International Society for Computational Biology, University of California San Diego, La Jolla, CA and 3Howard Hughes Medical Institute Janelia Farm Research Campus, Ashburn, Virginia, USA ABSTRACT Computational Biology (http://www.iscb.org) was formed to take The International Society for Computational Biology (ISCB; over the organization, maintain the institutional memory of ISMB http://www.iscb.org) presents the Seventeenth Annual International and expand the informational resources available to members of the Conference on Intelligent Systems for Molecular Biology bioinformatics community. The launch of ECCB (http://bioinf.mpi- (ISMB), organized jointly with the Eighth Annual European inf.mpg.de/conferences/eccb/eccb.htm) 8 years ago provided for a Conference on Computational Biology (ECCB; http://bioinf.mpi- focus on European research activities in years when ISMB is held inf.mpg.de/conferences/eccb/eccb.htm), in Stockholm, Sweden, outside of Europe, and a partnership of conference organizing efforts 27 June to 2 July 2009. The organizers are putting the finishing for the presentation of a single international event when the ISMB touches on the year’s premier computational biology conference, meeting takes place in Europe every other year. with an expected attendance of 1400 computer scientists, The multidisciplinary field of bioinformatics/computational mathematicians, statisticians, biologists and scientists from biology has matured since gaining widespread recognition in the other disciplines related to and reliant on this multi-disciplinary early days of genomics research.
    [Show full text]
  • Dear Delegates,History of Productive Scientific Discussions of New Challenging Ideas and Participants Contributing from a Wide Range of Interdisciplinary fields
    3rd IS CB S t u d ent Co u ncil S ymp os ium Welcome To The 3rd ISCB Student Council Symposium! Welcome to the Student Council Symposium 3 (SCS3) in Vienna. The ISCB Student Council's mis- sion is to develop the next generation of computa- tional biologists. We would like to thank and ac- knowledge our sponsors and the ISCB organisers for their crucial support. The SCS3 provides an ex- citing environment for active scientific discussions and the opportunity to learn vital soft skills for a successful scientific career. In addition, the SCS3 is the biggest international event targeted to students in the field of Computational Biology. We would like to thank our hosts and participants for making this event educative and fun at the same time. Student Council meetings have had a rich Dear Delegates,history of productive scientific discussions of new challenging ideas and participants contributing from a wide range of interdisciplinary fields. Such meet- We are very happy to welcomeings have you proved all touseful the in ISCBproviding Student students Council and postdocs Symposium innovative inputsin Vienna. and an Afterincreased the network suc- cessful symposiums at ECCBof potential 2005 collaborators. in Madrid and at ISMB 2006 in Fortaleza we are determined to con- tinue our efforts to provide an event for students and young researchers in the Computational Biology community. Like in previousWe ar yearse extremely our excitedintention to have is toyou crhereatee and an the opportunity vibrant city of Vforienna students welcomes to you meet to our their SCS3 event. peers from all over the world for exchange of ideas and networking.
    [Show full text]
  • ISMB/ECCB 2007: the Premier Conference on Computational Biology Thomas Lengauer, B
    MESSAGE FROM ISCB ISMB/ECCB 2007: The Premier Conference on Computational Biology Thomas Lengauer, B. J. Morrison McKay*, Burkhard Rost Two Societies Meet in ways to specifically encourage increased participation from The ISMB conference series was previously underrepresented kicked off in 1993 by the vision of David disciplines of computational biology. Searls (GlaxoSmithKline), Jude Shavlik The major challenge for this (University of Wisconsin Madison), and interdisciplinary field is that two Larry Hunter (University of Colorado). cultures with very different ways of A few years down the road, ISMB had publishing intersect at computational established itself as a primary event in biology meetings such as ISMB/ECCB: computational biology and triggered computational scientists publish their Introduction the founding of ISCB, the International most important results in rigorously Society for Computational Biology reviewed proceedings of meetings; the he International Society for (http://www.iscb.org). ISCB has been lower the ratio between accepted/ Computational Biology (ISCB) organizing the ISMB conference series submitted, the more valued the presents ISMB/ECCB 2007, the since 1998. While ISCB evolved into the T publication. In many cases, publication Fifteenth International Conference on only society representing in proceedings of conferences on Intelligent Systems for Molecular Biology computational biology globally, its computer science are valued more (ISMB 2007), held jointly with the Sixth flagship conference has become the highly than those in peer-reviewed European Conference on Computational largest annual forum focused on scientific journals. In contrast, life Biology (ECCB 2007) in Vienna, Austria, computational biology worldwide scientists publish their best work in July 21–25, 2007 (http://www.iscb.org/ (Table 1).
    [Show full text]
  • Computational Elucidation of the Regulatory Snps in the Non-Coding Regions of the Human Genome
    AN ABSTRACT OF THE DISSERTATION OF Yao Yao for the degree of Doctor of Philosophy in Computer Science presented on February 16, 2021. Title: Computational Elucidation of the Regulatory SNPs in the Non-Coding Regions of the Human Genome Abstract approved: Stephen Ramsey We describe a series of novel computational models, CERENKOV (Computational Elu- cidation of the REgulatory NonKOding Variome) and its successors CERENKOV2, CE- RENKOV3, and Convolutional CERENKOV3, for discriminating regulatory single nu- cleotide polymorphisms (rSNPs) from non-regulatory SNPs within non-coding genetic loci. The CERENKOV models are designed for recognizing rSNPs in the context of a post-analysis of a genome-wide association study (GWAS); they include a novel accu- racy scoring metric (average rank, or AVGRANK) and a novel cross-validation strategy (locus-based sampling) that both correctly account for the \sparse positive bag" nature of the GWAS post-analysis rSNP recognition problem. We trained and validated the CERENKOV series models using a set of reference SNPs whose composition is based on selection criteria (linkage disequilibrium and minor allele frequency) that we designed to ensure relevance to GWAS post-analysis. The CERENKOV models are based on a machine-learning algorithm (gradient boosted decision trees) incorporating various SNP annotation features that are from genomic, epigenomic, phylogenetic, and chromatin data. CERENKOV2 includes features based on the geometry of the annotation features in data-space, and the CERENKOV3 models include features derived from SNP clus- tering, molecular network and convolutional output on genomic signals. We compared the validation performance of CERENKOV to nine other methods for rSNP recognition (including GWAVA, RSVP, DeltaSVM, DeepSEA, EIGEN, and DANQ), and found that CERENKOV's validation performance is the strongest out of all of the classifiers that we tested, by both traditional global rank-based measures (AUPRC, AUROC) and AV- GRANK.
    [Show full text]
  • ISCB Honors Michael S. Waterman and Mathieu Blanchette Merry Maisel Ach Year, the International Fu¨ R Informatik and Chair of the ISCB Early 1970S
    Message From ISCB ISCB Honors Michael S. Waterman and Mathieu Blanchette Merry Maisel ach year, the International fu¨ r Informatik and chair of the ISCB early 1970s. In a memoir published on Society for Computational Awards Committee. ‘‘So much of our his Web site, Waterman has written: ‘‘I E Biology (ISCB) takes work is based on methods for finding was an innocent mathematician until nominations for its two major awards. sequence homology that, if we weren’t the summer of 1974. It was then that I met Temple Ferris Smith and for two An awards committee, composed of a constantly citing it, it would amaze us that the methodology was first devised months was cooped up with him in an group of current and past directors of only 25 years ago by Mike Waterman and office at Los Alamos. that the Society along with previous Temple Smith. Since then, Waterman experience transformed my research, recipients, evaluates the nominations developed the dynamic programming my life, and perhaps my sanity.’’ and selects the winners. In 2006, the approach to RNA structure prediction, Smith, now director of the awards committee honors two began the combinatorial study of RNA BioMolecular Engineering Research outstanding scientists. secondary structure, improved the Center at Boston University, was also statistical tests incorporated into BLAST visiting Los Alamos from a small Senior Scientist Accomplishment and related tools, and worked on the university in Michigan. Award: Michael S. Waterman assembly problem for genomes past and At Los Alamos, their fellow scientists present. He has also made important and friends included Stanslaw Ulam, contributions to phylogeny, tree Nick Metropolis, Marc Kac, and Gian- comparison, motif searching, cryptogene Carlo Rota, all towering names in analysis, parametric alignment, gapped computational science, at a time when alignment, optical mapping, haplotype the lab was a hotbed of intellectual estimation, gene family evolution, and a ferment.
    [Show full text]
  • 9783319129815.Pdf
    Pedro Mendes Joseph O. Dada Kieran Smallbone (Eds.) Computational Methods LNBI 8859 in Systems Biology 12th International Conference, CMSB 2014 Manchester, UK, November 17–19, 2014 Proceedings 123 Lecture Notes in Bioinformatics 8859 Subseries of Lecture Notes in Computer Science LNBI Series Editors Sorin Istrail Brown University, Providence, RI, USA Pavel Pevzner University of California, San Diego, CA, USA Michael Waterman University of Southern California, Los Angeles, CA, USA LNBI Editorial Board Alberto Apostolico Georgia Institute of Technology, Atlanta, GA, USA Søren Brunak Technical University of Denmark Kongens Lyngby, Denmark Mikhail S. Gelfand IITP, Research and Training Center on Bioinformatics, Moscow, Russia Thomas Lengauer Max Planck Institute for Informatics, Saarbrücken, Germany Satoru Miyano University of Tokyo, Japan Eugene Myers Max Planck Institute of Molecular Cell Biology and Genetics Dresden, Germany Marie-France Sagot Université Lyon 1, Villeurbanne, France David Sankoff University of Ottawa, Canada Ron Shamir Tel Aviv University, Ramat Aviv, Tel Aviv, Israel Terry Speed Walter and Eliza Hall Institute of Medical Research Melbourne, VIC, Australia Martin Vingron Max Planck Institute for Molecular Genetics, Berlin, Germany W. Eric Wong University of Texas at Dallas, Richardson, TX, USA Pedro Mendes Joseph O. Dada Kieran Smallbone (Eds.) Computational Methods in Systems Biology 12th International Conference, CMSB 2014 Manchester, UK, November 17-19, 2014 Proceedings 13 Volume Editors Pedro Mendes Joseph O. Dada Kieran Smallbone The University of Manchester, Manchester Institute of Biotechnology 131 Princess Street, Manchester M1 7DN, UK E-mail: {pedro.mendes, joseph.dada, kieran.smallbone}@manchester.ac.uk ISSN 0302-9743 e-ISSN 1611-3349 ISBN 978-3-319-12981-5 e-ISBN 978-3-319-12982-2 DOI 10.1007/978-3-319-12982-2 Springer Cham Heidelberg New York Dordrecht London Library of Congress Control Number: 2014952778 LNCS Sublibrary: SL 8 – Bioinformatics © Springer International Publishing Switzerland 2014 This work is subject to copyright.
    [Show full text]
  • CV Burkhard Rost
    Burkhard Rost CV BURKHARD ROST TUM Informatics/Bioinformatics i12 Boltzmannstrasse 3 (Rm 01.09.052) 85748 Garching/München, Germany & Dept. Biochemistry & Molecular Biophysics Columbia University New York, USA Email [email protected] Tel +49-89-289-17-811 Photo: © Eckert & Heddergott, TUM Web www.rostlab.org Fax +49-89-289-19-414 Document: CV Burkhard Rost TU München Affiliation: Columbia University TOC: • Tabulated curriculum vitae • Grants • List of publications Highlights by numbers: • 186 invited talks in 29 countries (incl. TedX) • 250 publications (187 peer-review, 168 first/last author) • Google Scholar 2016/01: 30,502 citations, h-index=80, i10=179 • PredictProtein 1st Internet server in mol. biol. (since 1992) • 8 years ISCB President (International Society for Computational Biology) • 143 trained (29% female, 50% foreigners from 32 nations on 6 continents) Brief narrative: Burkhard Rost obtained his doctoral degree (Dr. rer. nat.) from the Univ. of Heidelberg (Germany) in the field of theoretical physics. He began his research working on the thermo-dynamical properties of spin glasses and brain-like artificial neural networks. A short project on peace/arms control research sketched a simple, non-intrusive sensor networks to monitor aircraft (1988-1990). He entered the field of molecular biology at the European Molecular Biology Laboratory (EMBL, Heidelberg, Germany, 1990-1995), spent a year at the European Bioinformatics Institute (EBI, Hinxton, Cambridgshire, England, 1995), returned to the EMBL (1996-1998), joined the company LION Biosciences for a brief interim (1998), became faculty in the Medical School of Columbia University in 1998, and joined the TUM Munich to become an Alexander von Humboldt professor in 2009.
    [Show full text]
  • Workshop on Human Language Technology and Knowledge
    AI Magazine Volume 23 Number 2 (2002) (© AAAI) Workshop Reports Knowledge Media Institute at The Workshop on Human Open University in England, gave the keynote entitled “Supporting Organizational Learning through the Language Technology and Enrichment of Documents.” Accord- ing to Domingue, only a small per- Knowledge Management centage of corporate training is ever applied within the workplace because organizations tend to use school- based methods of learning in con- trast to organizational learning based Mark T. Maybury on theories of learning in the work- place. Domingue described knowl- edge sharing by enriching web docu- ments with informal and formal representations, a process that cap- tures the context in which a docu- The Workshop on Human Language technologies that could enable ment is created and applied. Technology and Knowledge Manage- knowledge management functions Domingue demonstrated how this ment was held on July 6 and 7 in such as the following: enrichment facilitates retrieval and Toulouse, France, in conjunction Expert discovery: Modeling, cata- comprehension. with the meeting of the Joint Associ- loging, and tracking of distributed In addition, the group heard an ation for Computational Linguistics organizations and communities of invited talk from Hans Uszkoreit and European Association for Com- experts (DFKI Saarbruecken), scientific direc- putational Linguistics (ACL / EACL Knowledge discovery: Identifica- tor at the German Research Center ’01). Human language technologies tion and classification of knowledge for Artificial Intelligence (DFKI), head promise solutions to challenges in from unstructured multimedia data of DFKI Language Technology Lab, human-computer interaction, infor- Knowledge sharing: Awareness of, and professor of computational lin- mation access, and knowledge man- and access to, enterprise expertise guistics at the Department of Com- agement.
    [Show full text]
  • Methods and Models for the Analysis of Biological Signifïcance Based on High-Throughput Data
    Methods and Models for the Analysis of Biological Signifïcance Based on High-Throughput Data Jose Luis Mosquera Mayo Aquesta tesi doctoral està subjecta a la llicència Reconeixement- NoComercial – CompartirIgual 3.0. Espanya de Creative Commons. Esta tesis doctoral está sujeta a la licencia Reconocimiento - NoComercial – CompartirIgual 3.0. España de Creative Commons. This doctoral thesis is licensed under the Creative Commons Attribution-NonCommercial- ShareAlike 3.0. Spain License. Methods and Models for the Analysis of Biological Significance Based on High Throughput Data Jose Luis Mosquera Mayo 2 Methods and Models for the Analysis of Biological Significance Based on High Throughput Data M`etodes i Models per a l’An`aliside la Significaci´oBiol`ogicaBasada en Dades d'Alt Rendiment Mem`oriapresentada per en Jose Luis Mosquera Mayo per optar al grau de doctor per la Universitat de Barcelona SIGNATURES El Doctorand: Jose Luis Mosquera Mayo El Director de la Tesi: Dr. Alexandre Sanchez´ Pla El Tutor de la Tesi: Dr. Josep Mar´ıa Oller Sala Programa de doctorat en estad´ıstica Departament d'Estad´ıstica,Facultat de Biologia Universitat de Barcelona 4 Acknowledgements \A teacher affects eternity, he can never tell where his influence stops." Henry Brooks Adams \Mathematicians do not study objects, but relations between objects." Jules Henri Poincar´e It is truly an honor for me to address these words of gratitude to everyone who has contributed, to a greater or lesser extent by supporting me during this exciting program of studies, to help make my lifelong dream come true: to complete my doctoral dissertation. First and foremost, I would like (and feel compelled) to mention a special debt of gratitude to Prof.
    [Show full text]