String Reconstruction from Substring Compositions

DOI10.1137/140962486zbMath1320.68228arXiv1403.2439OpenAlexW2963412269MaRDI QIDQ5502098

No author found.

Publication date: 17 August 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.2439

zbMATH Keywords

polynomial factorizationmass spectrometrystring reconstructionturnpike problembacktracking algorithmprotein sequencing

Mathematics Subject Classification ID

Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (6)

Adaptive learning of compressible strings ⋮ On the number of distinct \(k\)-decks: enumeration and bounds ⋮ Spectral concepts in genome informational analysis ⋮ Realization problems on reachability sequences ⋮ String Reconstruction from Substring Compositions ⋮ Information-Theoretic Foundations of DNA Data Storage

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Approximate string-matching with \(q\)-grams and maximal matches
• Zeros of polynomials with \(0, 1\) coefficients
• Reconstruction from subsequences.
• Counting abelian squares
• Decomposable compositions, symmetric quasisymmetric functions and equality of ribbon Schur functions
• Some necessary clarifications about the chords' problem and the partial digest problem
• Reconstructing Numbers from Pairwise Function Values
• The Structure of Homometric Sets
• On Prefix Normal Words
• String Reconstruction from Substring Compositions
• Efficient reconstruction of sequences from their subsequences of supersequences

This page was built for publication: String Reconstruction from Substring Compositions