Reconstruction from subsequences.
From MaRDI portal
Publication:1406745
DOI10.1016/S0097-3165(03)00103-1zbMath1039.68098MaRDI QIDQ1406745
Leonard J. Schulman, Miroslav Dudík
Publication date: 7 September 2003
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
68R15: Combinatorics on words
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
On the Multiplicity of the Zeros of Polynomials with Constrained Coefficients, POLYNOMIALS WITH MULTIPLE ROOTS AT 1, String Reconstruction from Substring Compositions, Realization problems on reachability sequences, On Prouhet's solution to the equal powers problem, A linear algorithm for string reconstruction in the reverse complement equivalence model, Relations on words, Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms, Subword conditions and subword histories, Pseudo-Boolean functions and the multiplicity of the zeros of polynomials, On highly palindromic words, Order of weak \(M\)-relation and Parikh matrices, Optimal mean-based algorithms for trace reconstruction, New lower bounds for trace reconstruction, Spectral concepts in genome informational analysis, Connections between subwords and certain matrix mappings, Independence of certain quantities indicating subword occurrences, Efficient Reconstruction of RC-Equivalent Strings, Reconstruction of matrices from submatrices
Cites Work
