112 search results - page 2 / 23 » The Performance of Phylogenetic Methods on Trees of Bounded ... |
WABI
2005
Springer
13 years 10 months ago
2005
Springer
Phylogenetic tree searching algorithms often produce thousands of trees which biologists save in Newick format in order to perform further analysis. Unfortunately, Newick is neithe...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that simultaneously performs multi...
EUROCAST
2009
Springer
13 years 12 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
GECCO
2009
Springer
13 years 12 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
BMCBI
2006
13 years 5 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...