Extracting string motif bases for quorum higher than two

DOI10.1016/J.TCS.2012.06.021zbMATH Open1252.68363OpenAlexW2039420554MaRDI QIDQ690488FDOQ690488

Authors: Simona E. Rombo 

Publication date: 27 November 2012

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

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

Recommendations

• Optimal extraction of irredundant motif bases
• Mathematical Foundations of Computer Science 2003
• Optimal Offline 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

zbMATH Keywords

quorumdiscovery processdon't care charactersmotif pattern extraction

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• Bridging Lossy and Lossless Compression by Motif Pattern Discovery
• Title not available (Why is that?)
• Motif patterns in 2D
• Extracting approximate patterns
• Optimal extraction of irredundant motif bases
• Mathematical Foundations of Computer Science 2003
• Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time

Cited In (5)

• 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 Offline Extraction of Irredundant Motif Bases
• \textsc{Rime}: repeat identification
• Irredundant tandem motifs

Uses Software

• MADMX

This page was built for publication: Extracting string motif bases for quorum higher than two

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