The UvA-LINKER will give you a range of other options to find the full text of a publication (including a direct link to the full-text if it is located on another database on the internet).
De UvA-LINKER biedt mogelijkheden om een publicatie elders te vinden (inclusief een directe link naar de publicatie online als deze beschikbaar is in een database op het internet).
faculty: "FNWI" and publication year: "2011"
| Authors||R.L. Cilibrasi, P.M.B. Vitányi|
|Title||A Fast Quartet tree heuristic for hierarchical clustering|
|Faculty||Faculty of Science|
|Institute/dept.||FNWI: Institute for Logic, Language and Computation (ILLC)|
|Abstract||The Minimum Quartet Tree Cost problem is to construct an optimal weight tree from the View the MathML source weighted quartet topologies on n objects, where optimality means that the summed weight of the embedded quartet topologies is optimal (so it can be the case that the optimal tree embeds all quartets as nonoptimal topologies). We present a Monte Carlo heuristic, based on randomized hill-climbing, for approximating the optimal weight tree, given the quartet topology weights. The method repeatedly transforms a dendrogram, with all objects involved as leaves, achieving a monotonic approximation to the exact single globally optimal tree. The problem and the solution heuristic has been extensively used for general hierarchical clustering of nontree-like (non-phylogeny) data in various domains and across domains with heterogeneous data. We also present a greatly improved heuristic, reducing the running time by a factor of order a thousand to ten thousand. All this is implemented and available, as part of the CompLearn package. We compare performance and running time of the original and improved versions with those of UPGMA, BioNJ, and NJ, as implemented in the SplitsTree package on genomic data for which the latter are optimized.|
Use this url to link to this page: http://dare.uva.nl/en/record/368999
Contact us about this recordNotify a colleague
Add to bookbag