Reconstruction from subsequences.

DOI10.1016/S0097-3165(03)00103-1zbMath1039.68098OpenAlexW2031816626MaRDI 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)

Full work available at URL: https://doi.org/10.1016/s0097-3165(03)00103-1

Mathematics Subject Classification ID

Combinatorics on words (68R15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (27)

Reconstructing Words from Right-Bounded-Block Words ⋮ On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length ⋮ Subword conditions and subword histories ⋮ Order of weak \(M\)-relation and Parikh matrices ⋮ Binomial complexities and Parikh-collinear morphisms ⋮ On Prouhet's solution to the equal powers problem ⋮ Pseudo-Boolean functions and the multiplicity of the zeros of polynomials ⋮ On the number of distinct \(k\)-decks: enumeration and bounds ⋮ Counting subwords in circular words and their Parikh matrices ⋮ Subsequence frequency in binary words ⋮ A linear algorithm for string reconstruction in the reverse complement equivalence model ⋮ Efficient Reconstruction of RC-Equivalent Strings ⋮ Optimal mean-based algorithms for trace reconstruction ⋮ On the Multiplicity of the Zeros of Polynomials with Constrained Coefficients ⋮ Relations on words ⋮ Spectral concepts in genome informational analysis ⋮ POLYNOMIALS WITH MULTIPLE ROOTS AT 1 ⋮ Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms ⋮ Connections between subwords and certain matrix mappings ⋮ Reconstruction of matrices from submatrices ⋮ Independence of certain quantities indicating subword occurrences ⋮ New lower bounds for trace reconstruction ⋮ Realization problems on reachability sequences ⋮ On highly palindromic words ⋮ Reconstructing trees from traces ⋮ String Reconstruction from Substring Compositions ⋮ Reconstructing Words from Right-Bounded-Block Words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstruction of sequences
• The Prouhet-Tarry-Escott problem revisited
• On a reconstruction problem for sequences
• Littlewood-Type Problems on [0,1]

This page was built for publication: Reconstruction from subsequences.