DeepAI AI Chat
Log In Sign Up

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

04/16/2020
by   Patrick Kreitzberg, et al.
University of Montana
0

The theoretical computation of isotopic distribution of compounds is crucial in many important applications of mass spectrometry, especially as machine precision grows. A considerable amount of good tools have been created in the last decade for doing so. In this paper we present a novel algorithm for calculating the top k peaks of a given compound. The algorithm takes advantage of layer-ordered heaps used in an optimal method of selection on X+Y and is able to efficiently calculate the top k peaks on very large molecules. Among its peers, this algorithm shows a significant speedup on molecules whose elements have many isotopes. The algorithm obtains a speedup of more than 31x when compared to IsoSpec on Au2Ca10Ga10Pd76 when computing 47409787 peaks, which covers 0.999 of the total abundance.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/27/2020

Optimal construction of a layer-ordered heap

The layer-ordered heap (LOH) is a simple, recently proposed data structu...
01/30/2020

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

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

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...
11/17/2019

Optimizing Ordered Graph Algorithms with GraphIt

Many graph problems can be solved using ordered parallel graph algorithm...
11/17/2019

PriorityGraph: A Unified Programming Model for Optimizing Ordered Graph Algorithms

Many graph problems can be solved using ordered parallel graph algorithm...
10/23/2018

Exploiting the Space Filling Curve Ordering of Particles in the Neighbour Search of Gadget3

Gadget3 is nowadays one of the most frequently used high performing para...