A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum

@inproceedings{Pisanti2003ABO,
  title={A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum},
  author={Nadia Pisanti and Maxime Crochemore and Roberto Grossi and Marie-France Sagot},
  booktitle={MFCS},
  year={2003}
}
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

A CSP for the Enumeration of Frequent-closed Patterns in Sequences

Riad Akram, BEN HAMADOU Abdelmajid, LOUKIL Zied
2015
View 2 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 13 references

o

A. Apostol
Pattern dis overy and the algorithmi s of surprise. In NATO ASI on Arti ial Intelligen e and Heuristi Methods for Bioinformati s. IOS press, • 2003
View 2 Excerpts

Un algorithme d ’ indexation de motifs approchés

S. Abdedda̋ım Pelfrêne
Journée Ouvertes Biologie Informatique Mathématiques ( JOBIM ) • 2002

hemore, R

N. Pisanti, M. Cr
Grossi, and M.-F. Sagot. A basis for repeated motifs in pattern dis overy and text mining. Te hni al Report IGM 2002-10, Institut Gaspard-Monge, University of Marne-la-Vall ee, July • 2002

m, and J

J. Pelfrêne, S. Abdedda
Alexandre. Un algorithme d'indexation de motifs appro h es. In Journ ee Ouvertes Biologie Informatique Math ematiques (JOBIM), pages 263{264, • 2002

o and L

A. Apostol
Parida. In remental paradigms of motif dis overy. unpub lished, • 2002

her and M

M. Fi
Paterson. String mat hing and other produ ts. In R. Karp, editor, SIAM AMS Complexity of Computation, pages 113{125, • 1974

Similar Papers

Loading similar papers…