MINING APPROXIMATE REPEATING PATTERNS FROM SEQUENCE DATA WITH GAP CONSTRAINTS-Reference-Cited by-同舟云学术

MINING APPROXIMATE REPEATING PATTERNS FROM SEQUENCE DATA WITH GAP CONSTRAINTS

Published:2011-08 Issue:3 Volume:27 Page:336-362
ISSN:0824-7935
Container-title:Computational Intelligence
language:en
Short-container-title:

Author:

He Dan,Zhu Xingquan,Wu Xindong

Publisher

Wiley

Subject

Artificial Intelligence,Computational Mathematics

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/j.1467-8640.2011.00383.x/fullpdf

Reference38 articles.

1. An efficient algorithm for finding short approximate non-tandem repeats;Adebiyi;Bioinformatics,2001

2. Agrawal , R. R. Srikant 1994 Fast algorithms for mining association rules In Proceedings of the 20th International Conference Very Large Data Bases, Santiago de Chile, Chile, VLDB 1215 487 499

3. Basic local alignment search tool;Altschul;Journal of Moledular Biology,1990

4. A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence;Arimura;International Symposium Algorithms and Computation,2005

5. Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expression;Boeva;Bioinformatics,2006

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

1. Co-occurrence pattern mining based on a biological approximation scoring matrix;Pattern Analysis and Applications;2017-02-28

2. Frequent Pattern Mining Based on Approximate Edit Distance Matrix;2016 IEEE First International Conference on Data Science in Cyberspace (DSC);2016-06

3. PMBC: Pattern mining from biological sequences with wildcard constraints;Computers in Biology and Medicine;2013-06

4. Mining Interesting and Contiguous Maximal Sequential Patterns on High Dimensional Sequences;2013 Fifth International Conference on Measuring Technology and Mechatronics Automation;2013-01