Results 31 to 40 of about 735,070 (175)
Sampling the Suffix Array with Minimizers [PDF]
, 2015 Sampling (evenly) the suffixes from the suffix array is an old idea trading the pattern search time for reduced index space. A few years ago Claude et al. showed an alphabet sampling scheme allowing for more efficient pattern searches compared to the sparse suffix array, for long enough patterns.
Szymon Grabowski, Marcin Raniszewski
openaire +4 more sources
On An Improved Parallel Construction Of Suffix Arrays For Low Bandwidth Pc-Cluster. [PDF]
, 2003 An algorithm for the parallel construction of suffix arrays generation for any texts with larger alphabet size on distributed memory architecture is ...
Md. Ali, Norhashidah +3 more
core +1 more source
IEEE Access, 2020 In order to achieve content-based binocular stereoscopic image or video retrieval efficiently, a feature indexing algorithm based on hybrid grid multiple suffix tree and hierarchical clustering is proposed.
Fengfeng Duan, Qicong Zhang
doaj +1 more source
RNA-Seq mapping and detection of gene fusions with a suffix array algorithm. [PDF]
PLoS Computational Biology, 2012 High-throughput RNA sequencing enables quantification of transcripts (both known and novel), exon/exon junctions and fusions of exons from different genes.
Onur Sakarya +23 more
doaj +1 more source
Analisi sperimentale delle prestazioni di un suffix tree troncato [PDF]
, 2022 Le strutture dati sono un ambito di ricerca estremamente vivo, poiché adatte a risolvere un ampio numero di problemi d'indicizzazione. Tra le varie strutture dati, particolare rilevanza hanno le strutture dati basate sui suffissi, che si prestano ...
Zucchetto, Daniel
core
Pengkontruksian Bidirected Overlap Graph untuk Perakitan Sekuens DNA
Jurnal Teknologi Informasi dan Ilmu Komputer, 2020 De novo DNA (Deoxyribonucleic Acid) sequence assembly atau perakitan sekuens DNA secara De novo adalah tahapan yang sangat penting dalam analisis sekuens DNA.
Wisnu Ananta Kusuma, Albert Adrianus
doaj +1 more source
Linear-time Suffix Sorting - A New Approach for Suffix Array Construction [PDF]
, 2016 This paper presents a new approach for linear-time suffix sorting. It introduces a new sorting principle that can be used to build the first non-recursive linear-time suffix array construction algorithm named GSACA. Although GSACA cannot keep up with the
Baier, Uwe
core +1 more source
Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX - NAACL '07, 2007 Suppose we have a large dictionary of strings. Each entry starts with a figure of merit (popularity). We wish to find the k-best matches for a substring, s, in a dictinoary, dict. That is, grep s dict | sort -n | head -k, but we would like to do this in sublinear time.
Kenneth Ward Church +2 more
openaire +2 more sources
FM-Index Reveals the Reverse Suffix Array [PDF]
, 2020 Given a text T[1,n] over an alphabet Σ of size σ, the suffix array of T stores the lexicographic order of the suffixes of T. The suffix array needs Θ(nlog n) bits of space compared to the n log σ bits needed to store T itself.
Gibney, Daniel +4 more
core +1 more source
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