22 search results - page 1 / 5 » An Experimental Analysis of Consensus Tree Algorithms for La... |
ISBRA
2009
Springer
13 years 11 months ago
2009
Springer
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...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
ICDE
2004
IEEE
14 years 6 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
PATMOS
2004
Springer
13 years 10 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...