DeepAI AI Chat
Log In Sign Up

Optimal construction of a layer-ordered heap

by   Jake Pennington, et al.

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+⋯+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 α. These results are shown to correspond with empirical experiments of runtimes when applying the LOH construction algorithms to a common task in machine learning.


page 1

page 2

page 3

page 4


Optimal selection on X+Y simplified with layer-ordered heaps

Selection on the Cartesian sum, A+B, is a classic and important problem....

Fast exact computation of the k most abundant isotope peaks with layer-ordered heaps

The theoretical computation of isotopic distribution of compounds is cru...

Selection on X_1+X_2+... + X_m with layer-ordered heaps

Selection on X_1+X_2+... + X_m is an important problem with many applica...

Selection on X_1 + X_1 + ⋯ X_m via Cartesian product tree

Selection on the Cartesian product is a classic problem in computer scie...

A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon

The geodesic Voronoi diagram of m point sites inside a simple polygon of...

The new methods for equity fund selection and optimal portfolio construction

We relook at the classic equity fund selection and portfolio constructio...

Isolated Suborders and their Application to Counting Closure Operators

In this paper we investigate the interplay between isolated suborders an...