Seed-driven learning of position probability matrices from large sequence sets

DOI10.4230/LIPICS.WABI.2017.25MaRDI QIDQ5111835zbMATH OpenOpenAlexFDO

Authors Jarkko Toivonen, Jussi Taipale, Esko Ukkonen

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.WABI.2017.25

zbMATH Keywords

Hamming distancemotif findingseedsequence analysistranscription factor binding site

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to biology (92-04) Protein sequences, DNA sequences (92D20)

Recommendations

• Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
• Discovering almost any hidden motif from multiple sequences
• Large Scale Matching for Position Weight Matrices
• Probabilistic analysis of a motif discovery algorithm for multiple sequences
• Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences

Cites work

• A Space-Economical Suffix Tree Construction Algorithm
• On-line construction of suffix trees

Cited in

(2)

• SeedHam
• scientific article; zbMATH DE number 5049186 (Why is no real title available?)

Describes a project that uses

Uses Software

• TRANSFAC
• DREME
• JASPAR
• DECOD
• GitHub

This page was built for publication: Seed-driven learning of position probability matrices from large sequence sets

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