Masking patterns in sequences: A new class of motif discovery with don't cares

DOI10.1016/J.TCS.2009.07.014zbMATH Open1187.68288OpenAlexW2047973219MaRDI QIDQ732023FDOQ732023

Authors: Giovanni Battaglia, Davide Cangelosi, Roberto Grossi, Nadia Pisanti 

Publication date: 9 October 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://eprints.adm.unipi.it/644/1/Final_version_Battaglia_Cangelosi_Grossi_Pisanti.pdf

Recommendations

• Maximal motif discovery in a sliding window
• Motif trie: an efficient text index for pattern discovery with don't cares
• Discovering almost any hidden motif from multiple sequences
• Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability
• scientific article; zbMATH DE number 1786452

zbMATH Keywords

doubling algorithmpartial order setmotif inferencepattern with don't care

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Cache-oblivious algorithms
• Title not available (Why is that?)
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Title not available (Why is that?)
• Computational aspects of monotone dualization: a brief survey
• Perfect hashing
• On spaced seeds for similarity search
• Title not available (Why is that?)
• A data structure for manipulating priority queues
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Efficient Algorithm for the Transversal Hypergraph Generation
• Subset Seed Automaton
• Structural Analysis of Gapped Motifs of a String
• Seed-Based Exclusion Method for Non-coding RNA Gene Search
• Proximity MergeSort, optimal in-place sorting in the cache-oblivious model

Cited In (5)

• Discovering almost any hidden motif from multiple sequences
• Compressed spaced suffix arrays
• Motif trie: an efficient text index for pattern discovery with don't cares
• Maximal motif discovery in a sliding window
• Pattern masking for dictionary matching: theory and practice

Uses Software

• PatternHunter

This page was built for publication: Masking patterns in sequences: A new class of motif discovery with don't cares

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