Pages that link to "Item:Q3315005"
From MaRDI portal
The following pages link to Factorizing words over an ordered alphabet (Q3315005):
Displaying 50 items.
- On maximal suffixes and constant-space linear-time versions of KMP algorithm. (Q1874422) (← links)
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids (Q1901039) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
- Lyndon factorization algorithms for small alphabets and run-length encoded strings (Q2004905) (← links)
- Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning (Q2061990) (← links)
- Further steps on the reconstruction of convex polyominoes from orthogonal projections (Q2084620) (← links)
- Factorizing strings into repetitions (Q2135631) (← links)
- A characterization of binary morphisms generating Lyndon infinite words (Q2140469) (← links)
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) (← links)
- Can formal languages help pangenomics to represent and analyze multiple genomes? (Q2163974) (← links)
- A toolkit for Parikh matrices (Q2164742) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence (Q2279980) (← links)
- The alternating BWT: an algorithmic perspective (Q2297865) (← links)
- Nyldon words (Q2318478) (← links)
- On the size of the smallest alphabet for Lyndon trees (Q2326391) (← links)
- Studies on finite Sturmian words (Q2354408) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
- Counting Lyndon factors (Q2401409) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- A Pascal-like bound for the number of necklaces with fixed density (Q2420574) (← links)
- On generalized Lyndon words (Q2422029) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
- Linear construction of a left Lyndon tree (Q2672265) (← links)
- Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence (Q2830442) (← links)
- String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time (Q3011844) (← links)
- Simple Real-Time Constant-Space String Matching (Q3011852) (← links)
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications (Q3033808) (← links)
- Algorithms for the Lyndon unique maximal factorization (Q3089218) (← links)
- PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS (Q3526553) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- Fast parallel Lyndon factorization with applications (Q4327381) (← links)
- Words over an ordered alphabet and suffix permutations (Q4800257) (← links)
- A fast average case algorithm for lyndon decomposition (Q4876360) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- Functional relations for elliptic polylogarithms (Q5059812) (← links)
- (Q5088889) (← links)
- Indexing the bijective BWT (Q5088907) (← links)
- Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
- SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET (Q5247182) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- Indexing Circular Patterns (Q5452151) (← links)
- Combinatorial View of Digital Convexity (Q5458874) (← links)
- UNAVOIDABLE SETS OF CONSTANT LENGTH (Q5692237) (← links)
