Results 21 to 30 of about 37,210 (201)
Shortest Unique Substring Query Revisited [PDF]
, 2014 We revisit the problem of finding shortest unique substring (SUS) proposed recently by [6]. We propose an optimal $O(n)$ time and space algorithm that can find an SUS for every location of a string of size $n$. Our algorithm significantly improves the $O(
İleri, Atalay Mert +2 more
core +3 more sources
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 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
CGAP-align: a high performance DNA short read alignment tool. [PDF]
PLoS ONE, 2013 Next generation sequencing platforms have greatly reduced sequencing costs, leading to the production of unprecedented amounts of sequence data. BWA is one of the most popular alignment tools due to its relatively high accuracy.
Yaoliang Chen +7 more
doaj +1 more source
Faster External Memory LCP Array Construction [PDF]
, 2016 The suffix array, perhaps the most important data structure in modern string processing, needs to be augmented with the longest-common-prefix (LCP) array in many applications. Their construction is often a major bottleneck especially when the data is too
, Kempa, Dominik
core +1 more source
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 +2 more sources
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
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
Wavelet Trees Meet Suffix Trees [PDF]
, 2015 We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings.
Babenko, Maxim +3 more
core +1 more source
RANCANG BANGUN APLIKASI PENCARIAN DOKUMEN BERBASIS WEB MENGGUNAKAN METODE SUFFIX CACTUS CLUSTERING
JUTI: Jurnal Ilmiah Teknologi Informasi, 2003 Salah satu bagian dari temu kembali (retrieval) informasi adalah menyajikan data hasil pencarian dengan cara mengelompokkan (clustering) seluruh dokumen hasil pencarian sesuai dengan kemiripan antar dokumen.
F. X. Arunanto, Agus Widodo
doaj +1 more source