Linear work suffix array construction
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A \textit{really} simple approximation of smallest grammar
- Combinatorial Pattern Matching
- Parallel computation of the Burrows Wheeler transform in compact space
- The alternating BWT: an algorithmic perspective
- Faster index for property matching
- Efficient computation of longest single-arm-gapped palindromes in a string
- The ``runs theorem
- Efficient computation of substring equivalence classes with suffix arrays
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- A survey of string orderings and their application to the Burrows-Wheeler transform
- Computing suffix links for suffix trees and arrays
- Time-space trade-offs for longest common extensions
- The parameterized suffix tray
- scientific article; zbMATH DE number 7205098 (Why is no real title available?)
- Detecting one-variable patterns
- Binary block order Rouen transform
- Linear-time computation of prefix table for weighted strings {\&} applications
- Universal compressed text indexing
- Longest -gapped repeat and palindrome
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
- Hide and seek with repetitions
- The longest common substring problem
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- Space-efficient conversions from SLPs
- Sparse suffix and LCP array: simple, direct, small, and fast
- Lazy Lempel-Ziv factorization algorithms
- Inducing enhanced suffix arrays for string collections
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Design and analysis of periodic multiple seeds
- A bijective variant of the Burrows-Wheeler transform using V-order
- Fast compressed self-indexes with deterministic linear-time construction
- Kings, name days, lazy servants and magic
- Online algorithms for constructing linear-size suffix trie
- Prefix sorting DFAs: a recursive algorithm
- Efficient computation of sequence mappability
- Substring complexity in sublinear space
- Suffix-sorting via Shannon-Fano-Elias codes
- Space efficient linear time construction of suffix arrays
- One-variable word equations in linear time
- Universal reconstruction of a string
- Universal reconstruction of a string
- Blocksequences of \(k\)-local words
- Parallel algorithms for Burrows-Wheeler compression and decompression
- Indexing Circular Patterns
- Computing longest single-arm-gapped palindromes in a string
- Simple and efficient LZW-compressed multiple pattern matching
- Parallel suffix sorting for large string analytics
- Prefix-suffix duplication
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- scientific article; zbMATH DE number 1947433 (Why is no real title available?)
- Generalised Nyldon words
- A quick tour on suffix arrays and compressed suffix arrays
- String Covering: A Survey
- Searching for gapped palindromes
- scientific article; zbMATH DE number 7559194 (Why is no real title available?)
- Efficient Computation of 2-Covers of a String.
- Space efficient linear time construction of suffix arrays
- Inducing suffix and LCP arrays in external memory
- LCP array construction in external memory
- Quantum algorithm for lexicographically minimal string rotation
- Solving one variable word equations in the free group in cubic time
- A simple algorithm for computing the document array
- On suffix extensions in suffix trees
- Extended suffix array construction using Lyndon factors
- Improved and extended locating functionality on compressed suffix arrays
- Engineering a lightweight external memory suffix array construction algorithm
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
- Property Suffix Array with Applications in Indexing Weighted Sequences
- The virtual suffix tree
- On prefix/suffix-square free words
- Tighter bounds and optimal algorithms for all maximal -gapped repeats and palindromes. Finding all maximal -gapped repeats and palindromes in optimal worst case time on integer alphabets
- Dynamic extended suffix arrays
- Time-Space Trade-Offs for Longest Common Extensions
- Linear-time suffix sorting -- a new approach for suffix array construction
- Lempel-Ziv factorization powered by space efficient suffix trees
- Linear-time construction of suffix arrays (extended abstract)
- Lightweight BWT construction for very large string collections
- Order-preserving pattern matching with \(k\) mismatches
- A new class of searchable and provably highly compressible string transformations
- Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions
- Compressed property suffix trees
- Lightweight LCP construction for very large collections of strings
- An algorithmic toolbox for periodic partial words
- p-suffix sorting as arithmetic coding
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- Computing MEMs and relatives on repetitive text collections
- Subsequences in bounded ranges: matching and analysis problems
- Efficient Computation of Substring Equivalence Classes with Suffix Arrays
- Fast lightweight suffix array construction and checking
- Sparse suffix and LCP array: simple, direct, small, and fast
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
- Lightweight distributed suffix array construction
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings
- Indexing a sequence for mapping reads with a single mismatch
- Errata for ``Faster index for property matching
- \(k\)-abelian pattern matching
- Engineering a lightweight suffix array construction algorithm
- Fast BWT in small space by blockwise suffix sorting
- Linear time online algorithms for constructing linear-size suffix trie
- Fast computation of a string duplication history under no-breakpoint-reuse
This page was built for publication: Linear work suffix array construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455222)
