scientific article; zbMATH DE number 1786458
From MaRDI portal
Publication:4547749
Recommendations
Cited in
(only showing first 100 items - show all)- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- Lossless filter for multiple repetitions with Hamming distance
- Faster entropy-bounded compressed suffix trees
- Extended suffix array construction using Lyndon factors
- Computing longest common extensions in partial words
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- On string matching with mismatches
- Computing regularities in strings: a survey
- Computing the longest previous factor
- Variations of the parameterized longest previous factor
- Computing longest previous non-overlapping factors
- Computing the multi-string BWT and LCP array in external memory
- The exact multiple pattern matching problem solved by a reference tree approach
- Faster online computation of the succinct longest previous factor array
- Quantum algorithm for learning secret strings and its experimental demonstration
- Efficient computation of sequence mappability
- All-pairs suffix/prefix in optimal time using Aho-Corasick space
- Space-efficient construction of compressed suffix trees
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings
- Efficient computation of longest single-arm-gapped palindromes in a string
- Longest property-preserved common factor: a new string-processing framework
- Approximate periodicity
- Faster average case low memory semi-external construction of the Burrows-Wheeler transform
- Computing the longest common prefix array based on the Burrows-Wheeler transform
- Efficient computation of substring equivalence classes with suffix arrays
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel
- Compressing table data with column dependency
- Constructing suffix arrays in linear time
- Space efficient linear time construction of suffix arrays
- One-variable word equations in linear time
- Lightweight LCP construction for very large collections of strings
- An improved algorithm for the all-pairs suffix-prefix problem
- LZRR: LZ77 parsing with right reference
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- Computing minimal and maximal suffixes of a substring
- Computing longest single-arm-gapped palindromes in a string
- Lempel-Ziv Factorization Revisited
- Sparse and truncated suffix trees on variable-length codes
- scientific article; zbMATH DE number 7228439 (Why is no real title available?)
- Full-text indexes for high-throughput sequencing
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
- Optimal suffix sorting and LCP array construction for constant alphabets
- Computing Longest Common Substrings Via Suffix Arrays
- An Online Algorithm for Finding the Longest Previous Factors
- Sampled Longest Common Prefix Array
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Permuted Longest-Common-Prefix Array
- Efficient algorithms for three variants of the LPF table
- On the number of elements to reorder when updating a suffix array
- Parameterized longest previous factor
- A linearly computable measure of string complexity
- Checking Big Suffix and LCP Arrays by Probabilistic Methods
- Better external memory LCP array construction
- A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
- Using static suffix array in dynamic application: case of text compression by longest first substitution
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time
- A note on the longest common compatible prefix problem for partial words
- Forty Years of Text Indexing
- Efficient pattern matching for RNA secondary structures
- Linear-time computation of prefix table for weighted strings {\&} applications
- Sufficient conditions for efficient indexing under different matchings
- Dichotomic Selection on Words: A Probabilistic Analysis
- Simulating the DNA overlap graph in succinct space
- Small-space LCE data structure with constant-time queries
- Burrows-Wheeler transform and LCP array construction in constant space
- scientific article; zbMATH DE number 7205098 (Why is no real title available?)
- On undetected redundancy in the Burrows-Wheeler transform
- Inducing suffix and LCP arrays in external memory
- LCP array construction in external memory
- Inducing enhanced suffix arrays for string collections
- Space-efficient parallel construction of succinct representations of suffix tree topologies
- A practical semi-external memory method for approximate pattern matching
- Algorithm Theory - SWAT 2004
- A quick tour on suffix arrays and compressed suffix arrays
- Linear time algorithms for generalizations of the longest common substring problem
- Range LCP
- Property Suffix Array with Applications in Indexing Weighted Sequences
- The colored longest common prefix array computed via sequential scans
- Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads
- String Covering: A Survey
- Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions
- The longest common extension problem revisited and applications to approximate string searching
- Fast, practical algorithms for computing all the repeats in a string
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
- r-indexing the eBWT
- Computing all-vs-all MEMs in grammar-compressed text
- Sparse suffix and LCP array: simple, direct, small, and fast
- Matching statistics -- a survey
- Exploiting new properties of string net frequency for efficient computation
- Gapped string indexing in subquadratic space and sublinear query time
- Formally verified suffix array construction
- Locally consistent parsing for text indexing in small space
- Solving one variable word equations in the free group in cubic time
- Sparse suffix and LCP array: simple, direct, small, and fast
- New results on Nyldon words and Nyldon-like sets
- Computing suffix links for suffix trees and arrays
- Replacing suffix trees with enhanced suffix arrays
- Counting suffix arrays and strings
- Computing longest previous factor in linear time and applications
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547749)
