Pages that link to "Item:Q1764477"
From MaRDI portal
The following pages link to Reconstructing words from subwords in linear time (Q1764477):
Displaying 17 items.
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words (Q466028) (← links)
- Relations on words (Q505060) (← links)
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- Subwords in reverse-complement order (Q882766) (← links)
- Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words (Q895104) (← links)
- Finite automata for testing composition-based reconstructibility of sequences (Q931728) (← links)
- Discovering subword associations in strings in time linear in the output size (Q1026231) (← links)
- On a reconstruction problem for sequences (Q1352885) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q2112180) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- Adaptive learning of compressible strings (Q2664947) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q5041252) (← links)
- Efficient reconstruction of sequences from their subsequences of supersequences (Q5930025) (← 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)
