Pages that link to "Item:Q2503298"
From MaRDI portal
The following pages link to Word assembly through minimal forbidden words (Q2503298):
Displayed 13 items.
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- Reconstruction of a word from a multiset of its factors (Q930915) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Languages with mismatches (Q2456367) (← links)
- Adaptive learning of compressible strings (Q2664947) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Absent subsequences in words (Q2695493) (← links)
- Efficient Reconstruction of RC-Equivalent Strings (Q3000522) (← links)
- Decoding Genomic Information (Q3295748) (← links)
- Reverse-Safe Text Indexing (Q5102053) (← links)
- Minimal forbidden factors of circular words (Q5915743) (← links)
- Absent Subsequences in Words (Q6070611) (← links)