> It might serve to partition search space for another more expensive algorithm This is what we're doing. We're working on approaches for performing nucleotide

> It might serve to partition search space for another more expensive algorithm This is what we're doing. We're working on approaches for performing nucleotide sequence alignment using approximate time series representations of vectorised DNA sequences. There are some really elegant lower bounding similarity search methods for time series which generate no false negative alignments, allowing use of more expensive alignment algorithms later on in the search to prune out the false positives. We've tested a few transformations including Haar wavelets, DFT and PAA and implemented an indexing structure in C++. Preprint: https://www.academia.edu/12575290/Alignment_by_numbers_sequence_assembly_using_compressed_numerical_representations https://www.academia.edu/12575290/Alignment_by_numbers_seque... (slightly outdated... Email me for more info)