Pages that link to "Item:Q5431307"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2003 (Q5431307):
Displayed 25 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)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- Constructing an indeterminate string from its associated graph (Q1698711) (← links)
- A note on the Burrows-Wheeler transformation (Q1770410) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- On the size of the smallest alphabet for Lyndon trees (Q2326391) (← links)
- Inferring an indeterminate string from a prefix graph (Q2343296) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)
- Subsequence automata with default transitions (Q2363354) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- On the combinatorics of suffix arrays (Q2445335) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
- Inferring strings from position heaps in linear time (Q6091154) (← links)
- Reconstructing parameterized strings from parameterized suffix and LCP arrays (Q6166972) (← links)