An improved voting algorithm for planted \((l, d)\) motif search

DOI10.1016/j.ins.2013.03.023zbMath1320.68230OpenAlexW2049019885MaRDI QIDQ497197

Yuzhong Zhao, Yun Xu, Jiaoyun Yang, Yi Shang

Publication date: 23 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.03.023

zbMATH Keywords

time complexityexact algorithmspace complexitychallenging instancesplanted motif search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)

Uses Software

• PMS5
• RISOTTO
• RecMotif

Cites Work

• On the complexity of finding common approximate substrings.
• RISOTTO: Fast Extraction of Motifs with Mismatches
• String Processing and Information Retrieval
• Algorithms and Data Structures
• Effective hidden Markov models for detecting splicing junction sites in DNA sequences

This page was built for publication: An improved voting algorithm for planted \((l, d)\) motif search