tailieunhanh - LibFLASM: A software library for fixed-length approximate string matching

Approximate string matching is the problem of finding all factors of a given text that are at a distance at most k from a given pattern. Fixed-length approximate string matching is the problem of finding all factors of a text of length n that are at a distance at most k from any factor of length of a pattern of length m. |

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
TÀI LIỆU MỚI ĐĂNG
6    147    0    16-01-2025
5    139    0    16-01-2025
26    147    2    16-01-2025
64    144    0    16-01-2025
7    136    0    16-01-2025
14    149    0    16-01-2025