Pages that link to "Item:Q1897476"
From MaRDI portal
The following pages link to On-line construction of suffix trees (Q1897476):
Displayed 50 items.
- Fast algorithm for partial covers in words (Q493243) (← links)
- Inferring strings from suffix trees and links on a binary alphabet (Q496548) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- Efficiency issues in the KBMAG procedure (Q649584) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Ternary directed acyclic word graphs (Q703500) (← links)
- On average sequence complexity (Q703547) (← links)
- Selected combinatorial problems of computational biology (Q706944) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Suffix tree characterization of maximal motifs in biological sequences (Q732032) (← links)
- Computing the longest common substring with one mismatch (Q764249) (← links)
- Efficient indexing algorithms for one-dimensional discretely-scaled strings (Q765528) (← links)
- A metric index for approximate string matching (Q818138) (← links)
- Construction of Aho Corasick automaton in linear time for integer alphabets (Q844159) (← links)
- Multiple serial episodes matching (Q844201) (← links)
- Computing suffix links for suffix trees and arrays (Q845941) (← links)
- Efficient discovery of unusual patterns in time series (Q857987) (← links)
- Compact directed acyclic word graphs for a sliding window (Q876704) (← links)
- Text indexing with errors (Q925060) (← links)
- Fast profile matching algorithms - A survey (Q932308) (← links)
- Property matching and weighted matching (Q932325) (← links)
- On-line construction of compact suffix vectors and maximal repeats (Q955004) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- Improving on-line construction of two-dimensional suffix trees for square matrices (Q987807) (← links)
- Finding the longest common nonsuperstring in linear time (Q989576) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- Real two dimensional scaled matching (Q1024780) (← links)
- Discovering subword associations in strings in time linear in the output size (Q1026231) (← links)
- Data compression for proof replay (Q1040776) (← links)
- A new method for approximate indexing and dictionary lookup with one error (Q1044734) (← links)
- Matching a set of strings with variable length don't cares (Q1391531) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- Truncated suffix trees and their application to data compression. (Q1401392) (← 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)
- A linear time lower bound on McCreight and general updating algorithms for suffix trees (Q1879368) (← links)