Pages that link to "Item:Q1104104"
From MaRDI portal
The following pages link to Parallel construction of a suffix tree with applications (Q1104104):
Displaying 26 items.
- Optimal parallel randomized renaming (Q290183) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- On similarity of polynomial configurations (Q688225) (← links)
- Parallel construction of minimal suffix and factor automata (Q911778) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198) (← links)
- Optimal algorithms for computing the canonical form of a circular string (Q1190455) (← links)
- An efficient algorithm for the all pairs suffix-prefix problem (Q1190509) (← links)
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- An efficient parallel algorithm for the single function coarsest partition problem (Q1329732) (← links)
- On two-dimensional pattern matching by optimal parallel algorithms (Q1334677) (← links)
- Pattern matching in a digitized image (Q1336966) (← links)
- Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
- Efficient text fingerprinting via Parikh mapping (Q1827267) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Counter based suffix tree for DNA pattern repeats (Q2304543) (← links)
- Fast parallel Lyndon factorization with applications (Q4327381) (← links)
- Optimal parallel algorithms for Prefix Matching (Q4632427) (← links)
- On the construction of classes of suffix trees for square matrices: Algorithms and applications (Q4645171) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- Searching Long Repeats in Streams (Q5088923) (← links)
- On-line construction of two-dimensional suffix trees (Q5906373) (← links)
- Optimal parallel suffix tree construction (Q5906825) (← links)
- Parallelism and dictionary based data compression (Q5944436) (← links)
