Pages that link to "Item:Q1764477"
From MaRDI portal
The following pages link to Reconstructing words from subwords in linear time (Q1764477):
Displaying 9 items.
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- Relations on words (Q505060) (← links)
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q2112180) (← links)
- Adaptive learning of compressible strings (Q2664947) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q5041252) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q6073651) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q6169894) (← links)
