Mining approximate repeating patterns from sequence data with gap constraints

DOI10.1111/J.1467-8640.2011.00383.XMaRDI QIDQ3224880zbMATH OpenOpenAlexFDO

Authors Dan He, Xingquan Zhu, Xindong Wu

Publication date 2 April 2012

Published in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1467-8640.2011.00383.x

zbMATH Keywords

approximate patternsdynamic programmingfrequent pattern mininggap constraints

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms on strings (68W32) Protein sequences, DNA sequences (92D20)

Recommendations

• Mining approximate patterns with frequent locally optimal occurrences
• scientific article; zbMATH DE number 1966522
• scientific article; zbMATH DE number 2013272
• A FAST TECHNIQUE FOR DERIVING FREQUENT STRUCTURED PATTERNS FROM BIOLOGICAL DATA SETS
• An inexact-suffix-tree-based algorithm for detecting extensible patterns

Cites work

• Algorithms and Computation
• Algorithms on Strings, Trees and Sequences

Cited in

(3)

• scientific article; zbMATH DE number 2013272 (Why is no real title available?)
• Mining contour sequences for significant closed patterns
• Mining approximate patterns with frequent locally optimal occurrences

Describes a project that uses

Uses Software

• REPuter

This page was built for publication: Mining approximate repeating patterns from sequence data with gap constraints

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