Reconstructing words from subwords in linear time

DOI10.1007/s00026-004-0232-4zbMath1060.68093OpenAlexW1997531802MaRDI QIDQ1764477

Andreas W. M. Dress, Péter L. Erdős

Publication date: 25 February 2005

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-004-0232-4

zbMATH Keywords

reconstruction of wordsalgorithmic complexitysubwords

Mathematics Subject Classification ID

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

Related Items

Reconstructing Words from Right-Bounded-Block Words, Adaptive learning of compressible strings, Absent Subsequences in Words, Relations on words, Counting the number of non-zero coefficients in rows of generalized Pascal triangles, Nearly \(k\)-universal words -- investigating a part of Simon's congruence, Reconstructing Words from Right-Bounded-Block Words, Nearly \(k\)-universal words -- investigating a part of Simon's congruence