Extracting Approximate Patterns

@inproceedings{Pelfrne2003ExtractingAP,
  title={Extracting Approximate Patterns},
  author={Johann Pelfr{\^e}ne and Sa{\"i}d Abdedda{\"i}m and Jo{\"e}l Alexandre},
  booktitle={CPM},
  year={2003}
}
In this paper, we define a family of patterns with don’t cares occurring in a text. We call primitive patterns. The set of primitive patterns forms a basis for all the maximal patterns occ in the text. The number of primitive patterns is smaller than other known basis. We present an incremental algorithm that computes the primitive patterns occurring at q times in a text of lengthn, given theN primitive patterns occurring at least q − 1 times, in time O(|Σ |Nn2 logn), whereΣ is the alphabet. In… CONTINUE READING

References

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

Un algorithme d’indexation de motifs approchés (poster a talk)

  • J. Pelfrêne, S. Abdeddaïm, J. Alexandre
  • in: Journées Ouvertes Biologie Informatique Math…
  • 2002
Highly Influential
5 Excerpts

Bases of motifs for generating repeated patter don ’ t cares , Tech

  • M. Crochemore N. Pisanti, R. Grossi, M.-F. Sagot
  • 2003

Bases of motifs for generating repeated patter don’t cares

  • N. Pisanti, M. Crochemore, R. Grossi, M.-F. Sagot
  • Tech. Rep. TR-03-02,
  • 2003
3 Excerpts

Schnelle multiplikation grosser zahlen , Computer ( Arch

  • M. S. Paterson M. J. Fischer, V. Strassen A. Schönhage
  • Proceedings of the 14 th annual symposium on…
  • 2003

Similar Papers

Loading similar papers…