Pages that link to "Item:Q1736589"
From MaRDI portal
The following pages link to Sublinear time motif discovery from multiple sequences (Q1736589):
Displaying 7 items.
- An upper bound on the hardness of exact matrix based motif discovery (Q925067) (← links)
- Editorial: Special issue on algorithms for sequence analysis and storage (Q1736610) (← links)
- Analysis method and algorithm design of biological sequence problem based on generalized k-mer vector (Q2036135) (← links)
- String Processing and Information Retrieval (Q5393974) (← links)
- Algorithms and Computation (Q5712174) (← links)
- Combinatorial Pattern Matching (Q5713542) (← links)
- Algorithms and Data Structures (Q5900741) (← links)