Pages that link to "Item:Q3550835"

The following pages link to Linear-Time Construction of Suffix Arrays (Q3550835):

Displaying 32 items.

• Lightweight algorithms for constructing and inverting the BWT of string collections (Q390898) (← links)
• Efficient algorithms for three variants of the LPF table (Q414447) (← links)
• On demand string sorting over unbounded alphabets (Q418735) (← links)
• A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
• Linear time algorithms for generalizations of the longest common substring problem (Q547294) (← links)
• Approximate string matching using compressed suffix arrays (Q818136) (← links)
• A metric index for approximate string matching (Q818138) (← links)
• Construction of Aho Corasick automaton in linear time for integer alphabets (Q844159) (← links)
• Computing suffix links for suffix trees and arrays (Q845941) (← links)
• Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
• Text indexing with errors (Q925060) (← links)
• Fast profile matching algorithms - A survey (Q932308) (← links)
• Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
• Lossless filter for multiple repetitions with Hamming distance (Q1018103) (← links)
• Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
• Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
• Computing regularities in strings: a survey (Q1761494) (← links)
• Computing the longest previous factor (Q1761495) (← links)
• A note on the Burrows-Wheeler transformation (Q1770410) (← links)
• An elegant algorithm for the construction of suffix arrays (Q2250537) (← links)
• Locating maximal approximate runs in a string (Q2410363) (← links)
• On the combinatorics of suffix arrays (Q2445335) (← links)
• Faster suffix sorting (Q2465058) (← links)
• The affix array data structure and its applications to RNA secondary structure analysis (Q2465645) (← links)
• Space efficient linear time construction of suffix arrays (Q2569393) (← links)
• Optimal in-place suffix sorting (Q2672235) (← links)
• A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm (Q2942275) (← links)
• Lightweight BWT Construction for Very Large String Collections (Q3011856) (← links)
• Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
• Linear Time Suffix Array Construction Using D-Critical Substrings (Q3637104) (← links)
• (Q5088917) (← links)
• The “Runs” Theorem (Q5359492) (← links)