Mining approximate patterns with frequent locally optimal occurrences
DOI10.1016/J.DAM.2015.07.002zbMATH Open1329.05017OpenAlexW940833654WikidataQ62669609 ScholiaQ62669609MaRDI QIDQ906440FDOQ906440
Authors: Atsuyoshi Nakamura, Ichigaku Takigawa, Hisashi Tosaka, Mineichi Kudo, Hiroshi Mamitsuka 
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
Recommendations
Pattern recognition, speech recognition (68T10) Exact enumeration problems, generating functions (05A15)
Cites Work
- SPADE: An efficient algorithm for mining frequent sequences
- Algorithms on Strings, Trees and Sequences
- Variations on the Common Subexpression Problem
- The Tree-to-Tree Correction Problem
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- An optimal decomposition algorithm for tree edit distance
Cited In (8)
- String analysis by sliding positioning strategy
- Title not available (Why is that?)
- Frequent pattern mining with non-overlapping inversions
- Extracting approximate patterns
- Local near sets: pattern discovery in proximity spaces
- An inexact-suffix-tree-based algorithm for detecting extensible patterns
- Mining approximate repeating patterns from sequence data with gap constraints
- Extracting Approximate Patterns
Uses Software
This page was built for publication: Mining approximate patterns with frequent locally optimal occurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906440)
