A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum-Reference-Cited by-同舟云学术

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

Published:2003 Issue: Volume: Page:622-631
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2003
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45138-9_56

Reference11 articles.

1. Apostolico, A., Parida, L.: Incremental paradigms of motif discovery (2002) (unpublished)

2. Apostolico, A., Parida, L.: Compression and the wheel of fortune. In: IEEE Data Compression Conference (DCC 2003), pp. 143–152 (2003)

3. Apostolico, A.: Pattern discovery and the algorithmics of surprise. In: NATO ASI on Artificial Intelligence and Heuristic Methods for Bioinformatics. IOS press, Amsterdam (2003)

4. Apostolico, A.: Personal communication (May 2003)

5. Fischer, M., Paterson, M.: String matching and other products. In: Karp, R. (ed.) SIAM AMS Complexity of Computation, pp. 113–125 (1974)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Pattern Masking for Dictionary Matching: Theory and Practice;Algorithmica;2024-03-06

2. Comparison Between SAT-Based and CSP-Based Approaches to Resolve Pattern Mining Problems;Hybrid Intelligent Systems;2015-11-17

3. Extracting string motif bases for quorum higher than two;Theoretical Computer Science;2012-11

4. Faster Variance Computation for Patterns with Gaps;Lecture Notes in Computer Science;2012

5. General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations;Machine Learning and Knowledge Discovery in Databases;2012