Motif discovery by monotone scores

DOI10.1016/J.DAM.2005.09.017zbMATH Open1111.68098OpenAlexW1965288552MaRDI QIDQ876467FDOQ876467

Cinzia Pizzi, Alberto Apostolico

Publication date: 18 April 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.017

zbMATH Keywords

motifpattern matchingdesign and analysis of algorithmspattern discoverycorrection factormonotone scoreover-represented word

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Dictionary matching and indexing with errors and don't cares
• Title not available (Why is that?)

Cited In (2)

• Sequence similarity measures based on bounded Hamming distance
• \(k\)-difference matching in amortized linear time for all the words in a text

   Recommendations

• Scoring unusual words with varying mismatch errors 👍 👎
• 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 👍 👎
• Title not available (Why is that?) 👍 👎
• Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences 👍 👎

This page was built for publication: Motif discovery by monotone scores

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