Efficient Reconstruction of RC-Equivalent Strings

DOI10.1007/978-3-642-19222-7_35MaRDI QIDQ3000522zbMATH OpenOpenAlexFDO

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

Publication date 19 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://real.mtak.hu/9907/1/CicaleseErdosLiptak-IWOCA2010.pdf

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• On the Reconstruction of a String from Spectral Data
• Reconstruction of Strings From Their Substrings Spectrum
• Universal reconstruction of a string
• Universal reconstruction of a string
• A linear algorithm for string reconstruction in the reverse complement equivalence model
• The reconstruction of an analytic string from two spectra
• The problem of reconstructing a quasihomogeneous string from its part
• Reconstructing strings from random traces
• Cover array string reconstruction
• Lightweight LCP construction for very large collections of strings

Cites work

• scientific article; zbMATH DE number 3495598 (Why is no real title available?)
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Efficient reconstruction of sequences
• On a reconstruction problem for sequences
• On the combinatorics of finite words
• Reconstruction from subsequences.
• Reconstruction of a word from a multiset of its factors
• Subwords in reverse-complement order
• Word assembly through minimal forbidden words
• Words and special factors

Cited in

(2)

• A linear algorithm for string reconstruction in the reverse complement equivalence model
• Decoding genomic information

This page was built for publication: Efficient Reconstruction of RC-Equivalent Strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000522)