Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68454OpenAlexW2495578842MaRDI QIDQ5431350

Maxime Crochemore, Marie-France Sagot, Roberto Grossi, Nadia Pisanti

Publication date: 7 December 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11836

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (6)

Motif trie: an efficient text index for pattern discovery with don't cares ⋮ Algorithms for extracting motifs from biological weighted sequences ⋮ Extracting string motif bases for quorum higher than two ⋮ An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence ⋮ Maximal and minimal representations of gapped and non-gapped motifs of a string ⋮ Extracting approximate patterns

This page was built for publication: Mathematical Foundations of Computer Science 2003