.png){kind=icon}
.png){kind=icon}
Return
Accelerated Isotope Fine Structure Calculation Using Pruned Transition Trees
.png){kind=icon}
PRE
AI
DOI：10.1021/acs.analchem.5b00941.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A fast and memory efficient calculation of theoretical isotope, patterns is crucial for the routine interpretation of mass spectrometric data For high-resolution experiments, calculations must procure the exact masses and probabilities of relevant isotopologues over a wide range of polyisotopic compounds, while pruning low-probable ones. Here, a novel albeit simple treelike structure is introduced to swiftly derive sets of relevant subisotopologues for each element in a molecule, which are then combined to the isotopologues of the full molecule. In Contrast to existing approaches, transitions via single replacements Of the most: abundant isotope per element are used in separable tree branches to derive subisotopologues froth each other. Moreover, the underlying transition trees prevent redundant replacements and permit the detection of the most probable isotopologue in a first phase. A relative threshold can then be exploited in a second parallelized phase for a precise prepruning of large fractions of the remaining subisotopologues. The gain in performance from such early pruning and the lower variation in the distortion of simulated data with use of relative rather than absolute thresholds were validated in a large scale benchmark simulation, unprecedentedly comprising several thousand molecular formulas Both the algorithm and a :wealth of related features are freely available as R-package enviPat and as a user-friendly Web interface.
Keywords:
EFFICIENT CALCULATION
DISTRIBUTIONS
RESOLUTION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.7
Papers:
4.7W
Citations:
15.9W