Pages that link to "Item:Q3142586"
From MaRDI portal
The following pages link to Suffix Arrays: A New Method for On-Line String Searches (Q3142586):
Displaying 50 items.
- All-pairs suffix/prefix in optimal time using Aho-Corasick space (Q2169425) (← links)
- Using compressed suffix-arrays for a compact representation of temporal-graphs (Q2200556) (← links)
- Efficient online string matching based on characters distance text sampling (Q2205639) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- Succinct non-overlapping indexing (Q2285052) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Refining the \(r\)-index (Q2297853) (← 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)
- On the size of the smallest alphabet for Lyndon trees (Q2326391) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Bottom-\(k\) document retrieval (Q2343302) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
- Suffix trays and suffix trists: structures for faster text indexing (Q2354023) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- Top-\(k\) term-proximity in succinct space (Q2362352) (← 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)
- On position restricted substring searching in succinct space (Q2376796) (← links)
- Faster index for property matching (Q2380078) (← links)
- Indexing factors with gaps (Q2391183) (← links)
- Parallel lightweight wavelet tree, suffix array and FM-index construction (Q2397146) (← links)
- Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- Algorithms to compute the Burrows-Wheeler similarity distribution (Q2420649) (← links)
- Linking indexing data structures to de Bruijn graphs: construction and update (Q2424683) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Compressed text indexing with wildcards (Q2434928) (← links)
- Wavelet trees for all (Q2442812) (← links)
- On the combinatorics of suffix arrays (Q2445335) (← 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)
- Rank and select revisited and extended (Q2465064) (← links)
- Freeness of partial words (Q2465643) (← links)
- The affix array data structure and its applications to RNA secondary structure analysis (Q2465645) (← links)
- GAME: A simple and efficient whole genome alignment method using maximal exact match filtering (Q2500318) (← links)
- Constructing suffix arrays in linear time (Q2569391) (← links)
- Space efficient linear time construction of suffix arrays (Q2569393) (← links)
- Indexing text with approximate \(q\)-grams (Q2569395) (← links)
- Lightweight LCP construction for very large collections of strings (Q2628803) (← links)
- An improved algorithm for the all-pairs suffix-prefix problem (Q2628805) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- LZRR: LZ77 parsing with right reference (Q2672241) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- The parameterized suffix tray (Q2692728) (← links)
