๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The computational complexity of inferring rooted phylogenies by parsimony

โœ Scribed by William H.E. Day; David S. Johnson; David Sankoff

Book ID
116029262
Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
630 KB
Volume
81
Category
Article
ISSN
0025-5564

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computational complexity of inferring ph
Computational complexity of inferring phylogenies from dissimilarity matrices
โœ William H.E. Day ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Springer ๐ŸŒ English โš– 439 KB

Molecular biologists strive to infer evolutionary relationships from quantitative macromolecular comparisons obtained by immunological, DNA hybridization, electrophoretic or amino acid sequencing techniques. The problem is to find unrooted phylogenies that best approximate a given dissimilarity matr