Here we introduce a new Multi-Stack (MS) based phylogenetic tree building method. The Multi-Stack approach organizes the candidate
subtrees (i.e. those having same number of leaves) into limited priority queues, always selecting the K-best subtrees, according to their distance estimation error. Using the K-best subtrees our method iteratively applies a novel subtree joining strategy to generate candidate higher level subtreesfrom the existing low-level ones. This new MS method uses the Constrained Least Squares Criteria (CLSC) which guarantees thenon-negativity of the edge weights.
%0 Journal Article
%1 Busa-Fekete07treeBuilding
%A Busa-Fekete, Robert
%A Kocsor, Andras
%A Bagyinka, Csaba
%D 2007
%J Bioinformatics Research and Applications
%K 07 Busa-Fekete UPGMA agglomerative clustering tree
%P 49--60
%T A Multi-Stack Based Phylogenetic Tree Building Method
%U http://dx.doi.org/10.1007/978-3-540-72031-7_5
%X Here we introduce a new Multi-Stack (MS) based phylogenetic tree building method. The Multi-Stack approach organizes the candidate
subtrees (i.e. those having same number of leaves) into limited priority queues, always selecting the K-best subtrees, according to their distance estimation error. Using the K-best subtrees our method iteratively applies a novel subtree joining strategy to generate candidate higher level subtreesfrom the existing low-level ones. This new MS method uses the Constrained Least Squares Criteria (CLSC) which guarantees thenon-negativity of the edge weights.
@article{Busa-Fekete07treeBuilding,
abstract = {Here we introduce a new Multi-Stack (MS) based phylogenetic tree building method. The Multi-Stack approach organizes the candidate
subtrees (i.e. those having same number of leaves) into limited priority queues, always selecting the K-best subtrees, according to their distance estimation error. Using the K-best subtrees our method iteratively applies a novel subtree joining strategy to generate candidate higher level subtreesfrom the existing low-level ones. This new MS method uses the Constrained Least Squares Criteria (CLSC) which guarantees thenon-negativity of the edge weights.},
added-at = {2009-01-11T23:02:32.000+0100},
author = {Busa-Fekete, Robert and Kocsor, Andras and Bagyinka, Csaba},
biburl = {https://www.bibsonomy.org/bibtex/2d0d7ce97d4dfc6b9ce1f977f3f2352f3/lee_peck},
description = {SpringerLink - Book Chapter},
interhash = {f444ec60316f42ea98ff2842385026a8},
intrahash = {d0d7ce97d4dfc6b9ce1f977f3f2352f3},
journal = {Bioinformatics Research and Applications},
keywords = {07 Busa-Fekete UPGMA agglomerative clustering tree},
pages = {49--60},
timestamp = {2009-01-11T23:02:32.000+0100},
title = {A Multi-Stack Based Phylogenetic Tree Building Method},
url = {http://dx.doi.org/10.1007/978-3-540-72031-7_5},
year = 2007
}