Pages that link to "Item:Q1897476"
From MaRDI portal
The following pages link to On-line construction of suffix trees (Q1897476):
Displaying 50 items.
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- Truncated suffix trees and their application to data compression. (Q1401392) (← links)
- Linear bidirectional on-line construction of affix trees (Q1424249) (← links)
- On maximal repeats in strings (Q1603378) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- DNA paired fragment assembly using graph theory (Q1662696) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- Finding maximal 2-dimensional palindromes (Q1740657) (← links)
- A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
- \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity (Q1748195) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295) (← links)
- The suffix binary search tree and suffix AVL tree (Q1827266) (← links)
- A speed-up for the commute between subword trees and DAWGs. (Q1853059) (← links)
- Reducing space for index implementation. (Q1853739) (← links)
- Generalization of a suffix tree for RNA structural pattern matching (Q1879353) (← links)
- A linear time lower bound on McCreight and general updating algorithms for suffix trees (Q1879368) (← links)
- Data structures and algorithms for the string statistics problem (Q1913702) (← links)
- A comparison of imperative and purely functional suffix tree constructions (Q1916355) (← links)
- On-line construction of parameterized suffix trees for large alphabets (Q1944073) (← links)
- The indexing for one-dimensional proportionally-scaled strings (Q1944891) (← links)
- Efficient enumeration of maximal induced bicliques (Q1983137) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Quick greedy computation for minimum common string partition (Q2015138) (← links)
- Mining full, inner and tail periodic patterns with perfect, imperfect and asynchronous periodicity simultaneously (Q2036759) (← links)
- Efficient pattern matching in elastic-degenerate strings (Q2042726) (← links)
- The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
- Computing minimal unique substrings for a sliding window (Q2118202) (← links)
- Shortest unique palindromic substring queries in semi-dynamic settings (Q2169977) (← links)
- Linear time construction of indexable elastic founder graphs (Q2169983) (← links)
- 2-dimensional palindromes with \(k\) mismatches (Q2203604) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- I/O-efficient data structures for non-overlapping indexing (Q2220773) (← links)
- Towards a real time algorithm for parameterized longest common prefix computation (Q2220836) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Palindromic trees for a sliding window and its applications (Q2234804) (← links)
- Succinct non-overlapping indexing (Q2285052) (← links)
- Absent words in a sliding window with applications (Q2288209) (← links)
- Indexing weighted sequences: neat and efficient (Q2288210) (← links)
- Two-dimensional maximal repetitions (Q2297850) (← links)
- Counter based suffix tree for DNA pattern repeats (Q2304543) (← links)
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts (Q2309475) (← links)
- Off-line and on-line algorithms for closed string factorization (Q2326384) (← links)
- Sliding suffix tree (Q2331636) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)
- Dictionary matching with a few gaps (Q2346375) (← links)
- Suffix trays and suffix trists: structures for faster text indexing (Q2354023) (← links)
