Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time

DOI10.1016/j.tcs.2008.08.002zbMath1157.68074OpenAlexW1968325548MaRDI QIDQ959798

Alberto Apostolico, Claudia Tagliacollo

Publication date: 12 December 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.002

zbMATH Keywords

basepattern matchingdesign and analysis of algorithmsmotif discoveryirredundant motif

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Related Items (3)

Extracting string motif bases for quorum higher than two ⋮ Optimal extraction of motif patterns in 2D ⋮ OPTIMAL EXTRACTION OF IRREDUNDANT MOTIF BASES

Cites Work

• Extracting approximate patterns
• Verifying candidate matches in sparse and wildcard matching
• Optimal Offline Extraction of Irredundant Motif Bases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time