Sublinear time motif discovery from multiple sequences

DOI10.3390/a6040636zbMath1461.68265arXiv1007.2618OpenAlexW1999959196MaRDI QIDQ1736589

Yunhui Fu, Yuan Xue, Bin Fu

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.2618

zbMATH Keywords

randomized algorithmdeterministic algorithmmotif discoverysublinear time

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Randomized algorithms (68W20) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)

Related Items (2)

Editorial: Special issue on algorithms for sequence analysis and storage ⋮ Analysis method and algorithm design of biological sequence problem based on generalized k-mer vector

Uses Software

• WebMOTIFS
• PhyME

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On covering problems of codes
• Distinguishing string selection problems.
• Finding similar regions in many strings
• Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences
• Discovering almost any hidden motif from multiple sequences
• On the closest string and substring problems
• Algorithms on Strings, Trees and Sequences

This page was built for publication: Sublinear time motif discovery from multiple sequences