654 search results - page 25 / 131 » On the Approximation of Computing Evolutionary Trees |
ESA
2008
Springer
14 years 11 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...
AI
2008
Springer
14 years 9 months ago
2008
Springer
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
104
click to vote
VISUALIZATION
2005
IEEE
15 years 3 months ago
2005
IEEE
We introduce a technique to visualize the gradual evolutionary change of the shapes of living things as a morph between known three-dimensional shapes. Given geometric computer mo...
107
click to vote
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...