Parallel construction of a suffix tree with applications
From MaRDI portal
Recommendations
Cites work
- A Space-Economical Suffix Tree Construction Algorithm
- Deterministic coin tossing with applications to optimal parallel list ranking
- Finding the maximum, merging, and sorting in a parallel computation model
- scientific article; zbMATH DE number 3864532 (Why is no real title available?)
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 3982538 (Why is no real title available?)
- scientific article; zbMATH DE number 4047160 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3551946 (Why is no real title available?)
- Optimal off-line detection of repetitions in a string
- Parallel Prefix Computation
- Parallelism in Comparison Problems
- Routing, merging, and sorting on parallel models of computation
- Searching, Merging, and Sorting in Parallel Computation
- Structural properties of the string statistics problem
- The Boyer–Moore–Galil String Searching Strategies Revisited
Cited in
(40)- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Efficient parallel algorithms to test square-freeness and factorize strings
- Optimal algorithms for computing the canonical form of a circular string
- An efficient algorithm for the all pairs suffix-prefix problem
- Optimal parallel detection of squares in strings
- Efficient CRCW-PRAM algorithms for universal substring searching
- Parallel construction and query of index data structures for pattern matching on square matrices
- An efficient parallel algorithm for the single function coarsest partition problem
- On two-dimensional pattern matching by optimal parallel algorithms
- Pattern matching in a digitized image
- Sorting strings and constructing digital search trees in parallel
- Efficient text fingerprinting via Parikh mapping
- Fast parallel and serial multidimensional approximate array matching
- Counter based suffix tree for DNA pattern repeats
- Parallel construction of succinct trees
- The subtree max gap problem with application to parallel string covering
- Distributed suffix trees
- Symmetry breaking for suffix tree construction
- Optimal parallel randomized renaming
- scientific article; zbMATH DE number 1003282 (Why is no real title available?)
- Distributed and paged suffix trees for large genetic databases
- scientific article; zbMATH DE number 4047160 (Why is no real title available?)
- scientific article; zbMATH DE number 18629 (Why is no real title available?)
- Fast parallel Lyndon factorization with applications
- Optimal parallel algorithms for prefix matching
- On the construction of classes of suffix trees for square matrices: algorithms and applications
- Forty Years of Text Indexing
- Searching Long Repeats in Streams
- A simple parallel Cartesian tree algorithm and its application to suffix tree construction
- Space-efficient parallel construction of succinct representations of suffix tree topologies
- A quick tour on suffix arrays and compressed suffix arrays
- Optimal parallel suffix tree construction
- On-line construction of two-dimensional suffix trees
- Optimal parallel suffix tree construction
- Parallelism and dictionary based data compression
- Efficient tree pattern unification
- On the construction of classes of suffix trees for square matrices: Algorithms and applications
- On similarity of polynomial configurations
- Constructing large suffix trees on a computational grid
- Parallel construction of minimal suffix and factor automata
This page was built for publication: Parallel construction of a suffix tree with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104104)