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

DOI10.1016/j.tcs.2009.07.014zbMath1187.68288MaRDI QIDQ732023

Roberto Grossi, Nadia Pisanti, Giovanni Battaglia, Davide Cangelosi

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

zbMATH Keywords

doubling algorithm; partial order set; motif inference; pattern with don't care

Mathematics Subject Classification ID

68P10: Searching and sorting

68Q45: Formal languages and automata

Related Items

Compressed spaced suffix arrays

Uses Software

• PatternHunter

Cites Work

• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
• Computational aspects of monotone dualization: a brief survey
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• Perfect hashing
• On spaced seeds for similarity search
• Cache-Oblivious Algorithms
• 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
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• A data structure for manipulating priority queues
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item