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):
Displayed 50 items.
- Document retrieval with one wildcard (Q287451) (← links)
- The property suffix tree with dynamic properties (Q294931) (← links)
- Less space: indexing for queries with wildcards (Q300263) (← links)
- Closed factorization (Q313756) (← links)
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- Optimal suffix sorting and LCP array construction for constant alphabets (Q344531) (← links)
- Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
- Compressed property suffix trees (Q386003) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- String matching with alphabet sampling (Q414445) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics (Q418161) (← links)
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- On demand string sorting over unbounded alphabets (Q418735) (← links)
- Parameterized longest previous factor (Q441845) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- Efficient pattern matching for RNA secondary structures (Q500967) (← links)
- Tighter bounds for the sum of irreducible LCP values (Q507409) (← links)
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Inducing enhanced suffix arrays for string collections (Q526901) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- Position heaps: a simple and dynamic text indexing data structure (Q533414) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- A linear size index for approximate pattern matching (Q655440) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← 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)
- Efficient parameterized string matching (Q845838) (← links)
- Computing suffix links for suffix trees and arrays (Q845941) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Indexing text using the Ziv--Lempel trie (Q876708) (← links)
- Succinct data structures for flexible text retrieval systems (Q924538) (← links)
- Text indexing with errors (Q925060) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- Computing longest previous factor in linear time and applications (Q963336) (← links)
- Errata for ``Faster index for property matching'' (Q989567) (← links)
- Wee LCP (Q991794) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)