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