Factorizing words over an ordered alphabet
From MaRDI portal
Publication:3315005
DOI10.1016/0196-6774(83)90017-2zbMATH Open0532.68061OpenAlexW2073103034WikidataQ55951224 ScholiaQ55951224MaRDI QIDQ3315005FDOQ3315005
Authors: J.-P. Duval 
Publication date: 1983
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(83)90017-2
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)
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Lyndon words and Fibonacci numbers
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- New results on Nyldon words and Nyldon-like sets
- A note on a simple computation of the maximal suffix of a string
- UNAVOIDABLE SETS OF CONSTANT LENGTH
- Indexing Circular Patterns
- Efficient operations on discrete paths
- Efficient detection of quasiperiodicities in strings
- A public key cryptosystem based on Lyndon words
- 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
- Infinite Lyndon words
- Parallel RAM algorithms for factorizing words
- The zooming method: A recursive approach to time-space efficient string-matching
- String rearrangement inequalities and a total order between primitive words
- Extended suffix array construction using Lyndon factors
- A Pascal-like bound for the number of necklaces with fixed density
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Finding the leftmost critical factorization on unordered alphabet
- Algorithms for the Lyndon unique maximal factorization
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids
- Simple real-time constant-space string matching
- Linear computation of unbordered conjugate on unordered alphabet
- Computing minimal and maximal suffixes of a substring
- On maximal suffixes and constant-space linear-time versions of KMP algorithm.
- Lyndon words, permutations and trees.
- Simple real-time constant-space string matching
- Nyldon words
- A simple shift rule for \(k\)-ary de Bruijn sequences
- On generalized Lyndon words
- The “Runs” Theorem
- Combinatorics of Hall trees and Hall words
- Viennot factorization of infinite words
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm
- \(\alpha\)-words and the radix order
- A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
- Suffix array and Lyndon factorization of a text
- A fast average case algorithm for lyndon decomposition
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications
- Towards optimal packed string matching
- Two linear-time algorithms for computing the minimum length polygon of a digital contour
- Combinatorial View of Digital Convexity
- Lyndon words and singular factors of sturmian words
- Almost linear time computation of maximal repetitions in run length encoded strings
- Finding the maximum suffix with fewer comparisons
- PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS
- Studies on finite Sturmian words
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- Computing longest (common) Lyndon subsequences
- A formula for the determinant of a sum of matrices
- String comparison and Lyndon-like factorization using V-order in linear time
- Lyndon-like and V-order factorizations of strings
- Lyndon trees
- 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
- Generic Algorithms for Factoring Strings
- 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)
- Inverse Lyndon words and inverse Lyndon factorizations of words
- Words over an ordered alphabet and suffix permutations
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order
- Time versus space trade-offs for rendezvous in trees
- On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
- Longest Lyndon Substring After Edit
- Geometric preservation of 2D digital objects under rigid motions
- On the size of the smallest alphabet for Lyndon trees
- Decompositions of nonlinear input-output systems to zero the output
- Flip-swap languages in binary reflected Gray code order
- 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
- Algorithms for pixelwise shape deformations preserving digital convexity
- An efficient shift rule for the prefer-max de Bruijn sequence
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
- Title not available (Why is that?)
- Inferring strings from Lyndon factorization
- On the optimisation of the GSACA suffix array construction algorithm
- Finding the cyclic covers of a string
- Factorizing strings into repetitions
- \(V\)-words, Lyndon words and substring circ-UMFFs
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- A characterization of binary morphisms generating Lyndon infinite words
- Lyndon factorization of grammar compressed texts revisited
- The standard factorization of Lyndon words: an average point of view
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
- Indeterminate string factorizations and degenerate text transformations
- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels
- Complete dynamical evaluation of the characteristic polynomial of binary quantum graphs
- Near-optimal quantum algorithms for string problems
- Can formal languages help pangenomics to represent and analyze multiple genomes?
- Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches
- A toolkit for Parikh matrices
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET
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)
