Efficient construction of maximal and minimal representations of motifs of a string

DOI10.1016/j.tcs.2009.03.013zbMath1175.68573OpenAlexW2156601331WikidataQ58054155 ScholiaQ58054155MaRDI QIDQ2271439

Veli Mäkinen, François Nicolas, Esko Ukkonen

Publication date: 7 August 2009

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

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

zbMATH Keywords

fast Fourier transformsuffix treestring processingmotif discovery

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal and minimal representations of gapped and non-gapped motifs of a string
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
• Extracting approximate patterns
• Structural Analysis of Gapped Motifs of a String
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• On the sorting-complexity of suffix tree construction

This page was built for publication: Efficient construction of maximal and minimal representations of motifs of a string