Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability

DOI10.1007/978-3-642-02017-9_26zbMath1241.68134MaRDI QIDQ3630208

Lusheng Wang, Bin Fu, Ming-Yang Kao

Publication date: 3 June 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-642-02017-9_26

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

92D20: Protein sequences, DNA sequences

68W32: Algorithms on strings