基本信息
源码名称：Factor Oracle, Suffix Oracle
源码大小：0.30M
文件格式：.pdf
开发语言：C/C++
更新时间：2021-08-07
友情提示：（无需注册或充值，赞助后即可获取资源下载链接）
嘿，亲！知识可是无价之宝呢，但咱这精心整理的资料也耗费了不少心血呀。小小地破费一下，绝对物超所值哦！如有下载和支付问题，请联系我们QQ(微信同号)：813200300
本次赞助数额为： 2 元×
微信扫码支付：2 元
×
请留下您的邮箱，我们将在2小时内将文件发到您的邮箱
源码介绍
We introduce a new automaton on a word p, sequence of letters taken in an alphabet
,that we call factor oracle. This automaton is acyclic, recognizes at least the factors of
p , has m 1 states and a linear number of transitions . We give an on-line construction
algorithm of the factor oracle. The tight links between this structure and the suffix
automaton allows us to introduce a second structure : the suffix oracle . We use these
two structures in string matching algorithms that we conjecture optimal according to the
experimental results. These algorithms are as efficient as the ones that already exist using
We introduce a new automaton on a word p, sequence of letters taken in an alphabet
,that we call factor oracle. This automaton is acyclic, recognizes at least the factors of
p , has m 1 states and a linear number of transitions . We give an on-line construction
algorithm of the factor oracle. The tight links between this structure and the suffix
automaton allows us to introduce a second structure : the suffix oracle . We use these
two structures in string matching algorithms that we conjecture optimal according to the
experimental results. These algorithms are as efficient as the ones that already exist using
less memory and being more easy to implement.