An output-sensitive flexible pattern discovery algorithm

DOI10.1007/3-540-48194-X_11MaRDI QIDQ4547742zbMATH OpenFDO

Authors Laxmi Parida, Isidore Rigoutsos, Daniel E. Platt

Publication date 21 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2089/20890131

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Some results on flexible-pattern discovery
• Output-sensitive pattern extraction in sequences
• Flexible Pattern Discovery with (Extended) Disjunctive Logic Programming
• Algorithms for finding logical regularities in pattern recognition

Cited in

(11)

• Motif trie: an efficient text index for pattern discovery with don't cares
• An inexact-suffix-tree-based algorithm for detecting extensible patterns
• Revisiting Shinohara's algorithm for computing descriptive patterns
• Some results on flexible-pattern discovery
• Output-sensitive pattern extraction in sequences
• Modified PrefixSpan method for motif discovery in sequence databases
• scientific article; zbMATH DE number 1445317 (Why is no real title available?)
• Toward optimal motif enumeration.
• Masking patterns in sequences: A new class of motif discovery with don't cares
• Maximal and minimal representations of gapped and non-gapped motifs of a string
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

This page was built for publication: An output-sensitive flexible pattern discovery algorithm

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