Mining approximate patterns with frequent locally optimal occurrences

Volume: 200, Pages: 123 - 152
Published: Feb 19, 2016
Abstract
We consider a frequent approximate pattern mining problem, in which interspersed repetitive regions are extracted from a given string. That is, we enumerate substrings that frequently match substrings of a given string locally and optimally. For this problem, we propose a new algorithm, in which candidate patterns are generated without duplication using the suffix tree of a given string. We further define a k -gap-constrained setting, in which...
Paper Details
Title
Mining approximate patterns with frequent locally optimal occurrences
Published Date
Feb 19, 2016
Volume
200
Pages
123 - 152
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.