The following pages link to (Q3370008):
Displaying 18 items.
- Indeterminate string inference algorithms (Q414420) (← links)
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- Inferring strings from suffix trees and links on a binary alphabet (Q496548) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← 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)
- Universal reconstruction of a string (Q2297860) (← links)
- Inferring an indeterminate string from a prefix graph (Q2343296) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- On Maximal Unbordered Factors (Q2942272) (← links)
- Representing prefix and border tables: results on enumeration (Q2971066) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- Efficient validation and construction of border arrays and validation of string matching automata (Q3625694) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
