Carregant...

Combinatorics of least-squares trees

A recurring theme in the least-squares approach to phylogenetics has been the discovery of elegant combinatorial formulas for the least-squares estimates of edge lengths. These formulas have proved useful for the development of efficient algorithms, and have also been important for understanding con...

Descripció completa

Guardat en:
Dades bibliogràfiques
Autors principals: Mihaescu, Radu, Pachter, Lior
Format: Artigo
Idioma:Inglês
Publicat: National Academy of Sciences 2008
Matèries:
Accés en línia:https://ncbi.nlm.nih.gov/pmc/articles/PMC2533170/
https://ncbi.nlm.nih.gov/pubmed/18779558
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.0802089105
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!