This unit contains three chapters on three different topics: RNA folding, gene regulation, and genetic algorithms. Each chapter presents a problem that leads to a programming project. Each chapter also introduces some major new ideas that are transferable to other areas of computer science and computational biology. For example, Chapter 12 examines the use of more sophisticated recursion in the context of RNA folding, Chapter 13 introduces the method of maximum likelihood in the context of inferring gene regulatory networks, and Chapter 14 introduces the concepts of algorithm efficiency, NP-hardness, and genetic algorithms.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.