Pages that link to "Item:Q3550827"

The following pages link to Fast Lightweight Suffix Array Construction and Checking (Q3550827):

Displaying 24 items.

• A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
• Computing runs on a general alphabet (Q903195) (← links)
• Counting suffix arrays and strings (Q932319) (← links)
• Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
• Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
• On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation (Q1944955) (← links)
• Dynamic and internal longest common substring (Q2211363) (← links)
• An elegant algorithm for the construction of suffix arrays (Q2250537) (← links)
• Faster semi-external suffix sorting (Q2445902) (← links)
• The complexity of minimum difference cover (Q2458927) (← links)
• Fast BWT in small space by blockwise suffix sorting (Q2465056) (← links)
• Faster suffix sorting (Q2465058) (← links)
• Constructing suffix arrays in linear time (Q2569391) (← links)
• Distributed suffix trees (Q2569396) (← links)
• Tight lower bounds for the longest common extension problem (Q2628282) (← links)
• Optimal in-place suffix sorting (Q2672235) (← links)
• Faster Lightweight Lempel-Ziv Parsing (Q2946413) (← links)
• Longest common substring made fully dynamic (Q5075739) (← links)
• (Q5090335) (← links)
• Small-space LCE data structure with constant-time queries (Q5111224) (← links)
• Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
• Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930) (← links)
• Space efficient algorithms for the Burrows-Wheeler backtransformation (Q5961973) (← links)
• Near-optimal quantum algorithms for string problems (Q6174814) (← links)