Word assembly through minimal forbidden words

DOI10.1016/j.tcs.2006.03.006zbMath1097.68108OpenAlexW2061983309MaRDI QIDQ2503298

Filippo Mignosi, Antonio Restivo, Gabriele Fici, Marinella Sciortino

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.006

zbMATH Keywords

combinatorics on wordsfactor automatonshortest superstringfragment assemblyminimal forbidden wordrepetition index

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (13)

Adaptive learning of compressible strings ⋮ Internal shortest absent word queries in constant time and linear space ⋮ Reverse-Safe Text Indexing ⋮ Absent Subsequences in Words ⋮ Absent subsequences in words ⋮ A linear algorithm for string reconstruction in the reverse complement equivalence model ⋮ Reconstruction of a word from a multiset of its factors ⋮ Decoding Genomic Information ⋮ Languages with mismatches ⋮ Efficient Reconstruction of RC-Equivalent Strings ⋮ Special factors and the combinatorics of suffix and factor automata ⋮ Minimal forbidden factors of circular words ⋮ Alignment-free sequence comparison using absent words

Cites Work

• Automata and forbidden words
• Words and forbidden factors
• Words, univalent factors, and boxes
• Forbidden Factors and Fragment Assembly
• Algorithms on Strings, Trees and Sequences
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Words and special factors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Word assembly through minimal forbidden words