Motif discovery by monotone scores
From MaRDI portal
Publication:876467
Recommendations
- Scoring unusual words with varying mismatch errors
- Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
- Discovering almost any hidden motif from multiple sequences
- Publication:4938777
- Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences
Cites work
Cited in
(6)- Common Substrings in Random Strings
- Faster variance computation for patterns with gaps
- String Processing and Information Retrieval
- \(k\)-difference matching in amortized linear time for all the words in a text
- Sequence similarity measures based on bounded Hamming distance
- On counting the frequency distribution of string motifs in molecular sequences
This page was built for publication: Motif discovery by monotone scores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876467)