Cargando…
A simple and space efficient segment tree implementation
The segment tree is an extremely versatile data structure. In this paper, a new array based implementation of segment trees is proposed. In such an implementation of segment tree, the structural information associated with the tree nodes can be removed completely. Some primary computational geometry...
Autores principales: | Wang, Lei, Wang, Xiaodong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6461578/ https://www.ncbi.nlm.nih.gov/pubmed/31011542 http://dx.doi.org/10.1016/j.mex.2019.02.028 |
Ejemplares similares
-
Efficient conformational space exploration in ab initio protein folding simulation
por: Ullah, Ahammed, et al.
Publicado: (2015) -
An approach to implementing state space searches on heterogeneous systems of multiprocessors
por: Glickfeld, B W, et al.
Publicado: (1987) -
Simple RPC: how it will work : draft specifications and implementation notes for the RPC project
por: Berners-Lee, Tim, et al.
Publicado: (1986) -
Simple RPC: how it will work : draft specifications and implementation notes for the RPC project
por: Berners-Lee, Tim, et al.
Publicado: (1986) -
An efficient, modular and simple tape archiving solution for LHC Run-3
por: Murray, S, et al.
Publicado: (2017)