scientific article; zbMATH DE number 1445317

MaRDI QIDQ4952632zbMATH OpenFDO

Authors Laxmi Parida, Isidore Rigoutsos, Aris Floratos, Dan Platt, Yuan Gao

Publication date 23 October 2000

zbMATH Keywords

data miningpattern discovery

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• scientific article; zbMATH DE number 1615268
• Motif patterns in 2D
• scientific article; zbMATH DE number 1786452
• Optimal Offline Extraction of Irredundant Motif Bases
• Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability

Cited in

(17)

• Motif trie: an efficient text index for pattern discovery with don't cares
• Efficient construction of maximal and minimal representations of motifs of a string
• Irredundant tandem motifs
• Algorithms for extracting motifs from biological weighted sequences
• Extracting approximate patterns
• scientific article; zbMATH DE number 1615268 (Why is no real title available?)
• Bridging Lossy and Lossless Compression by Motif Pattern Discovery
• Mining top-\(k\) motifs with a SAT-based framework
• Bridging Lossy and Lossless Compression by Motif Pattern Discovery
• Extracting string motif bases for quorum higher than two
• 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
• Suffix tree characterization of maximal motifs in biological sequences
• Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
• On the complexity of finding gapped motifs
• Optimal extraction of motif patterns in 2D
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

This page was built for publication:

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