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

DOI10.1016/J.TCS.2004.12.013zbMATH Open1080.68089OpenAlexW2037182851MaRDI QIDQ1781986FDOQ1781986

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

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

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)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• Compact recognizers of episode sequences
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• The subsequence composition of a string
• Mining approximate repeating patterns from sequence data with gap constraints
• Irredundant tandem motifs
• Extracting Approximate Patterns

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)