The following pages link to Reconstruction from subsequences. (Q1406745):
Displayed 27 items.
- On Prouhet's solution to the equal powers problem (Q387801) (← links)
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- Relations on words (Q505060) (← links)
- Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms (Q515680) (← links)
- Subword conditions and subword histories (Q859831) (← links)
- Pseudo-Boolean functions and the multiplicity of the zeros of polynomials (Q891348) (← links)
- On highly palindromic words (Q1028422) (← links)
- Order of weak \(M\)-relation and Parikh matrices (Q1659987) (← links)
- Optimal mean-based algorithms for trace reconstruction (Q1737958) (← links)
- New lower bounds for trace reconstruction (Q2041812) (← links)
- Reconstructing trees from traces (Q2075329) (← links)
- On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length (Q2155320) (← links)
- Binomial complexities and Parikh-collinear morphisms (Q2164005) (← links)
- Spectral concepts in genome informational analysis (Q2243578) (← links)
- Connections between subwords and certain matrix mappings (Q2484434) (← links)
- Independence of certain quantities indicating subword occurrences (Q2508977) (← links)
- Efficient Reconstruction of RC-Equivalent Strings (Q3000522) (← links)
- Reconstruction of matrices from submatrices (Q3055168) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q5041252) (← links)
- On the Multiplicity of the Zeros of Polynomials with Constrained Coefficients (Q5153556) (← links)
- POLYNOMIALS WITH MULTIPLE ROOTS AT 1 (Q5408813) (← links)
- String Reconstruction from Substring Compositions (Q5502098) (← links)
- Realization problems on reachability sequences (Q5925515) (← links)
- On the number of distinct \(k\)-decks: enumeration and bounds (Q6112289) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q6169894) (← links)
- Counting subwords in circular words and their Parikh matrices (Q6185846) (← links)
- Subsequence frequency in binary words (Q6204345) (← links)