scientific article; zbMATH DE number 1445317
From MaRDI portal
Publication:4952632
zbMath0956.68134MaRDI QIDQ4952632
Isidore Rigoutsos, Laxmi Parida, Dan Platt, Aris Floratos, Yuan Gao
Publication date: 23 October 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Motif trie: an efficient text index for pattern discovery with don't cares ⋮ Irredundant tandem motifs ⋮ Algorithms for extracting motifs from biological weighted sequences ⋮ Mining top-\(k\) motifs with a SAT-based framework ⋮ Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time ⋮ Extracting string motif bases for quorum higher than two ⋮ On the complexity of finding gapped motifs ⋮ Efficient construction of maximal and minimal representations of motifs of a string ⋮ Optimal extraction of motif patterns in 2D ⋮ An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence ⋮ 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 ⋮ Extracting approximate patterns
This page was built for publication:
