Optimal algorithms for comparing trees with labeled leaves
| Year of publication: |
1985
|
|---|---|
| Authors: | Day, William |
| Published in: |
Journal of Classification. - Springer. - Vol. 2.1985, 1, p. 7-28
|
| Publisher: |
Springer |
| Subject: | Algorithm complexity | Algorithm design | Comparing hierarchical classifications | Comparing phylogenetic trees | Consensus index | Strict consensus tree |
-
A computationally efficient approximation to the nearest neighbor interchange metric
Brown, Edward, (1984)
-
Investigation of proportional link linkage clustering methods
Day, William, (1985)
-
Efficient algorithms for agglomerative hierarchical clustering methods
Day, William, (1984)
- More ...
-
Heiser, Willem, (1984)
-
Haslett, John, (1990)
-
A computationally efficient approximation to the nearest neighbor interchange metric
Brown, Edward, (1984)
- More ...