Mathematical Foundations of Computer Science 2003

DOI10.1007/B11836MaRDI QIDQ5431350zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• A framework for the construction of self-replicating tilings
• Tilings and quasiperiodicity
• Quasi-periodic tiling with multiplicity: a lattice enumeration approach
• An application of topological multiple recurrence to tiling
• Quasiperiodic tiling in two and three dimensions
• Quasiperiodicity and randomness in tilings of the plane
• Tilings: simulation and universality
• An alternative view on quasicrystalline random tilings
• A geometrical approach of quasiperiodic tilings
• Quasiperiodicity and non-computability in tilings

Cited in

(7)

• Motif trie: an efficient text index for pattern discovery with don't cares
• Algorithms for extracting motifs from biological weighted sequences
• Extracting approximate patterns
• Pattern masking for dictionary matching: theory and practice
• Extracting string motif bases for quorum higher than two
• 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

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

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