Pages that link to "Item:Q2569393"

The following pages link to Space efficient linear time construction of suffix arrays (Q2569393):

Displaying 50 items.

• Optimal suffix sorting and LCP array construction for constant alphabets (Q344531) (← links)
• Lightweight algorithms for constructing and inverting the BWT of string collections (Q390898) (← links)
• A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
• A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914) (← links)
• Inducing enhanced suffix arrays for string collections (Q526901) (← links)
• A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
• The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
• Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
• On suffix extensions in suffix trees (Q714837) (← links)
• Counting suffix arrays and strings (Q932319) (← links)
• Computing longest previous factor in linear time and applications (Q963336) (← links)
• Dynamic extended suffix arrays (Q972366) (← links)
• Errata for ``Faster index for property matching'' (Q989567) (← links)
• A space and time efficient algorithm for constructing compressed suffix arrays (Q996703) (← links)
• Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
• Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
• Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
• Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
• Computing the original eBWT faster, simpler, and with less memory (Q2146134) (← links)
• An elegant algorithm for the construction of suffix arrays (Q2250537) (← links)
• Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
• Suffix trays and suffix trists: structures for faster text indexing (Q2354023) (← links)
• Faster index for property matching (Q2380078) (← links)
• Indexing factors with gaps (Q2391183) (← links)
• Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
• Locating maximal approximate runs in a string (Q2410363) (← links)
• Parallel algorithms for Burrows-Wheeler compression and decompression (Q2437742) (← links)
• Faster semi-external suffix sorting (Q2445902) (← 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)
• Constructing suffix arrays in linear time (Q2569391) (← links)
• Optimal in-place suffix sorting (Q2672235) (← links)
• The parameterized suffix tray (Q2692728) (← links)
• An Opportunistic Text Indexing Structure Based on Run Length Encoding (Q2947038) (← links)
• Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
• The longest common substring problem (Q2971067) (← links)
• Lightweight BWT Construction for Very Large String Collections (Q3011856) (← links)
• Kings, Name Days, Lazy Servants and Magic (Q3305728) (← links)
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (Q3401100) (← links)
• THE VIRTUAL SUFFIX TREE (Q3655540) (← links)
• Forty Years of Text Indexing (Q4928554) (← links)
• (Q5088917) (← links)
• Spaces, Trees, and Colors (Q5176183) (← links)
• Inducing Suffix and LCP Arrays in External Memory (Q5266606) (← links)
• The “Runs” Theorem (Q5359492) (← links)
• Indexing Circular Patterns (Q5452151) (← links)
• Combinatorial Pattern Matching (Q5713569) (← links)
• Efficient construction of the BWT for repetitive text using string compression (Q6077847) (← links)
• Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)
• Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets (Q6536267) (← links)