With the ever increasing speed at which DNA can be sequenced the available computing power is struggling to follow at the same pace. In contrast to earlier days of DNA sequencing, it now takes longer to align the data than to sequence it. Thus, new approaches to solve the alignment problem need to be investigated. A perfect sequence alignment might not always be required, specially when available computing power is limited. With that in mind, a purely heuristic approach to sequence alignment is proposed and evaluated. The evaluation shows good performance and quality with the used datasets, but suggest that the algorithm should not be used as the final alignment step, but to quickly identify alignment candidate locations.