An inexact-suffix-tree-based algorithm for detecting extensible patterns

DOI10.1016/J.TCS.2004.12.013MaRDI QIDQ1781986zbMATHOpenAlexFDO

Authors Abhijit Chattaraj, Laxmi Parida

Publication date 10 June 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2004.12.013

zbMATH Keywords

Data miningPattern discoverySuffix treesExtensible patternsFlexible patternsMotif discoveryMotifs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Protein sequences, DNA sequences (92D20) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1615268
• Mining approximate patterns with frequent locally optimal occurrences
• scientific article; zbMATH DE number 1786452
• Output-sensitive pattern extraction in sequences
• Extracting approximate patterns

Cites work

• scientific article; zbMATH DE number 1615268 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• Algorithms on Strings, Trees and Sequences
• Compact recognizers of episode sequences

Cited in

(5)

• Irredundant tandem motifs
• scientific article; zbMATH DE number 1615268 (Why is no real title available?)
• The subsequence composition of a string
• Extracting Approximate Patterns
• Mining approximate repeating patterns from sequence data with gap constraints

This page was built for publication: An inexact-suffix-tree-based algorithm for detecting extensible patterns

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