Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Bioinformatics Research and Applications

ISBRA 2010: Bioinformatics Research and Applications pp 2Cite as

Successes and Failures of Elegant Algorithms in Computational Biology

(Invited Keynote Talk)

  • Conference paper

  • 747 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 6053))

Abstract

Problems that originated in biology gave rise to many very nice computational problems, and they motivated a large body of research, and many very elegant results. But are these results useful in biology?

The record is mixed, and we will review both successes and failures.

Our examples will include applications of set cover and tiling problems and problems related to biological networks. In some cases, new algorithms provided biologists with efficient solutions to their problems, in other, not so much, as the complex nature of the motivating problems was lost in the translation into the language of algorithmic problems.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering Penn State, University Park, PA, 16802

    Piotr Berman

Authors
  1. Piotr Berman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Biology, Department of Biomedical Engineering and College of Computing, Georgia Institute of Technology, Atlanta, Georgia, USA

    Mark Borodovsky

  2. Molecular and Cell Biology Department, University of Connecticut, 91 North Eagleville Road, Unit 3125, 06269-3125, Storrs, CT, USA

    Johann Peter Gogarten

  3. National Center for Biotechnology Information, National Library of Medicine, National Institutes of Health, 8600 Rockville Pike, Building 38A 8S814, 20894, Bethesda, MD, USA

    Teresa M. Przytycka

  4. Department of Computer Science and Engineering, University of Connecticut, 257 ITE Building, 371 Fairfield Way, 06269-2155, Storrs, CT, USA

    Sanguthevar Rajasekaran

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berman, P. (2010). Successes and Failures of Elegant Algorithms in Computational Biology. In: Borodovsky, M., Gogarten, J.P., Przytycka, T.M., Rajasekaran, S. (eds) Bioinformatics Research and Applications. ISBRA 2010. Lecture Notes in Computer Science(), vol 6053. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13078-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13078-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13077-9

  • Online ISBN: 978-3-642-13078-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation