Kensuke Baba

An extension of the FFT‐based algorithm for the match‐count problem to weighted scores

2017 · IEEJ Transactions on Electrical and Electronic Engineering

The match‐count problem on strings is the basic problem of counting the matches of characters between two strings for every possible alignment. The problem is classically computed in O ( σ n log m ) …