Pages that link to "Item:Q3455222"

The following pages link to Linear work suffix array construction (Q3455222):

Displaying 50 items.

• One-variable word equations in linear time (Q261339) (← links)
• Order-preserving pattern matching with \(k\) mismatches (Q294955) (← links)
• Compressed property suffix trees (Q386003) (← links)
• Lightweight algorithms for constructing and inverting the BWT of string collections (Q390898) (← links)
• Design and analysis of periodic multiple seeds (Q393900) (← links)
• The pseudopalindromic completion of regular languages (Q476182) (← links)
• An algorithmic toolbox for periodic partial words (Q477348) (← links)
• \(k\)-abelian pattern matching (Q491150) (← links)
• Binary block order Rouen transform (Q507387) (← links)
• Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
• Inducing enhanced suffix arrays for string collections (Q526901) (← links)
• A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
• On suffix extensions in suffix trees (Q714837) (← links)
• Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
• Blocksequences of \(k\)-local words (Q831795) (← links)
• A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
• Dynamic extended suffix arrays (Q972366) (← links)
• Errata for ``Faster index for property matching'' (Q989567) (← links)
• Searching for gapped palindromes (Q1038475) (← links)
• Extended suffix array construction using Lyndon factors (Q1615410) (← links)
• Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
• A survey of string orderings and their application to the Burrows-Wheeler transform (Q1698705) (← links)
• Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets (Q1702853) (← links)
• Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
• Hide and seek with repetitions (Q1713479) (← links)
• Universal compressed text indexing (Q1729689) (← links)
• \(p\)-suffix sorting as arithmetic coding (Q1932361) (← links)
• Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
• Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q2112180) (← links)
• Efficient computation of sequence mappability (Q2134748) (← links)
• Efficient chain code compression with interpolative coding (Q2195467) (← links)
• Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
• Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
• Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
• Universal reconstruction of a string (Q2297860) (← links)
• The alternating BWT: an algorithmic perspective (Q2297865) (← links)
• Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
• Suffix trays and suffix trists: structures for faster text indexing (Q2354023) (← links)
• Engineering a lightweight external memory suffix array construction algorithm (Q2363989) (← links)
• Faster average case low memory semi-external construction of the Burrows-Wheeler transform (Q2363991) (← links)
• Faster index for property matching (Q2380078) (← links)
• Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
• Parallel algorithms for Burrows-Wheeler compression and decompression (Q2437742) (← links)
• A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
• Simple and efficient LZW-compressed multiple pattern matching (Q2442814) (← links)
• Time-space trade-offs for longest common extensions (Q2442815) (← links)
• Prefix-suffix duplication (Q2453545) (← links)
• Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (Q2456365) (← links)
• Fast BWT in small space by blockwise suffix sorting (Q2465056) (← links)
• Faster suffix sorting (Q2465058) (← links)