On the suitability of suffix arrays for lempel-ziv data compression [PDF]
, 2009 Lossless compression algorithms of the Lempel-Ziv (LZ) family are widely used nowadays. Regarding time and memory requirements, LZ encoding is much more demanding than decoding.
D. Gusfield +9 more
core +2 more sources
KVLMM: A Trajectory Prediction Method Based on a Variable-Order Markov Model With Kernel Smoothing
IEEE Access, 2018 With the dramatic proliferation of global positioning system (GPS) devices, a rich range of research has been conducted on the analysis of GPS trajectories.
Xing Wang +3 more
doaj +1 more source
New Algorithms for Position Heaps
, 2013 We present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and reduce the ...
A. Ehrenfeucht +7 more
core +1 more source
Deterministic sub-linear space LCE data structures with efficient construction [PDF]
, 2016 Given a string $S$ of $n$ symbols, a longest common extension query $\mathsf{LCE}(i,j)$ asks for the length of the longest common prefix of the $i$th and $j$th suffixes of $S$. LCE queries have several important applications in string processing, perhaps
Bannai, Hideo +5 more
core +2 more sources
RAPSearch: a fast protein similarity search tool for short reads
BMC Bioinformatics, 2011 Background Next Generation Sequencing (NGS) is producing enormous corpuses of short DNA reads, affecting emerging fields like metagenomics. Protein similarity search--a key step to achieve annotation of protein-coding genes in these short reads, and ...
Choi Jeong-Hyeon, Ye Yuzhen, Tang Haixu
doaj +1 more source
Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array
, 2016 The longest common prefix (LCP) array is a versatile auxiliary data structure in indexed string matching. It can be used to speed up searching using the suffix array (SA) and provides an implicit representation of the topology of an underlying suffix ...
D Okanohara +20 more
core +1 more source
Fully-Functional Suffix Trees and Optimal Text Searching in BWT-runs Bounded Space [PDF]
, 2019 Indexing highly repetitive texts - such as genomic databases, software repositories and versioned text collections - has become an important problem since the turn of the millennium.
Gagie, Travis +2 more
core +3 more sources
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Development of Fingerprint Identification Based on Device Flow in Industrial Control System
Applied Sciences, 2023 With the rapid development of industrial automation technology, a large number of industrial control devices have emerged in cyberspace, but the security of open cyberspace is difficult to guarantee.
Jun Tao +3 more
doaj +1 more source
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings [PDF]
, 2015 We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this structure,
Rubinchik, Mikhail, Shur, Arseny M.
core +1 more source