Jump to ContentJump to Main Navigation
Codon EvolutionMechanisms and Models$
Users without a subscription are not able to see the full content.

Gina M. Cannarozzi and Adrian Schneider

Print publication date: 2012

Print ISBN-13: 9780199601165

Published to Oxford Scholarship Online: May 2015

DOI: 10.1093/acprof:osobl/9780199601165.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 24 November 2020

Simulation of coding sequence evolution

Simulation of coding sequence evolution

Chapter:
(p.126) Chapter 9 Simulation of coding sequence evolution
Source:
Codon Evolution
Author(s):

Miguel Arenas

David Posada

Publisher:
Oxford University Press
DOI:10.1093/acprof:osobl/9780199601165.003.0009

In molecular evolution, computer simulations have been commonly used to understand the interactions among evolutionary processes, for hypothesis testing, to evaluate and compare different analytical methods, or to estimate evolutionary parameters. This chapter describes simulation algorithms for the evolution of coding sequences under different evolutionary scenarios, potential uses of these simulations, and current simulation software. In particular, it discusses forward-time simulations, simulation of coalescent histories, and simulation of codon substitutions.

Keywords:   computer simulation, coding sequence, evolution, simulation algorithms

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .