Login / Signup
An efficient algorithm for finding short approximate non-tandem repeats.
Ezekiel F. Adebiyi
Tao Jiang
Michael Kaufmann
Published in:
ISMB (Supplement of Bioinformatics) (2001)
Keyphrases
</>
preprocessing
dynamic programming
learning algorithm
real time
np hard
optimal solution
k means
database
data sets
computational complexity
machine learning
information retrieval
relational databases
clustering method