Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences

DOI10.1137/080720401zbMATH Open1207.68452OpenAlexW2098206048MaRDI QIDQ3058527FDOQ3058527

Bin Fu, Lusheng Wang, Ming-Yang Kao

Publication date: 3 December 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080720401

zbMATH Keywords

probabilistic analysismotif discoverymultiple sequences

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Algorithms on strings (68W32)

Cited In (8)

• Sublinear time motif discovery from multiple sequences
• A technique to find multiple motif occurrences in a biomolecular sequence
• An approximation algorithm for alignment of multiple sequences using motif discovery
• Title not available (Why is that?)
• Unravelling the Sensitivity of Two Motif Structures Under Random Perturbation
• Extracting best consensus motifs from positive and negative examples
• String Processing and Information Retrieval
• Detection of subtle variations as consensus motifs

This page was built for publication: Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences

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