The layer-ordered heap (LOH) is a novel data structure used in optimal selection on a Cartesian sum, algorithms with the best known runtime for selection on X_1+X_2+\cdots+X_m, and the world's fastest isotope calculator . Here, we provide optimal algorithms for the construction of LOHs of any rank  .
The layer-ordered heap (LOH) is a simple, recently proposed data structure used in optimal selection on X+Y, thealgorithm with the best known runtime for selection on X_1+X_2+\cdots+X_m, and the fastest method in practice for computing the most abundant isotope peaks in a chemical compound . Here, we introduce a few algorithms for constructing LOHs, analyze their complexity, and demonstrate that one algorithm is optimal for building a LOH of any rank \alpha. These results are shown to correspond with empirical experiments of runtimes when applying the LOH construction algorithms to a common task in machine learning .
R
novel
simple, recently proposed
R
a Cartesian sum, algorithms
X+Y, thealgorithm
R
world's fastest isotope calculator
fastest method in practice for computing the most abundant isotope peaks in a chemical compound
R
provide optimal algorithms for the construction of LOHs
introduce a few algorithms for constructing LOHs, analyze their complexity, and demonstrate that one algorithm is optimal for building a LOH
A
\alpha. These results are shown to correspond with empirical experiments of runtimes when applying the LOH construction algorithms to a common task in machine learning