Login / Signup
An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats.
Atheer A. Matroud
Michael D. Hendy
Christopher P. Tuffley
Published in:
RECOMB-CG (2010)
Keyphrases
</>
optimal solution
dynamic programming
learning algorithm
preprocessing
k means
real time
data mining
np hard
data fusion
clustering method
high throughput
sequence alignment
motif discovery