Skip to content
Algebraic Statistics for Computational Biology

Algebraic Statistics for Computational Biology

$92.99 (C)

L. Pachter, B. Sturmfels, R. Mihaescu, M. Joswig, C. Dewey, K. Woods, S. Elizalde, E. Kuo, N. Bray, J. Morton, I. B. Hallgrímsdóttir, A. Milowski, J. Yu, A. Caspi, N. Beerenwinkel, M. Drton, M. Casanellas, L. Garcia, S. Sullivant, M. Casanellas, D. Bryant, M. Contois, D. Levy, N. Eriksson, R. Sainudiin, R. Yoshida, J. Al-Aidroos, S. Snir, G. Leung
View all contributors
  • Date Published: August 2005
  • availability: Available
  • format: Hardback
  • isbn: 9780521857000

$ 92.99 (C)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • The quantitative analysis of biological sequence data is based on methods from statistics coupled with efficient algorithms from computer science. Algebra provides a framework for unifying many of the seemingly disparate techniques used by computational biologists. This book offers an introduction to this mathematical framework and describes tools from computational algebra for designing new algorithms for exact, accurate results. These algorithms can be applied to biological problems such as aligning genomes, finding genes and constructing phylogenies. As the first book in the exciting and dynamic area, it will be welcomed as a text for self-study or for advanced undergraduate and beginning graduate courses.

    • First book in an exciting area at intersection of computation, statistics, and genomics
    • Has quick guides to background topics, then applies these in case studies at forefront of research
    • Includes links to online software and ancillary material from
    Read more

    Reviews & endorsements

    "This substantial, enthusiastically presented, and confidently written book is largely based on and around a graduate course taught by the two editors, who are in the mathematics department at the University of California, Berkeley, during the fall of 2004. The four introductory chapters were written by the editors, whilst the seventeen chapters in Part II were written up as a result of research projects undertaken by course participants."
    ISI Short Book Reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: August 2005
    • format: Hardback
    • isbn: 9780521857000
    • length: 434 pages
    • dimensions: 261 x 186 x 28 mm
    • weight: 1.12kg
    • contains: 100 b/w illus. 3 colour illus. 5 tables
    • availability: Available
  • Table of Contents

    Part I. Introduction to the Four Themes:
    1. Statistics L. Pachter and B. Sturmfels
    2. Computation L. Pachter and B. Sturmfels
    3. Algebra L. Pachter and B. Sturmfels
    4. Biology L. Pachter and B. Sturmfels
    Part II. Studies on the Four Themes:
    5. Parametric inference R. Mihaescu
    6. Polytope propagation on graphs M. Joswig
    7. Parametric sequence alignment C. Dewey and K. Woods
    8. Bounds for optimal sequence alignment S. Elizalde
    9. Inference functions S. Elizalde
    10. Geometry of Markov chains E. Kuo
    11. Equations defining hidden Markov models N. Bray and J. Morton
    12. The EM algorithm for hidden Markov models I. B. Hallgrímsdóttir, A. Milowski and J. Yu
    13. Homology mapping with Markov random fields A. Caspi
    14. Mutagenetic tree models N. Beerenwinkel and M. Drton
    15. Catalog of small trees M. Casanellas, L. Garcia and S. Sullivant
    16. The strand symmetric model M. Casanellas and S. Sullivant
    17. Extending statistical models from trees to splits graphs D. Bryant
    18. Small trees and generalized neighbor-joining M. Contois and D. Levy
    19. Tree construction using Singular Value Decomposition N. Eriksson
    20. Applications of interval methods to phylogenetics R. Sainudiin and R. Yoshida
    21. Analysis of point mutations in vertebrate genomes J. Al-Aidroos and S. Snir
    22. Ultra-conserved elements in vertebrate genomes M. Drton, N. Eriksson and G. Leung

  • Resources for

    Algebraic Statistics for Computational Biology

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact

  • Editors

    L. Pachter, University of California, Berkeley
    Lior Pachter is Associate Professor of Mathematics at the University of California, Berkeley. He received his PhD in mathematics from the Massachusetts Institute of Technology in 1999. He then moved to the mathematics department at UC Berkeley where he was a postdoctoral researcher for two years, before being hired as an assistant professor. He has been awarded an NSF Career award, and has received the Sloan Fellowship for his work on molecular biology and evolution. Equally at home amongst both mathematicians and biologists, he has published over 40 research articles in areas ranging from combinatorics to gene finding, and has participated in several large genome projects.

    B. Sturmfels, University of California, Berkeley
    Bernd Sturmfels is Professor of Mathematics and Computer Science at the University of California, Berkeley. His honors include a National Young Investigator Fellowship, a Sloan Fellowship, and a David and Lucile Packard Fellowship. Sturmfels served as von Neumann Professor at TU Munich in Summer 2002, as the Hewlett-Packard Research Professor at MSRI Berkeley in 2003/04, and he was a Clay Senior Scholar in 2004.


    L. Pachter, B. Sturmfels, R. Mihaescu, M. Joswig, C. Dewey, K. Woods, S. Elizalde, E. Kuo, N. Bray, J. Morton, I. B. Hallgrímsdóttir, A. Milowski, J. Yu, A. Caspi, N. Beerenwinkel, M. Drton, M. Casanellas, L. Garcia, S. Sullivant, M. Casanellas, D. Bryant, M. Contois, D. Levy, N. Eriksson, R. Sainudiin, R. Yoshida, J. Al-Aidroos, S. Snir, G. Leung

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.