Fast parallel Lyndon factorization with applications
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3898807 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- A linear time solution to the single function coarsest partition problem
- A public key cryptosystem based on Lyndon words
- An improved algorithm to check for polygon similarity
- Efficient Parallel Algorithms for String Editing and Related Problems
- Factorizing words over an ordered alphabet
- Fast canonization of circular strings
- Free differential calculus. IV: The quotient groups of the lower central series
- Optimal bounds for decision problems on the CRCW PRAM
- Optimal canonization of all substrings of a string
- Optimal parallel algorithms for string matching
- Parallel construction of a suffix tree with applications
- Relations between Concurrent-Write Models of Parallel Computation
- Two-way string-matching
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
Cited in
(27)- Lyndon factorization algorithms for small alphabets and run-length encoded strings
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- Longest Lyndon Substring After Edit
- scientific article; zbMATH DE number 18629 (Why is no real title available?)
- Optimal canonization of all substrings of a string
- Optimal algorithms for computing the canonical form of a circular string
- Parallel RAM algorithms for factorizing words
- Extended suffix array construction using Lyndon factors
- scientific article; zbMATH DE number 7559170 (Why is no real title available?)
- Inferring strings from Lyndon factorization
- Finding the cyclic covers of a string
- On generalized Lyndon words
- Lyndon factorization of grammar compressed texts revisited
- Indeterminate string factorizations and degenerate text transformations
- Dynamic and internal longest common substring
- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels
- Unveiling the connection between the Lyndon factorization and the canonical inverse Lyndon factorization via a border property
- Suffix array and Lyndon factorization of a text
- A fast average case algorithm for lyndon decomposition
- Finding the cyclic covers of a string
- scientific article; zbMATH DE number 1217643 (Why is no real title available?)
- Lyndon-like and V-order factorizations of strings
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
- 2D Lyndon words and applications
- Fast separable factorization and applications
- Minimal suffix and rotation of a substring in optimal time
- Inverse Lyndon words and inverse Lyndon factorizations of words
This page was built for publication: Fast parallel Lyndon factorization with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327381)
