Skip to main content

Subtree Prune and Re-Graft

  • Chapter
  • 1152 Accesses

Part of the Lecture Notes in Mathematics book series (LNMECOLE,volume 1920)

As we mentioned in Chapter 1, Markov chains that move through a space of finite trees are an important ingredient in several algorithms in phylogenetic analysis, and one standard set of moves that is implemented in several phylogenetic software packages is the set of subtree prune and re-graft (SPR) moves.

Keywords

  • Probability Measure
  • Dirichlet Form
  • Poisson Random Measure
  • Brownian Excursion
  • Subtree Prune

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (Canada)
  • 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and Permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2008). Subtree Prune and Re-Graft. In: Probability and Real Trees. Lecture Notes in Mathematics, vol 1920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74798-7_9

Download citation