Word assembly through minimal forbidden words
From MaRDI portal
Publication:2503298
DOI10.1016/j.tcs.2006.03.006zbMath1097.68108MaRDI QIDQ2503298
Filippo Mignosi, Gabriele Fici, Antonio Restivo, 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
combinatorics on words; factor automaton; shortest superstring; fragment assembly; minimal forbidden word; repetition index
68R15: Combinatorics on words
Related Items
A linear algorithm for string reconstruction in the reverse complement equivalence model, Special factors and the combinatorics of suffix and factor automata, Reconstruction of a word from a multiset of its factors, Alignment-free sequence comparison using absent words, Languages with mismatches, Efficient Reconstruction of RC-Equivalent Strings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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