Fast algorithms for computing sequence distances by exhaustive substring composition.

Alberto Apostolico Olgert Denas

Published in: Algorithms Mol. Biol. (2008)

Keyphrases

data structure
benchmark datasets
machine learning
optimization problems
biological sequences
learning algorithm

brute force
significant improvement
computational cost
times faster
data mining techniques

recently developed
computational efficiency
pattern matching
orders of magnitude
shortest path

distance measure
data sets
computational complexity
image processing
neural network