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_26zbMATH Open1241.68134OpenAlexW1515202403MaRDI 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

Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (1)

An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

This page was built for publication: Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability

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