Fast Approximate Search in Strings with Rearrangements.

Published in: IEEE ICCI (2006)

Keyphrases

edit distance
finite automata
context free languages
shortest common supersequence
artificial intelligence
string matching
approximate string matching
databases
search engine
case study
lower bound
hamming distance
biological sequences
cell lines