Recommendations
- Generalized factorizations of words and their algorithmic properties
- Enhanced string factoring from alphabet orderings
- Words over an ordered alphabet and suffix permutations
- scientific article; zbMATH DE number 4108170
- scientific article; zbMATH DE number 1183242
- Factorization of prefix-closed subsets of words
- scientific article; zbMATH DE number 2182450
- Counting maximal-exponent factors in words
- On palindromic factorization of words
- On prefixal factorizations of words
Cited in
(only showing first 100 items - show all)- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
- Studies on finite Sturmian words
- Counting Lyndon factors
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words
- Algorithms for Galois words: detection, factorization, and rotation
- Internal pattern matching in small space and applications
- The alternating BWT: an algorithmic perspective
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- The ``runs theorem
- A formula for the determinant of a sum of matrices
- A survey of string orderings and their application to the Burrows-Wheeler transform
- Reconstructing a string from its Lyndon arrays
- Computing longest (common) Lyndon subsequences
- String comparison and Lyndon-like factorization using V-order in linear time
- Lyndon-like and V-order factorizations of strings
- String attractors of some simple-parry automatic sequences
- Linear construction of a left Lyndon tree
- Lyndon trees
- Efficient CRCW-PRAM algorithms for universal substring searching
- Binary block order Rouen transform
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Fast parallel Lyndon factorization with applications
- Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length)
- Enhanced string factoring from alphabet orderings
- Generic Algorithms for Factoring Strings
- Computing longest Lyndon subsequences and longest common Lyndon subsequences
- Inverse Lyndon words and inverse Lyndon factorizations of words
- Sorting conjugates and suffixes of words in a multiset
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
- Functional relations for elliptic polylogarithms
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Lyndon words and Fibonacci numbers
- Lyndon factorization algorithms for small alphabets and run-length encoded strings
- A bijective variant of the Burrows-Wheeler transform using V-order
- New results on Nyldon words and Nyldon-like sets
- Words over an ordered alphabet and suffix permutations
- Time versus space trade-offs for rendezvous in trees
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- Indexing the bijective BWT
- Longest Lyndon Substring After Edit
- On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
- Substring complexity in sublinear space
- A note on a simple computation of the maximal suffix of a string
- Geometric preservation of 2D digital objects under rigid motions
- Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism
- Efficient operations on discrete paths
- Efficient detection of quasiperiodicities in strings
- On the size of the smallest alphabet for Lyndon trees
- UNAVOIDABLE SETS OF CONSTANT LENGTH
- Indexing Circular Patterns
- Lyndon arrays simplified
- A public key cryptosystem based on Lyndon words
- Decompositions of nonlinear input-output systems to zero the output
- Generalised Nyldon words
- Flip-swap languages in binary reflected Gray code order
- Optimal parallel detection of squares in strings
- Optimal canonization of all substrings of a string
- Optimal algorithms for computing the canonical form of a circular string
- String-matching on ordered alphabets
- Lyndon + Christoffel = digitally convex
- Quantum algorithm for lexicographically minimal string rotation
- Lyndon partial words and arrays with applications
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
- Infinite Lyndon words
- An efficient shift rule for the prefer-max de Bruijn sequence
- Parallel RAM algorithms for factorizing words
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
- The zooming method: A recursive approach to time-space efficient string-matching
- Algorithms for pixelwise shape deformations preserving digital convexity
- Extended suffix array construction using Lyndon factors
- String rearrangement inequalities and a total order between primitive words
- A Pascal-like bound for the number of necklaces with fixed density
- scientific article; zbMATH DE number 7559170 (Why is no real title available?)
- Inferring strings from Lyndon factorization
- Finding the leftmost critical factorization on unordered alphabet
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids
- Computing minimal and maximal suffixes of a substring
- Algorithms for the Lyndon unique maximal factorization
- Linear computation of unbordered conjugate on unordered alphabet
- On the optimisation of the GSACA suffix array construction algorithm
- On maximal suffixes and constant-space linear-time versions of KMP algorithm.
- Finding the cyclic covers of a string
- Lyndon words, permutations and trees.
- Simple real-time constant-space string matching
- Simple real-time constant-space string matching
- A note on quantum divide and conquer for minimal string rotation
- Factorizing strings into repetitions
- Nyldon words
- A simple shift rule for \(k\)-ary de Bruijn sequences
- Efficient constructions of the prefer-same and prefer-opposite de Bruijn sequences
- Generic non-recursive suffix array construction
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- On generalized Lyndon words
- A characterization of binary morphisms generating Lyndon infinite words
- \(V\)-words, Lyndon words and substring circ-UMFFs
- The standard factorization of Lyndon words: an average point of view
- Lyndon factorization of grammar compressed texts revisited
- Indeterminate string factorizations and degenerate text transformations
This page was built for publication: Factorizing words over an ordered alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315005)
