A suffix-tree heuristic that matches patterns by aligning repeated pattern symbols with repeated text substrings is proposed and tested on sonnets and random strings.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Heuristic Algorithm for Generalized Function Matching
A suffix-tree heuristic that matches patterns by aligning repeated pattern symbols with repeated text substrings is proposed and tested on sonnets and random strings.