RECORD
Maximum Likelihood Jukes-Cantor Triplets: Analytic Solutions
Populations and Evolution · Submitted 27 May 2005
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim In this work we give, for the first time, analytic solutions for a family of trees with four state characters, like normal DNA or RNA.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Complex systems of polynomial equations have to be set up and solved algebraically in order to obtain analytic solutions for maximum likelihood on phylogenetic trees. This has restricted the types of systems previously resolved to the simplest models - three and four taxa under a molecular clock, with just two state characters. In this work we give, for the first time, analytic solutions for a family of trees with four state characters, like normal DNA or RNA. The model of substitution we use is the Jukes-Cantor model, and the trees are on three taxa under molecular clock, namely rooted triplets. We employ a number of approaches and tools to solve this system: Spectral methods (Hadamard conjugation), a new representation of variables (the path-set spectrum), and algebraic geometry tools (the resultant of two polynomials). All these, combined with heavy application of computer algebra packages (Maple), let us derive the desired solution.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Complex systems of polynomial equations have to be set up and solved algebraically in order to obtain analytic solutions for maximum likelihood on phylogenetic trees. | background 1.00 | 0.08 | 0.04 | asserted 1.00 |
| s1 | This has restricted the types of systems previously resolved to the simplest models - three and four taxa under a molecular clock, with just two state characters. | gap 0.68 | 0.04 | 0.03 | asserted 1.00 |
| s2 | In this work we give, for the first time, analytic solutions for a family of trees with four state characters, like normal DNA or RNA. | contribution 0.97 | 0.95 | 0.78 | asserted 1.00 |
| s3 | The model of substitution we use is the Jukes-Cantor model, and the trees are on three taxa under molecular clock, namely rooted triplets. | method 0.78 | 0.51 | 0.11 | asserted 1.00 |
| s4 | We employ a number of approaches and tools to solve this system: Spectral methods (Hadamard conjugation), a new representation of variables (the path-set spectrum), and algebraic geometry tools (the resultant of two polynomials). | method 1.00 | 0.92 | 0.04 | asserted 1.00 |
| s5 | All these, combined with heavy application of computer algebra packages (Maple), let us derive the desired solution. | method 0.98 | 0.95 | 0.07 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Complex systems of polynomial equations have to be set up and solved algebraically in order to obtain analytic solutions for maximum likelihood on phylogenetic trees. This has restricted the types of systems previously resolved to the simplest models - three and four taxa under a molecular clock, with just two state characters. In this work we give, for the first time, analytic solutions for a family of trees with four state characters, like normal DNA or RNA. The model of substitution we use is the Jukes-Cantor model, and the trees are on three taxa under molecular clock, namely rooted triplets. We employ a number of approaches and tools to solve this system: Spectral methods (Hadamard conjugation), a new representation of variables (the path-set spectrum), and algebraic geometry tools (the resultant of two polynomials). All these, combined with heavy application of computer algebra packages (Maple), let us derive the desired solution.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.