Abstract
We investigate the problem of determining the basis of motifs (a form of repeated patterns with don’t cares) in an input string. We give new upper and lower bounds on the problem, introducing a new notion of basis that is provably smaller than (and contained in) previously defined ones. Our basis can be computed in less time and space, and is still able to generate the same set of motifs. We also prove that the number of motifs in all these bases grows exponentially with the quorum, the minimal number of times a motif must appear. We show that a polynomial-time algorithm exists only for fixed quorum.
The full version of this paper is available in [11] as technical report TR-03-02.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apostolico, A., Parida, L.: Incremental paradigms of motif discovery (2002) (unpublished)
Apostolico, A., Parida, L.: Compression and the wheel of fortune. In: IEEE Data Compression Conference (DCC 2003), pp. 143–152 (2003)
Apostolico, A.: Pattern discovery and the algorithmics of surprise. In: NATO ASI on Artificial Intelligence and Heuristic Methods for Bioinformatics. IOS press, Amsterdam (2003)
Apostolico, A.: Personal communication (May 2003)
Fischer, M., Paterson, M.: String matching and other products. In: Karp, R. (ed.) SIAM AMS Complexity of Computation, pp. 113–125 (1974)
Mannila, H.: Local and global methods in data mining: basic techniques and open problems. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 57–68. Springer, Heidelberg (2002)
Parida, L., Rigoutsos, I., Floratos, A., Platt, D., Gao, Y.: Pattern Discovery on Character Sets and Real-valued Data: Linear Bound on Irredundant Motifs and Efficient Polynomial Time Algorithm. In: SIAM Symposium on Discrete Algorithms (2000)
Pelfrêne, J., Abdeddai̋m, S., Alexandre, J.: Un algorithme d’indexation de motifs approchés. In: Journée Ouvertes Biologie Informatique Mathématiques (JOBIM), pp. 263–264 (2002)
Pelfrêne, J., Abdeddai̋m, S., Alexandre, J.: Extracting approximare patterns. In: Combinatorial Pattern Matching (2003) (to appear)
Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.-F.: A basis for repeated motifs in pattern discovery and text mining. Technical Report IGM 2002-10, Institut Gaspard-Monge, University of Marne-la-Vallée (July 2002)
Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.-F.: Bases of motifs for generating repeated patterns with don’t cares. Technical Report TR-03-02, Dipartimento di Informatica, University of Pisa (January 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.F. (2003). A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-45138-9_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40671-6
Online ISBN: 978-3-540-45138-9
eBook Packages: Springer Book Archive