Buscar
Mostrando ítems 1-10 de 2494
Parallel construction of wavelet trees on multicore architectures
(2017-06)
The wavelet tree has become a very useful data structure to efficiently represent and query large volumes of data in many different domains, from bioinformatics to geographic information systems. One problem with wavelet ...
Parallel construction of succinct trees
(2017)
Succinct representations of trees are an elegant solution to make large trees fit in main memory while still supporting navigational operations in constant time. However, their construction time remains a bottleneck. We ...
Parallel construction of succinct trees
(2017)
Succinct representations of trees are an elegant solution to make large trees fit in main memory while still supporting navigational operations in constant time. However, their construction time remains a bottleneck. We ...
Hide and vanish: data sets where the most parsimonious tree is known but hard to find, and their implications for tree search methods
(Elsevier, 2014-06)
Three different types of data sets, for which the uniquely most parsimonious tree can be known exactly but is hard to find with heuristic tree search methods, are studied. Tree searches are complicated more by the shape ...
Algorithm for Construction of Phylogenetic Trees
(1989)
An algorithm is described for the construction of phylogenetic trees. The algorithm is based on the progressive correction of data along the tree construction. For the correction, the average value of the difference between ...
Vectorized algorithms for quadtree construction and descent
(2012-10-01)
This paper presents vectorized methods of construction and descent of quadtrees that can be easily adapted to message passing parallel computing. A time complexity analysis for the present approach is also discussed. The ...
Vectorized algorithms for quadtree construction and descent
(2012-10-01)
This paper presents vectorized methods of construction and descent of quadtrees that can be easily adapted to message passing parallel computing. A time complexity analysis for the present approach is also discussed. The ...
Examples from trees, related to discrete subsets, pseudo-radiality and omega-boundedness
(ELSEVIER SCIENCE BV, 2009)
We construct some examples using trees. Some of them are consistent counterexamples for the discrete reflection of certain topological properties. All the properties dealt with here were already known to be non-discretely ...