Extracting Approximate Patterns

DOI10.1007/3-540-44888-8_24zbMATH Open1279.68374OpenAlexW1537727133MaRDI QIDQ3550845FDOQ3550845

Authors: Johann Pelfrêne, S. Abdeddaim, Joël Alexandre 

Publication date: 6 April 2010

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44888-8_24

Recommendations

• Extracting approximate patterns
• Exact and approximate minimal pattern mining
• Approximating Approximate Pattern Matching
• scientific article; zbMATH DE number 2084663
• An inexact-suffix-tree-based algorithm for detecting extensible patterns
• Generalized pattern extraction from concept lattices
• Mining approximate patterns with frequent locally optimal occurrences
• Rough set approach to pattern extraction from classifiers
• PATTERN EXTRACTION FROM BAG DATABASES
• Formal Concept Analysis

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (4)

• Extracting approximate patterns
• Mining approximate patterns with frequent locally optimal occurrences
• Output-sensitive pattern extraction in sequences
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

This page was built for publication: Extracting Approximate Patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550845)