Optimal Offline Extraction of Irredundant Motif Bases

DOI10.1007/978-3-540-73545-8_36zbMATH Open1206.68348OpenAlexW1506920612MaRDI QIDQ3608861FDOQ3608861

Authors: Alberto Apostolico, Claudia Tagliacollo 

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_36

Recommendations

• Optimal extraction of irredundant motif bases
• Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
• RISOTTO: Fast Extraction of Motifs with Mismatches
• Extracting string motif bases for quorum higher than two
• Optimal extraction of motif patterns in 2D

zbMATH Keywords

basispattern matchingdesign and analysis of algorithmsmotif discoveryirredundant motif

Mathematics Subject Classification ID

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

Cited In (7)

• Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
• Optimal extraction of irredundant motif bases
• Optimal extraction of motif patterns in 2D
• RISOTTO: Fast Extraction of Motifs with Mismatches
• Efficient construction of maximal and minimal representations of motifs of a string
• Extracting string motif bases for quorum higher than two
• Title not available (Why is that?)

This page was built for publication: Optimal Offline Extraction of Irredundant Motif Bases

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