Felsenstein's tree-pruning algorithm: Difference between revisions
Content deleted Content added
Citation bot (talk | contribs) Add: s2cid, bibcode. | Use this bot. Report bugs. | Suggested by Abductive | Category:Genetics stubs | via #UCB_Category 551/578 |
#suggestededit-add 1.0 Tags: Mobile edit Mobile app edit Android app edit |
||
| Line 1: | Line 1: | ||
{{Short description|Technique in statistical genetics}} |
|||
In [[statistical genetics]], '''Felsenstein's tree-pruning algorithm''' (or '''Felsenstein's tree-peeling algorithm'''), attributed to [[Joe_Felsenstein|Joseph Felsenstein]], is an [[algorithm]] for computing the [[likelihood]] of an [[evolutionary tree]] from [[nucleic acid]] sequence data. <ref>{{Cite journal | last1 = Felsenstein | first1 = J.| author-link1 =Joseph Felsenstein| title = Maximum Likelihood and Minimum-Steps Methods for Estimating Evolutionary Trees from Data on Discrete Characters | doi = 10.1093/sysbio/22.3.240 | journal = Systematic Biology | volume = 22 | issue = 3 | pages = 240–249 | year = 1973 }}</ref><ref>{{Cite journal | last1 = Felsenstein | first1 = J.| author-link1 = Joseph Felsenstein| title = Evolutionary trees from DNA sequences: A maximum likelihood approach | doi = 10.1007/BF01734359 | journal = Journal of Molecular Evolution | volume = 17 | issue = 6 | pages = 368–376 | year = 1981 | pmid = 7288891| bibcode = 1981JMolE..17..368F| s2cid = 8024924}}</ref> |
In [[statistical genetics]], '''Felsenstein's tree-pruning algorithm''' (or '''Felsenstein's tree-peeling algorithm'''), attributed to [[Joe_Felsenstein|Joseph Felsenstein]], is an [[algorithm]] for computing the [[likelihood]] of an [[evolutionary tree]] from [[nucleic acid]] sequence data. <ref>{{Cite journal | last1 = Felsenstein | first1 = J.| author-link1 =Joseph Felsenstein| title = Maximum Likelihood and Minimum-Steps Methods for Estimating Evolutionary Trees from Data on Discrete Characters | doi = 10.1093/sysbio/22.3.240 | journal = Systematic Biology | volume = 22 | issue = 3 | pages = 240–249 | year = 1973 }}</ref><ref>{{Cite journal | last1 = Felsenstein | first1 = J.| author-link1 = Joseph Felsenstein| title = Evolutionary trees from DNA sequences: A maximum likelihood approach | doi = 10.1007/BF01734359 | journal = Journal of Molecular Evolution | volume = 17 | issue = 6 | pages = 368–376 | year = 1981 | pmid = 7288891| bibcode = 1981JMolE..17..368F| s2cid = 8024924}}</ref> |
||
Revision as of 18:23, 11 January 2022
In statistical genetics, Felsenstein's tree-pruning algorithm (or Felsenstein's tree-peeling algorithm), attributed to Joseph Felsenstein, is an algorithm for computing the likelihood of an evolutionary tree from nucleic acid sequence data. [1][2]
The algorithm is often used as a subroutine in a search for a maximum likelihood estimate for an evolutionary tree. Further, it can be used in a hypothesis test for whether evolutionary rates are constant (by using likelihood ratio tests). It can also be used to provide error estimates for the parameters describing an evolutionary tree.
References
- ^ Felsenstein, J. (1973). "Maximum Likelihood and Minimum-Steps Methods for Estimating Evolutionary Trees from Data on Discrete Characters". Systematic Biology. 22 (3): 240–249. doi:10.1093/sysbio/22.3.240.
- ^ Felsenstein, J. (1981). "Evolutionary trees from DNA sequences: A maximum likelihood approach". Journal of Molecular Evolution. 17 (6): 368–376. Bibcode:1981JMolE..17..368F. doi:10.1007/BF01734359. PMID 7288891. S2CID 8024924.
 | This genetics article is a stub. You can help Wikipedia by expanding it. |
 | This statistics-related article is a stub. You can help Wikipedia by expanding it. |