Pages that link to "Item:Q3315005"
From MaRDI portal
The following pages link to Factorizing words over an ordered alphabet (Q3315005):
Displaying 13 items.
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- Complete dynamical evaluation of the characteristic polynomial of binary quantum graphs (Q5874169) (← links)
- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels (Q6069173) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
- Algorithms for pixelwise shape deformations preserving digital convexity (Q6160791) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
- Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches (Q6195191) (← links)
- Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)
- On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms (Q6559402) (← links)
- Decompositions of nonlinear input-output systems to zero the output (Q6569412) (← links)
- \(V\)-words, Lyndon words and substring circ-UMFFs (Q6606210) (← links)
- String attractors of some simple-parry automatic sequences (Q6661762) (← links)