On the edge l_ radius of Saitou and Nei's method for phylogenetic reconstruction
DOI10.1016/J.TCS.2006.08.044zbMATH Open1110.68097OpenAlexW2161643683MaRDI QIDQ861287FDOQ861287
Authors: Wenqiang Dai, Binhai Zhu, Yinfeng Xu
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.044
Recommendations
Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)
Cites Work
- Title not available (Why is that?)
- Computational complexity of inferring phylogenies from dissimilarity matrices
- On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The performance of neighbor-joining methods of phylogenetic reconstruction
- A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
- High-performance algorithm engineering for computational phylogenetics
Cited In (2)
This page was built for publication: On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861287)