%A WEI Qin-shuang, WU You-xi, LIU Jing-yu and ZHU Huai-zhong %T Distinguishing Sequence Patterns Mining Based on Density and Gap Constraints %0 Journal Article %D 2018 %J Computer Science %R 10.11896/j.issn.1002-137X.2018.04.042 %P 252-256 %V 45 %N 4 %U {https://www.jsjkx.com/CN/abstract/article_36.shtml} %8 2018-04-15 %X Distinguishing patterns mining is an important branch of sequence patterns mining,and distinguishing patterns with density constraint can help biologists to find the distribution of special factors on biological sequences.This paper proposed an algorithm,named MPDG(Mining distinguishing sequence Patterns based on Density and Gap constraint),which employs Nettree data structure to mine the distinguishing patterns satisfying the density and gap constraints.The algorithm is efficient since it calculates all super-patterns’ supports of current pattern with one-way scanning the sequence database.Experimental results on real protein datasets verify the effectiveness of MPDG.