Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
- 1 January 2001
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 31 (2), 375-397
- https://doi.org/10.1137/s0097539798342496
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Elements of Information TheoryPublished by Wiley ,2001
- A few logs suffice to build (almost) all trees (I)Random Structures & Algorithms, 1999
- Recovering a tree from the leaf colourations it generates under a Markov modelApplied Mathematics Letters, 1994
- Reconstructing the shape of a tree from observed dissimilarity dataAdvances in Applied Mathematics, 1986
- Taxonomy with confidenceMathematical Biosciences, 1978
- A Probability Model for Inferring Evolutionary TreesSystematic Zoology, 1973