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

DOI10.1016/j.tcs.2004.12.013zbMath1080.68089OpenAlexW2037182851MaRDI QIDQ1781986

Laxmi Parida, Abhijit Chattaraj

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)

Related Items (2)

Irredundant tandem motifs ⋮ The subsequence composition of a string

Cites Work

• Unnamed Item
• Unnamed Item
• Compact recognizers of episode sequences
• Algorithms on Strings, Trees and Sequences

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