Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
type: Item
instance of: scholarly article
title: Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
zbMATH Open document ID: 1157.68074
author: Alberto Apostolico
author: Claudia Tagliacollo
published in: Theoretical Computer Science
publication date: 2008-12-12T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5382267
zbMATH Keywords: design and analysis of algorithms
zbMATH Keywords: pattern matching
zbMATH Keywords: motif discovery
zbMATH Keywords: irredundant motif
zbMATH Keywords: base
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.08.002
OpenAlex ID: W1968325548
cites work: Q4385510
cites work: Q4347080
cites work: Optimal Offline Extraction of Irredundant Motif Bases
cites work: Verifying candidate matches in sparse and wildcard matching
cites work: Q4055156
cites work: Extracting approximate patterns
cites work: Q4952632
DOI: 10.1016/J.TCS.2008.08.002
description: scientific article; zbMATH DE number 5382267