Mining approximate patterns with frequent locally optimal occurrences

DOI10.1016/j.dam.2015.07.002zbMath1329.05017OpenAlexW940833654WikidataQ62669609 ScholiaQ62669609MaRDI QIDQ906440

Mineichi Kudo, Hisashi Tosaka, Hiroshi Mamitsuka, Atsuyoshi Nakamura, Ichigaku Takigawa

Publication date: 21 January 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.07.002

zbMATH Keywords

alignmentDNAstringfrequent pattern miningordered tree

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Pattern recognition, speech recognition (68T10)

Uses Software

• RepeatMasker
• PrefixSpan
• REPuter
• PILER
• CloSpan

Cites Work

• Unnamed Item
• Efficiently mining \(\delta \)-tolerance closed frequent subgraphs
• Linear time algorithms for finding and representing all the tandem repeats in a string
• Variations on the Common Subexpression Problem
• The Tree-to-Tree Correction Problem
• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
• Algorithms on Strings, Trees and Sequences
• SPADE: An efficient algorithm for mining frequent sequences

This page was built for publication: Mining approximate patterns with frequent locally optimal occurrences