Pages that link to "Item:Q2569391"
From MaRDI portal
The following pages link to Constructing suffix arrays in linear time (Q2569391):
Displaying 30 items.
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
- Inducing enhanced suffix arrays for string collections (Q526901) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Efficient indexing algorithms for one-dimensional discretely-scaled strings (Q765528) (← 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)
- Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- The indexing for one-dimensional proportionally-scaled strings (Q1944891) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← 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)
- 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)
- The parameterized suffix tray (Q2692728) (← links)
- Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
- The longest common substring problem (Q2971067) (← links)
- THE VIRTUAL SUFFIX TREE (Q3655540) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- Spaces, Trees, and Colors (Q5176183) (← links)
- Indexing Circular Patterns (Q5452151) (← links)
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets (Q6536267) (← links)
