Mining approximate patterns with frequent locally optimal occurrences
From MaRDI portal
Recommendations
Cites work
- Algorithms on Strings, Trees and Sequences
- 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
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs
- Linear time algorithms for finding and representing all the tandem repeats in a string
- SPADE: An efficient algorithm for mining frequent sequences
- The Tree-to-Tree Correction Problem
- Variations on the Common Subexpression Problem
Cited in
(8)- String analysis by sliding positioning strategy
- scientific article; zbMATH DE number 2087753 (Why is no real title available?)
- 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
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)