OPTIMAL EXTRACTION OF IRREDUNDANT MOTIF BASES

DOI10.1142/S0129054110007714zbMATH Open1213.68718MaRDI QIDQ3069742FDOQ3069742

Alberto Apostolico, Claudia Tagliacollo

Publication date: 19 January 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

basispattern matchingdesign and analysis of algorithmsmotif discoveryirredundant motif

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms on strings (68W32)

Cites Work

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

Cited In (2)

• Extracting best consensus motifs from positive and negative examples
• Extracting string motif bases for quorum higher than two

This page was built for publication: OPTIMAL EXTRACTION OF IRREDUNDANT MOTIF BASES

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