Maximal and minimal representations of gapped and non-gapped motifs of a string

DOI10.1016/J.TCS.2009.07.015zbMath1187.68187OpenAlexW2090511017WikidataQ58054159 ScholiaQ58054159MaRDI QIDQ732024

Esko Ukkonen

Publication date: 9 October 2009

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.015

zbMATH Keywords

NP-completenesspatterngap symbolmaximal motifminimal motifmotif discovery algorithmsequence motif

Mathematics Subject Classification ID

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

Related Items (3)

Motif trie: an efficient text index for pattern discovery with don't cares ⋮ Filtering degenerate patterns with application to protein sequence analysis ⋮ Efficient construction of maximal and minimal representations of motifs of a string

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of finding gapped motifs
• Longest repeats with a block of \(k\) don't cares
• Extracting approximate patterns
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• Mathematical Foundations of Computer Science 2003
• Algorithms and Computation

This page was built for publication: Maximal and minimal representations of gapped and non-gapped motifs of a string