Author:
Grossi Roberto,Pietracaprina Andrea,Pisanti Nadia,Pucci Geppino,Upfal Eli,Vandin Fabio
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of 20th VLDB, pp. 487–499 (1994)
2. Apostolico, A., Comin, M., Parida, L.: VARUN: discovering extensible motifs under saturation constraints. IEEE Trans. on Computational Biology and Bioinformatics (to appear, 2009)
3. Apostolico, A., Parida, L.: Incremental paradigms of motif discovery. Journal of Computational Biology 11(1), 15–25 (2004)
4. Lecture Notes in Computer Science;A. Apostolico,2007
5. Apostolico, A., Tagliacollo, C.: Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n 2 log n) time. Theoretical Computer Science 408(2-3), 106–115 (2008)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Longest k-tuple Common Sub-Strings;2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM);2022-12-06
2. SIESTA: A Scalable InfrastructurE of Sequential paTtern Analysis;IEEE Transactions on Big Data;2022
3. ACME: A scalable parallel system for extracting frequent patterns from a very long sequence;The VLDB Journal;2014-10-02
4. Irredundant tandem motifs;Theoretical Computer Science;2014-03
5. Parallel motif extraction from very long sequences;Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13;2013