DOCSLIB.ORG

Apr 1 1 1996

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Apr 1 1 1996 Learning Algorithms with Applications to Robot Navigation and Protein Folding by Mona Singh S.M.. Computer Science Harvard University (1989) A.B., Computer Science Harvard University (1989) Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the S i j.ASACHUSTTIL OF TECHNOLOGY MASSACHUSETTS INSTITUTE OF TECHNOLOGY APR 1 11996 September 1995 LIBRARIES @ Massachusetts Institute of Technology 1995 Signature of Author t-mliatmeu u, I~-~Icaý r-ugineerng and Computer Science -tember, 1995 Certified by- '7 Ronald L. Rivest Professor of Computer Science Thesis Supervisor N-~L Certified by- Bonnie A. Berger Assistant Professor of Mathematics Thesis Supervisor Accepted by. Frederic R. Morgenthaler . ... i.littee on Graduate Students Learning Algorithms with Applications to Robot Navigation and Protein Folding by Mona Singh Submitted to the Department of Electrical Engineering and Computer Science on September, 1995, in partial fulfillment of the requirements for the degree of Doctor of Philosophy Abstract We consider three problems in machine learning: * concept learning in the PAC model * mobile robot environment learning * learning-based approaches to protein folding prediction In the PAC framework, we give an efficient algorithm for learning any function on k terms by general DNF. On the other hand, we show that in a well-studied restriction of the PAC model where the learner is not allowed to use a more expressive hypothesis (such as general DNF), learning most symmetric functions on k terms is NP-hard. In the area of mobile robot environment learning, we introduce the problem of piecemeal learn- ing an unknown environment. The robot must learn a complete map of its environment, while satisfying the constraint that periodically it has to return to its starting position (for refueling, say). For environments that can be modeled as grid graphs with rectangular obstacles, we give two piecemeal learning algorithms in which the robot traverses a linear number of edges. For more general environments that can be modeled as arbitrary undirected graphs, we give a nearly linear algorithm. The final part of the thesis applies machine learning to the problem of protein structure predic- tion. Most approaches to predicting local 3D structures, or motifs, are tailored towards motifs that are already well-studied by biologists. We give a learning algorithm that is particularly effective in situations where large numbers of examples of the motif are not known. These are precisely the situations that pose significant difficulties for previously known methods. We have implemented our algorithm and we demonstrate its performance on the coiled coil motif. Thesis Supervisor: Ronald L. Rivest, Professor of Computer Science Thesis Supervisor: Bonnie A. Berger, Assistant Professor of Mathematics Acknowledgements I thank my advisors Ron Rivest and Bonnie Berger for their ideas, help, and time. I have enjoyed working with each of them, and am grateful to them for all that they have taught me. Portions of this thesis are joint work with Ron and Bonnie, as well as with Margrit Betke, Avrim Blum, and Baruch Awerbuch. I am grateful to all of them for allowing me to include our joint work in this thesis. Thanks to David Johnson for encouraging me to go to graduate school, Shafi Goldwasser for being on my thesis committee, Albert Meyer for much good advice, and the teachers at Indian Springs School for having a continuing impact on my life. Thanks to Peter Kim, David Wilson and Ethan Wolf for help on the biology project. Thanks to the attendees of Ron's machine learning reading group for many helpful discussions. I am grateful to the National Science Foundation, Ron Rivest, Bonnie Berger, Baruch Awerbuch, Arvind, and CBCL for funding me at various points in my graduate career. Thanks to the Scott Bloomquist, David Jones and Bruce Dale for their help around MIT. Special thanks to Be Hubbard for interesting conversation, laughter, and much help. Thanks to all the members of the MIT theory group for providing such a wonderful envi- ronment. Special thanks to Margrit Betke for being my officemate and good friend for all these years. Thanks to Javed Aslam, Ruth Bergman, Avrim Blum, Lenore Cowen, Scott Decatur, Aditi Dhagat, Bronwyn Eisenberg, Rainer Gawlick, Rosario Genarro, Lalita Jagdeesan, Joe Kil- ian, Dina Kravets, John Leo, Roberto Segala, Donna Slonim, Mark Smith, David Williamson, Ethan Wolf, and Yiqun Yin. Thanks to my friends from the "outside" who have kept me sane. I especially thank Cindy Argo, Lisa Barnard, Kelly Bodnar, Anupam Chander, Lara Embry, Kyung In Han, Mike Hase, Pam Lipson, Lucy Song, Barbara Van Gorder, Robert Weaver, Tracey Drake Weber, and Irene Yu. Special thanks to Alisa Dougless, who has provided hours of entertainment while I've been at graduate school. I am grateful to Trevor Jim for being the best friend I could ever imagine. Most of all, I am grateful to my family. I thank my uncles, aunts and cousins for much help during difficult times. I especially thank my parents and my brothers Rajiv and Jimmy for their unbelievable courage, and for their continuing love and support. This thesis is dedicated to them. 5 Publication Notes Chapter 2 is joint work with Avrim Blum. An extended abstract describing this work appeared in Proceedings of the Third Annual Workshop on Computational Learning Theory [24]. The first part of Chapter 3 is joint work with Margrit Betke and Ron Rivest. This research is described in the journal Machzne Learning [20]. An extended abstract of this work also appeared in Proceedings of the Sixth Conference on Computational Learning Theory [19]. The second part of this chapter is joint work with Baruch Awerbuch, Margrit Betke and Ron Rivest. An extended abstract describing this work appeared in Proceedings of the Eighth Conference on Computational Learning Theory [6]. Chapter 4 is joint work with Bonnie Berger, and has been submitted for publication. Table of Contents 1 Introduction 9 2 Learning functions on k terms 17 2.1 Introduction ....... ............ .................. 17 2.2 Notation and definitions ................... ........... 19 2.3 The learning algorithm ................... ............. 20 2.3.1 Decision lists . .................. ............ 23 2.4 Hardness results ................. ................... 25 2.5 Conclusion ................... .................... 31 3 Piecemeal learning of unknown environments 33 3.1 Introduction .................. ................... 33 3.2 Related work ....... ............ .................. 34 3.3 Formal model ....... ............ .................. 37 3.4 Initial approaches to piecemeal learning ................... .... 38 3.5 Our approaches to piecemeal learning ................... ..... 40 3.5.1 Off-line piecemeal learning ................... ........ 41 3.5.2 On-line piecemeal learning ................... ........ 42 3.6 Linear time algorithms for city-block graphs . ................ .... 44 3.6.1 City-block graphs ................... ........... .. 44 8 Table of Contents 3.6.2 The wavefront algorithm ................. .. 49 3.6.3 The ray algorithm .. ................... 66 3.7 Piecemeal learning of undirected graphs . ........... ... 68 3.7.1 Algorithm STRIP-EXPLORE .. .............. ... 69 3.7.2 Iterative strip algorithm . ................ ..... 73 3.7.3 A nearly linear time algorithm for undirected graphs . ..... 76 3.8 Conclusions .... ........................... ........... .. 81 4 Learning-based algorithms for protein motif recognition 4.1 Introduction ................... 83 4.2 Further background .... .. ............ 87 4.2.1 Related work on protein structure prediction .. ... .... 87 4.2.2 Previous approaches to predicting coiled coils . .. .. ... .. 88 4.3 The algorithm . .. ..................... ............ ... 90 4.3.1 Scoring ... .................... ............ ... 92 4.3.2 Computing likelihoods . ............ ............ 93 4.3.3 Randomized selection of the new database .. ... .... ... 94 4.3.4 Updating parameters .. ....... ............ 94 4.3.5 Algorithm termination . ............ ............ 97 4.4 Results ....... ................... ...... ..... .. 97 4.4.1 The databases and test sequences . ...... ............ 98 4.4.2 Learning 3-stranded coiled coils ... ... .. ............ 99 4.4.3 Learning subclasses of 2-stranded coiled coils . .... .... .. .101 4.4.4 New coiled-coil-like candidates ....... ............ .103 4.5 Conclusions ... ...................... ............ .104 5 Concluding remarks 107 Bibliography 109 CHAPTER 1 Introduction There are many reasons we want machines, or computers, to learn. A machine that can learn is able to use its experience to help itself in the future. Such a machine can improve its performance on some task after performing the task several times. This is useful for computer scientists, since it means we do not have to consider all the possible scenarios a machine might encounter. Such a machine is able to adapt to various conditions or environments, or even to changing environments. A machine that is able to learn can also help push science forward. It may be able to speed up the learning process for humans, or it may be able discern patterns or do things which humans are incapable of doing. For example, we may want to build a machine that can learn patterns that aid in medical diagnosis, or that may be able to learn how to understand and process speech. Or we might want to build an autonomous robot
Load more

Recommended publications
  • Predicting and Characterising Protein-Protein Complexes
    Predicting and Characterising Protein-Protein Complexes Iain Hervé Moal June 2011 Biomolecular Modelling Laboratory, Cancer Research UK London Research Institute and Department of Biochemistry and Molecular Biology, University College London A thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Biochemistry at the University College London. 2 I, Iain Hervé Moal, confirm that the work presented in this thesis is my own. Where information has been derived from other sources, I confirm that this has been indicated in the thesis. Abstract Macromolecular interactions play a key role in all life processes. The con- struction and annotation of protein interaction networks is pivotal for the understanding of these processes, and how their perturbation leads to dis- ease. However the extent of the human interactome and the limitations of the experimental techniques which can be brought to bear upon it necessit- ate theoretical approaches. Presented here are computational investigations into the interactions between biological macromolecules, focusing on the structural prediction of interactions, docking, and their kinetic and thermo- dynamic characterisation via empirical functions. Firstly, the use of normal modes in docking is investigated. Vibrational analysis of proteins are shown to indicate the motions which proteins are intrinsically disposed to under- take, and the use of this information to model flexible deformations upon protein-protein binding is evaluated. Subsequently SwarmDock, a docking algorithm which models flexibility as a linear combination of normal modes, is presented and benchmarked on a wide variety of test cases. This algorithm utilises state of the art energy functions and metaheuristics to navigate the free energy landscape.
    [Show full text]
  • 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]
  • Development of Novel Strategies for Template-Based Protein Structure Prediction
    Imperial College London Department of Life Sciences PhD Thesis Development of novel strategies for template-based protein structure prediction Stefans Mezulis supervised by Prof. Michael Sternberg Prof. William Knottenbelt September 2016 Abstract The most successful methods for predicting the structure of a protein from its sequence rely on identifying homologous sequences with a known struc- ture and building a model from these structures. A key component of these homology modelling pipelines is a model combination method, responsible for combining homologous structures into a coherent whole. Presented in this thesis is poing2, a model combination method using physics-, knowledge- and template-based constraints to assemble proteins us- ing information from known structures. By combining intrinsic bond length, angle and torsional constraints with long- and short-range information ex- tracted from template structures, poing2 assembles simplified protein models using molecular dynamics algorithms. Compared to the widely-used model combination tool MODELLER, poing2 is able to assemble models of ap- proximately equal quality. When supplied only with poor quality templates or templates that do not cover the majority of the query sequence, poing2 significantly outperforms MODELLER. Additionally presented in this work is PhyreStorm, a tool for quickly and accurately aligning the three-dimensional structure of a query protein with the Protein Data Bank (PDB). The PhyreStorm web server provides comprehensive, current and rapid structural comparisons to the protein data bank, providing researchers with another tool from which a range of biological insights may be drawn. By partitioning the PDB into clusters of similar structures and performing an initial alignment to the representatives of each cluster, PhyreStorm is able to quickly determine which structures should be excluded from the alignment.
    [Show full text]
  • UC Irvine UC Irvine Previously Published Works
    UC Irvine UC Irvine Previously Published Works Title The capacity of feedforward neural networks. Permalink https://escholarship.org/uc/item/29h5t0hf Authors Baldi, Pierre Vershynin, Roman Publication Date 2019-08-01 DOI 10.1016/j.neunet.2019.04.009 License https://creativecommons.org/licenses/by/4.0/ 4.0 Peer reviewed eScholarship.org Powered by the California Digital Library University of California THE CAPACITY OF FEEDFORWARD NEURAL NETWORKS PIERRE BALDI AND ROMAN VERSHYNIN Abstract. A long standing open problem in the theory of neural networks is the devel- opment of quantitative methods to estimate and compare the capabilities of different ar- chitectures. Here we define the capacity of an architecture by the binary logarithm of the number of functions it can compute, as the synaptic weights are varied. The capacity provides an upperbound on the number of bits that can be extracted from the training data and stored in the architecture during learning. We study the capacity of layered, fully-connected, architectures of linear threshold neurons with L layers of size n1, n2,...,nL and show that in essence the capacity is given by a cubic polynomial in the layer sizes: L−1 C(n1,...,nL) = Pk=1 min(n1,...,nk)nknk+1, where layers that are smaller than all pre- vious layers act as bottlenecks. In proving the main result, we also develop new techniques (multiplexing, enrichment, and stacking) as well as new bounds on the capacity of finite sets. We use the main result to identify architectures with maximal or minimal capacity under a number of natural constraints.
    [Show full text]
  • Centre for Bioinformatics Imperial College London
    Centre for Bioinformatics Imperial College London Inaugural Report January 2003 Centre Director: Prof Michael Sternberg www.imperial.ac.uk/bioinformatics [email protected] Support Service Head: Dr Sarah Butcher www.codon.bioinformatics.ic.ac.uk [email protected] Centre for Bioinformatics - Imperial College London - Inaugural Report - January 2003 1 Contents Summary..................................................................................................................... 3 1. Background and Objectives .................................................................................... 4 1.1 Background ....................................................................................................... 4 1.2 Objectives of the Centre for Bioinformatics ....................................................... 4 1.3 Objectives of the Bioinformatics Support Service.............................................. 5 1.4 Historical Notes ................................................................................................. 5 2. Management ........................................................................................................... 6 3. Biographies of the Team......................................................................................... 7 4. Bioinformatics Research at Imperial ....................................................................... 8 4.1 Affiliates of the Centre ....................................................................................... 8 4.2 Research Grants
    [Show full text]
  • Centre for Bioinformatics Imperial College London Second Report 31
    Centre for Bioinformatics Imperial College London Second Report 31 May 2004 Centre Director: Prof Michael Sternberg www.imperial.ac.uk/bioinformatics [email protected] Support Service Head: Dr Sarah Butcher www.codon.bioinformatics.ic.ac.uk [email protected] Centre for Bioinformatics - Imperial College London - Second Report - May 2004 1 Contents Summary..................................................................................................................... 3 1. Background and Objectives .................................................................................. 4 1.1 Objectives of the Report........................................................................................ 4 1.2 Background........................................................................................................... 4 1.3 Objectives of the Centre for Bioinformatics........................................................... 5 1.4 Objectives of the Bioinformatics Support Service ................................................. 5 2. Management ......................................................................................................... 6 3. Biographies of the Team....................................................................................... 7 4. Bioinformatics Research at Imperial ..................................................................... 8 4.1 Affiliates of the Centre........................................................................................... 8 4.2 Research..............................................................................................................
    [Show full text]
  • EMT Biocomputing Workshop Report
    FINAL WORKSHOP REPORT Sponsor: 004102 : Computing Research Association Award Number: AGMT dtd 7-2-08 Title: NSF Workshop on Emerging Models and Technologies in Computing: Bio-Inspired Computing and the Biology and Computer Science Interface. Report Prepared by: Professor Ron Weiss Departments of Electrical Engineering and Molecular Biology Princeton University Professor Laura Landweber Departments of Ecology and Evolutionary Biology and Molecular Biology Princeton University Other Members of the Organizing Committee Include: Professor Mona Singh Departments of Computer Science and Molecular Biology Princeton University Professor Erik Winfree Department of Computer Science California Institute of Technology Professor Mitra Basu Department of Computer Science Johns Hopkins University and the United States Naval Academy Workshop Website: https://www.ee.princeton.edu/Events/emt/ Draft: 09/07/2008 Table of Contents I. Executive Summary 1. Workshop Objectives 2. Summary of the Workshop Methodology and Findings 3. Recommendations II. Grand Challenges III. Breakout Group Presentations Appendices A1. Agenda A2. Participant List A3. Abstracts of Invited Presentations A4. Presentations Draft: 09/07/2008 I. Executive Summary I.1 Workshop Goals The National Science Foundation, Division of Computer and Information Science and Engineering (CISE), Computing and Communications Foundations (CCF) sponsored a Workshop on Emerging Models and Technologies in Computing (EMT): Bio- Inspired Computing. This workshop brought together distinguished leaders in the fields of synthetic biology, bio-computing, systems biology, and protein and nucleic acid engineering to share their vision for science and research and to learn about the research projects that EMT has funded. The goal was to explore and to drive the growing interface between Biology and Computer Science.
    [Show full text]
  • Research News
    Computing Research News COMPUTING RESEARCH ASSOCIATION, CELEBRATING 40 YEARS OF SERVICE TO THE COMPUTING RESEARCH COMMUNITY JUNE 2013 Vol. 25 / No. 6 Announcements 2 Coalition for National Science Funding 2 CRA Announces Outstanding Undergraduate Researcher Award Winners 3 Computing Research in Action 5 CERP Infographic 6 NSF Funding Opportunity 6 CRA Recognizes Participants 7 CRA Board Members 16 CRA Board Officers 16 CRA Staff 16 Professional Opportunities 17 COMPUTING RESEARCH NEWS, JUNE 2013 Vol. 25 / No. 6 Announcements 2012 Taulbee Report Updated May 15, 2013 Corrected Table F6 Click here to download updated version CRA Releases Latest Research Issue Report New Technology-based Models for Postsecondary Learning: Conceptual Frameworks and Research Agendas The report details the findings of a National Science Foundation-Sponsored Computing Research Association Workshop held at MIT on January 9-11, 2013. From the report: “Advances in technology and in knowledge about expertise, learning, and assessment have the potential to reshape the many forms of education and training past matriculation from high school. In the next decade, higher education, military and workplace training, and professional development must all transform to exploit the opportunities of a new era, leveraging emerging technology-based models that can make learning more efficient and possibly improve student support, all at lower cost for a broader range of learners.” The report is now available as a pdf at http://cra.org/resources/research-issues/. Slides from the presentation at NSF on April 19, 2013 are also available. Investments in STEM Research and Education: Fueling American Innovation On May 7, at the Rayburn House Office Building in Brett Bode from the National Center for Supercomputing Washington, DC, the Coalition for National Science Funding Applications at University of Illinois Urbana-Champaign were (CNSF) held its 19th annual exhibition and reception, on hand to talk about the “Blue Waters” project.
    [Show full text]
  • Bch394p-364C
    Assembling Genomes BCH394P/364C Systems Biology / Bioinformatics Edward Marcotte, Univ of Texas at Austin 1 www.yourgenome.org/facts/timeline-the-human-genome-project Nature 409, 860-921(2001) 2 1 3 Beijing Genomics Institute “If it tastes good you should sequence it... you should know what's in the genes of that species” Wang Jun, Chief executive, BGI (Wikipedia) 4 2 https://www.technologyreview.com/s/615289/china-bgi-100-dollar-genome/ 5 6 3 https://www.prnewswire.com/news-releases/oxford-nanopore-sequencers-have-left-uk-for-china- to-support-rapid-near-sample-coronavirus-sequencing-for-outbreak-surveillance-300996908.html 7 http://www.triazzle.com ; The image from http://www.dangilbert.com/port_fun.html Reference: Jones NC, Pevzner PA, Introduction to Bioinformatics Algorithms, MIT press 8 4 “mapping” “shotgun” sequencing 9 (Translating the cloning jargon) 10 5 Thinking about the basic shotgun concept • Start with a very large set of random sequencing reads • How might we match up the overlapping sequences? • How can we assemble the overlapping reads together in order to derive the genome? 11 Thinking about the basic shotgun concept • At a high level, the first genomes were sequenced by comparing pairs of reads to find overlapping reads • Then, building a graph ( i.e. , a network) to represent those relationships • The genome sequence is a “walk” across that graph 12 6 The “Overlap-Layout-Consensus” method Overlap : Compare all pairs of reads (allow some low level of mismatches) Layout : Construct a graph describing the overlaps sequence overlap read Simplify the graph read Find the simplest path through the graph Consensus : Reconcile errors among reads along that path to find the consensus sequence 13 Building an overlap graph 5’ 3’ EUGENE W.
    [Show full text]
  • Spinout Equinox Pharma Speeds up and Reduces the Cost of Drug Discovery
    Spinout Equinox Pharma speeds up and reduces the cost of drug discovery pinout Equinox Pharma1 provides a service to the pharma and biopharma industries that helps in the development of new drugs. The company, established by researchers from Imperial College London in IMPACT SUMMARY 2008, is using its own proprietary software to help speed up and reduce the cost of discovery processes. S Spinout Equinox Pharma provides services to the agri- tech and pharmaceuticals industries to accelerate the Equinox is based on BBSRC-funded collaborative research The technology also has applications in the agrochemical discovery of molecules that could form the basis of new conducted by Professors Stephen Muggleton2, Royal sector, and is being used by global agri-tech company products such as drugs or herbicides. Academy Chair in Machine Learning, Mike Sternberg3, Chair Syngenta. The company arose from BBSRC bioinformatics and of Structural Bioinformatics, and Paul Freemont4, Chair of structural biology research at Imperial College London. Protein Crystallography, at Imperial College London. “The power of a logic-based approach is that it can Technology commercialisation company NetScientific propose chemically-novel molecules that can have Ltd has invested £250K in Equinox. The technology developed by the company takes a logic- enhanced properties and are able to be the subject of novel Equinox customers include major pharmaceutical based approach to discover novel drugs, using computers to ‘composition of matter’ patents,” says Muggleton. companies such as Japanese pharmaceutical company learn from a set of biologically-active molecules. It combines Astellas and agro chemical companies such as knowledge about traditional drug discovery methods and Proving the technology Syngenta, as well as SMEs based in the UK, Europe, computer-based analyses, and focuses on the key stages in A three-year BBSRC grant in 2003 funded the work of Japan and the USA.
    [Show full text]
  • 2014 ISCB Accomplishment by a Senior Scientist Award: Gene Myers
    Message from ISCB 2014 ISCB Accomplishment by a Senior Scientist Award: Gene Myers Christiana N. Fogg1, Diane E. Kovats2* 1 Freelance Science Writer, Kensington, Maryland, United States of America, 2 Executive Director, International Society for Computational Biology, La Jolla, California, United States of America The International Society for Computa- tional Biology (ISCB; http://www.iscb. org) annually recognizes a senior scientist for his or her outstanding achievements. The ISCB Accomplishment by a Senior Scientist Award honors a leader in the field of computational biology for his or her significant contributions to the com- munity through research, service, and education. Dr. Eugene ‘‘Gene’’ Myers of the Max Planck Institute of Molecular Cell Biology and Genetics in Dresden has been selected as the 2014 ISCB Accom- plishment by a Senior Scientist Award winner. Myers (Image 1) was selected by the ISCB’s awards committee, which is chaired by Dr. Bonnie Berger of the Massachusetts Institute of Technology (MIT). Myers will receive his award and deliver a keynote address at ISCB’s 22nd Image 1. Gene Myers. Image credit: Matt Staley, HHMI. Annual Intelligent Systems for Molecular doi:10.1371/journal.pcbi.1003621.g001 Biology (ISMB) meeting. This meeting is being held in Boston, Massachusetts, on July 11–15, 2014, at the John B. Hynes guidance of his dissertation advisor, An- sequences and how to build evolutionary Memorial Convention Center (https:// drzej Ehrenfeucht, who had eclectic inter- trees. www.iscb.org/ismb2014). ests that included molecular biology. Myers landed his first faculty position in Myers was captivated by computer Myers, along with fellow graduate students the Department of Computer Science at programming as a young student.
    [Show full text]
  • David Haussler Elected to NAS IMS Member David Haussler Is One of 72 New Mem- Contents Bers Elected to the US National Academy of Sciences
    Volume 35 Issue 5 IMS Bulletin June 2006 David Haussler elected to NAS IMS member David Haussler is one of 72 new mem- CONTENTS bers elected to the US National Academy of Sciences. 1 David Haussler, NAS Members are chosen in recognition of their distin- guished and continuing achievements in original 2 IMS Members’ News: Bin Yu, Hongyu Zhao, research. Ralph Cicerone, Academy president, says, Jianqing Fan “Election to the Academy is considered one of the highest honors in American science and engineering.” 4 LNMS Sale David Haussler is an investigator with the 5 IMS news Howard Hughes Medical Institute and a professor 6 Rio guide: eating, dancing, of biomolecular engineering at the University of having fun California, Santa Cruz, where he directs the Center David Haussler, recently elected to the for Biomolecular Science & Engineering. He serves 7 SSP report US National Academy of Sciences as scientific co-director for the California Institute 8 Terence’s Stuff: The Big for Quantitative Biomedical Research (QB3), and he is a consulting professor at Question both Stanford Medical School and UC San Francisco Biopharmaceutical Sciences 9 Meet the Members Department. David was recently elected to the American Academy of Arts and Sciences; 10 JSM News: IMS Invited Program highlights he is also a fellow of both AAAS and AAAI. He has won a number of prestigious awards, including recently the 2006 Dickson Prize for Science from Carnegie Mellon IMS Meetings 12 University. David received his BA degree in mathematics from Connecticut College 19 Other Meetings and in 1975, an MS in applied mathematics from California Polytechnic State University Announcements at San Luis Obispo in 1979, and his PhD in computer science from the University of 21 Employment Colorado at Boulder in 1982.
    [Show full text]