Results 11 to 20 of about 1,556 (153)
Replacing suffix trees with enhanced suffix arrays
Journal of Discrete Algorithms, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Kurtz, Enno Ohlebusch
exaly +2 more sources
RECONSTRUCTING A SUFFIX ARRAY [PDF]
International Journal of Foundations of Computer Science, 2006 For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a suffix tree or suffix array should occur in lexicographical order (lexorder). It thus becomes of interest to study possible alternate orderings of the suffixes in these data structures,
Franěk, F., Smyth, W.F.
openaire +2 more sources
Fast Hybrid Data Structure for a Large Alphabet K-Mers Indexing for Whole Genome Alignment
IEEE Access, 2021 The most common index data structures used by whole genome aligners (WGA) are based on suffix trees (ST), suffix arrays, and FM-indexes. These data structures show good performance results as WGA works with sequences of letters over small alphabets; for ...
Rostislav Hrivnak +2 more
doaj +1 more source
Suffix Arrays in Parallel [PDF]
, 2003 Suffix arrays are powerful data structures for text indexing. In this paper we present parallel algorithms devised to increase throughput of suffix arrays on a multiple-query setting. Experimental results show that efficient performance is indeed feasible in this strongly sequential and very poor locality data structure.
Mauricio Marín, Gonzalo Navarro 0001
openaire +1 more source
GHOSTX: an improved sequence homology search algorithm using a query suffix array and a database suffix array. [PDF]
PLoS ONE, 2014 DNA sequences are translated into protein coding sequences and then further assigned to protein families in metagenomic analyses, because of the need for sensitivity.
Shuji Suzuki +3 more
doaj +1 more source
Computing and Informatics, 2019 The suffix array is a classic full-text index, combining effectiveness with simplicity. We discuss three approaches aiming to improve its efficiency even more: changes to the navigation, data layout and adding extra data. In short, we show that i) the way how we search for the right interval boundary impacts significantly the overall search speed, ii ...
Kowalski, Tomasz M. +2 more
openaire +2 more sources
Generalized enhanced suffix array construction in external memory
Algorithms for Molecular Biology, 2017 Background Suffix arrays, augmented by additional data structures, allow solving efficiently many string processing problems. The external memory construction of the generalized suffix array for a string collection is a fundamental task when the size of ...
Felipe A. Louza +3 more
doaj +1 more source
CoRR, 2016 The suffix array is a classic full-text index, combining effectiveness with simplicity. We discuss three approaches aiming to improve its efficiency even more: changes to the navigation, data layout and adding extra data. In short, we show that $(i)$ how we search for the right interval boundary impacts significantly the overall search speed, $(ii)$ a ...
Tomasz Marek Kowalski +3 more
openaire +2 more sources
Suffix-Sorting via Shannon-Fano-Elias Codes
Algorithms, 2010 Given a sequence T = t0t1 . . . tn-1 of size n = |T|, with symbols from a fixed alphabet Σ, (|Σ| ≤ n), the suffix array provides a listing of all the suffixes of T in a lexicographic order.
Donald Adjeroh, Fei Nan
doaj +1 more source
TOPAZ: asymmetric suffix array neighbourhood search for massive protein databases
BMC Bioinformatics, 2018 Background Protein homology search is an important, yet time-consuming, step in everything from protein annotation to metagenomics. Its application, however, has become increasingly challenging, due to the exponential growth of protein databases.
Alan Medlar, Liisa Holm
doaj +1 more source