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

DOI10.4230/LIPICS.WABI.2017.25zbMATH Open1443.92147OpenAlexW2751154915MaRDI QIDQ5111835FDOQ5111835

Jarkko Toivonen, Esko Ukkonen, Jussi Taipale

Publication date: 27 May 2020

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

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

zbMATH Keywords

Hamming distancesequence analysisseedmotif findingtranscription factor binding site

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• SeedHam
• Title not available (Why is that?)

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)