A linear algorithm for string reconstruction in the reverse complement equivalence model

DOI10.1016/J.JDA.2011.12.003zbMath1281.68168OpenAlexW1965446946MaRDI QIDQ450544

Péter L. Erdős, Ferdinando Cicalese, Zsuzsanna Lipták

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.003

zbMATH Keywords

string algorithmscombinatorics on wordssubsequencesreverse complementstring reconstructionsubwords

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Subwords in reverse-complement order
• Reconstruction of a word from a multiset of its factors
• On the combinatorics of finite words
• On a reconstruction problem for sequences
• Uniform tag systems for paperfolding sequences
• Reconstruction from subsequences.
• Word assembly through minimal forbidden words
• Efficient Reconstruction of RC-Equivalent Strings
• Efficient reconstruction of sequences
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Words and special factors
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear algorithm for string reconstruction in the reverse complement equivalence model