The following pages link to Cover Array String Reconstruction (Q3575252):
Displaying 17 items.
- Indeterminate string inference algorithms (Q414420) (← links)
- The set of parameterized \(k\)-covers problem (Q418000) (← links)
- Inferring strings from suffix trees and links on a binary alphabet (Q496548) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- Approximate cover of strings (Q2326399) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)
- Can we recover the cover? (Q2415365) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- Quasi-Periodicity Under Mismatch Errors (Q5140765) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
- String Covering: A Survey (Q6145625) (← links)
