The following pages link to Algorithms and Data Structures (Q5900741):
Displaying 10 items.
- An improved voting algorithm for planted \((l, d)\) motif search (Q497197) (← links)
- A cost-aggregating integer linear program for motif finding (Q655435) (← links)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
- Fast algorithm for extracting multiple unordered short motifs using bit operations (Q1857026) (← links)
- A parameterizable enumeration algorithm for sequence mining (Q1935787) (← links)
- A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences (Q2160676) (← links)
- Efficient Codon Optimization with Motif Engineering (Q3111662) (← links)
- Extracting best consensus motifs from positive and negative examples (Q4593932) (← links)
- String Processing and Information Retrieval (Q5393969) (← links)
- String Processing and Information Retrieval (Q5393975) (← links)