SPLASH, a hashed identifier for mass spectra
نویسندگان
چکیده
منابع مشابه
Reference Hashed
This paper argues for a novel data structure for the representation of discourse referents. A so-called hashing list is employed to store discourse referents according to their grammatical features. The account proposed combines insights from several theories of discourse comprehension. Segmented Discourse Representation Theory (Asher, 1993) is enriched by the ranking system developed in center...
متن کاملPOSITIVE AND NEGATIVE ION MASS SPECTRA OF RING - SUBSTITUTED NITROBENZENES
The 70 ev positive and negative ion mass spectra of ring-substituted nitrobenzenes were studied. The influence of the substituent group on the fragmentation modes of the molecular ions is discussed. The effect of pressure in the formation of negative ions was also studied. As expected, the ratio of fragment ions to negative molecular ions decreased with increasing pressure in ion source.
متن کاملBitwise Source Separation on Hashed Spectra: An Efficient Posterior Estimation Scheme Using Partial Rank Order Metrics
This paper proposes an efficient bitwise solution to the singlechannel source separation task. Most dictionary-based source separation algorithms rely on iterative update rules during the run time, which becomes computationally costly especially when we employ an overcomplete dictionary and sparse encoding that tend to give better separation results. To avoid such cost we propose a bitwise sche...
متن کاملRandom Indexing Re-Hashed
This paper introduces a modified version of Random Indexing, a technique for dimensionality reduction based on random projections. We here describe how RI can be efficiently implemented using the notion of universal hashing. This eliminates the need to store any random vectors, replacing them instead with a small number of hash-functions, thereby dramatically reducing the memory footprint. We d...
متن کاملAlgorithms for a hashed file with variable-length records
Variable-length records are very frequent in database environments. This work gives a set of algorithms for maintaining a new model of static hashed files designed to accommodate variable-length records. Two special techniques for variable-length records are used. First, records are ordered by length and not by key value, e.g., the shortest (longest) records are stored in the main (overflow) bl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Biotechnology
سال: 2016
ISSN: 1087-0156,1546-1696
DOI: 10.1038/nbt.3689