807 search results - page 18 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
WABI
2005
Springer
15 years 5 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...
SAC
2002
ACM
14 years 11 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
ACSC
2001
IEEE
15 years 3 months ago
2001
IEEE
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Phylospaces is a novel framework for reconstructing evolutionary trees in tuple space, a distributed shared memory that permits processes to communicate and coordinate with each o...
ESA
2006
Springer
15 years 3 months ago
2006
Springer
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...