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

Computational complexity of inferring phylogenies from dissimilarity matrices

โœ Scribed by William H. E. Day

Book ID
112753837
Publisher
Springer
Year
1987
Tongue
English
Weight
429 KB
Volume
49
Category
Article
ISSN
1522-9602

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

The computational complexity of Steiner
The computational complexity of Steiner tree problems in graded matrices
โœ T. Dudรกs; B. Klinz; G.J. Woeginger ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 349 KB

## Communicated by M. Iri Abstract--We investigate the computational complexity of the Steiner tree problem in graphs when the distance matrix is graded, i.e., has increasing, respectively, decreasing rows, or increasing, respectively, decreasing columns, or both. We exactly characterize polynomia