Pages that link to "Item:Q2343296"
From MaRDI portal
The following pages link to Inferring an indeterminate string from a prefix graph (Q2343296):
Displaying 12 items.
- Computing covers using prefix tables (Q313747) (← links)
- Indeterminate string inference algorithms (Q414420) (← links)
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
- Constructing an indeterminate string from its associated graph (Q1698711) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings (Q2363963) (← links)
- New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings (Q2965481) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences (Q4639924) (← links)