Pages that link to "Item:Q1897476"
From MaRDI portal
The following pages link to On-line construction of suffix trees (Q1897476):
Displaying 50 items.
- Online timestamped text indexing (Q294884) (← links)
- The property suffix tree with dynamic properties (Q294931) (← links)
- Order-preserving indexing (Q294954) (← links)
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Palindrome pattern matching (Q390901) (← links)
- String analysis by sliding positioning strategy (Q394977) (← links)
- On-line construction of position heaps (Q396632) (← links)
- Reverse engineering of compact suffix trees and links: a novel algorithm (Q405568) (← links)
- On-line suffix tree construction with reduced branching (Q414471) (← links)
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
- On demand string sorting over unbounded alphabets (Q418735) (← links)
- PSIST: a scalable approach to indexing protein structures using suffix trees (Q436643) (← links)
- 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)
