Pages that link to "Item:Q5431350"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2003 (Q5431350):
Displaying 7 items.
- Extracting string motif bases for quorum higher than two (Q690488) (← links)
- Maximal and minimal representations of gapped and non-gapped motifs of a string (Q732024) (← links)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
- Motif trie: an efficient text index for pattern discovery with don't cares (Q1698709) (← links)
- Algorithms for extracting motifs from biological weighted sequences (Q2457295) (← links)
- Extracting approximate patterns (Q2569404) (← links)
- Pattern masking for dictionary matching: theory and practice (Q6547212) (← links)