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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights 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
DOI: https://doi.org/10.1007/978-3-540-74798-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74797-0
Online ISBN: 978-3-540-74798-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
