Results 41 to 50 of about 40,875 (196)
Linear-Time Text Compression by Longest-First Substitution
Algorithms, 2009 We consider grammar-based text compression with longest first substitution (LFS), where non-overlapping occurrences of a longest repeating factor of the input text are replaced by a new non-terminal symbol.
Ayumi Shinohara +5 more
doaj +1 more source
Representing the suffix tree with the CDAWG
CoRR, 2017 Given a string $T$, it is known that its suffix tree can be represented using the compact directed acyclic word graph (CDAWG) with $e_T$ arcs, taking overall $O(e_T+e_{\overline{T}})$ words of space, where ${\overline{T}}$ is the reverse of $T$, and supporting some key operations in time between $O(1)$ and $O(\log{\log{n}})$ in the worst case.
Belazzougui, Djamal, Cunial, Fabio
openaire +4 more sources
Health Informatics Journal, 2022 Alzheimer’s disease (AD) is one of the most common forms of dementia contributing to more than 70% of the cases. The factors accounting for the cause and progression of neurodegenerative diseases like AD are primarily genetic, in addition to life style ...
Jayashree P +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
40 years of suffix trees [PDF]
Communications of the ACM, 2016 Tracing the first four decades in the life of suffix trees, their many incarnations, and their applications.
Alberto Apostolico +4 more
openaire +3 more sources
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
A Minimal Periods Algorithm with Applications [PDF]
, 2009 Kosaraju in ``Computation of squares in a string'' briefly described a linear-time algorithm for computing the minimal squares starting at each position in a word.
A. Apostolico +20 more
core +1 more source
Compressed property suffix trees
Information and Computation, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wing-Kai Hon +3 more
openaire +2 more sources
BuST-Bundled Suffix Trees [PDF]
, 2006 We introduce a data structure, the Bundled Suffix Tree (BUST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a non-transitive relation ≈ among its letters. Following the path of a substring β within a BUST, constructed over a text α of length n, not only the positions of the exact occurrences of β in
Luca Bortolussi +2 more
openaire +2 more sources
Feature-Based and String-Based Models for Predicting RNA-Protein Interaction
Molecules, 2018 In this work, we study two approaches for the problem of RNA-Protein Interaction (RPI). In the first approach, we use a feature-based technique by combining extracted features from both sequences and secondary structures.
Donald Adjeroh +6 more
doaj +1 more source