Results 111 to 120 of about 735,070 (175)
Abstract Magmatic underplating beneath the Hawaiian Ridge has been inferred from early active‐source and teleseismic studies, whereas more recent active‐source seismic imaging and reprocessed legacy data have not identified a distinct underplated layer.
Megumi Fujimoto, Robert A. Dunn
wiley +1 more source
ABSTRACT Novel pathogens have become a major challenge faced by wildlife in the Anthropocene. White‐nose syndrome (WNS) has decimated bat populations across North America over the last two decades. Demographic and physiological evidence of adaptation in one heavily affected species, Myotis lucifugus, has prompted multiple attempts to delineate the ...
Samantha L. R. Capel +9 more
wiley +1 more source
Search algorithm using a suffix array.
Search algorithm using a suffix array.
Yutaka Akiyama (323798) +3 more
core +1 more source
The Suffix Tree Data Structure: Theory and Practice
openLa tesi affronta lo studio delle strutture dati per l’indicizzazione di stringhe, concentrandosi sui Suffix Tree e, in particolarmente sulla sua variante compressa: Compressed Suffix Tree.
YE, XIAOJUN
core
Suffix Tree Construction and Storage with Limited Main Memory [PDF]
Schürmann K-B, Stoye J. Suffix Tree Construction and Storage with Limited Main Memory. Forschungsberichte. Bielefeld: Technische Fakultät der Universität Bielefeld; 2003.Suffix trees have been established as one of the most versatile index structures for
Schürmann, Klaus-Bernd +1 more
core
The Enhanced Suffix Array and Its Applications to Genome Analysis
In large scale applications as computational genome analysis, the space requirement of the suffix tree is a severe drawback. In this paper, we present a uniform framework that enables us to systematically replace every string processing algorithm that is
Enno Ohlebusch +2 more
core +1 more source
Auxiliary data structures for improved suffix array query performance [PDF]
The suffix array is a space-efficient data structure that provides fast access to all occurrences of a search pattern in a text. Typically suffix arrays are queried with algorithms based on binary search.
Heino, Lauri
core
Construction of distributed suffix trees
The paper addresses the problem of parallel suffix tree construction over large text arrays without the use of cluster infrastructure. The evolution of relevant algorithms is analysed – from the single-threaded methods of Weiner, McCreight, and Ukkonen ...
D.V. Zvazhii, O.M. Malii
doaj +1 more source
Compressed Suffix Arrays for Massive Data [PDF]
We present a fast space-efficient algorithm for constructing compressed suffix arrays (CSA). The algorithm requires O (n logn ) time in the worst case, and only O (n ) bits of extra space in addition to the CSA. As the basic step, we describe an algorithm for merging two CSAs.
openaire +2 more sources
An incomplex algorithm for fast suffix array construction
Schürmann K-B, Stoye J. An incomplex algorithm for fast suffix array construction. SOFTWARE-PRACTICE & EXPERIENCE. 2007;37(3):309-329.The suffix array of a string is a permutation of all starting positions of the string's suffixes that are ...
Jens Stoye +3 more
core +1 more source

