Maximum likelihood of evolutionary trees: hardness and approximation
(1) We show that ML under the assumption of molecular clock is still computationally intractable (NP-hard). (2) We show that not only is it computationally intractable to find t...
Publications
1 shownFrequent Co-Authors
Researcher Info
- h-index
- 1
- Publications
- 1
- Citations
- 97
- Institution
- Tel Aviv University
External Links
Identifiers
- ORCID
- 0000-0003-4194-7068
Impact Metrics
h-index
1
h-index: Number of publications with at least h citations each.