Extracting string motif bases for quorum higher than two
type: Item
instance of: scholarly article
title: Extracting string motif bases for quorum higher than two
zbMATH Open document ID: 1252.68363
author: Simona E. Rombo
published in: Theoretical Computer Science
publication date: 2012-11-27T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 6110704
zbMATH Keywords: motif pattern extraction
zbMATH Keywords: don't care characters
zbMATH Keywords: discovery process
zbMATH Keywords: quorum
describes a project that uses: MADMX
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.06.021
OpenAlex ID: W2039420554
cites work: Bridging Lossy and Lossless Compression by Motif Pattern Discovery
cites work: Motif patterns in 2D
cites work: Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
cites work: OPTIMAL EXTRACTION OF IRREDUNDANT MOTIF BASES
cites work: Q4055156
cites work: Algorithms on Strings, Trees and Sequences
cites work: Q4952632
cites work: Extracting approximate patterns
cites work: Mathematical Foundations of Computer Science 2003
DOI: 10.1016/J.TCS.2012.06.021
description: scientific article; zbMATH DE number 6110704