A Novel Efficient Mining Algorithm for Frequent Patterns on Biological Multiple Sequence

Wei Liu; Ling Chen

doi:10.4028/www.scientific.net/AMM.44-47.3697

Paper Titles

The Past and Future of Phyllostachys nigra in Putuo Mountains
p.3677

Human Tracking Method Based on Maximally Stable Extremal Regions with Multi-Cameras
p.3681

The Comprehensive Evaluation of Regional Agricultural Brand Competitiveness Based on Fuzzy Gray Analysis
p.3687

An Equilibrium Principle on the AON Network for Single-Machine Scheduling Problem with Time Lags
p.3692

A Novel Efficient Mining Algorithm for Frequent Patterns on Biological Multiple Sequence
p.3697

Control of Testing Device Based on FluidSIM-P
p.3702

A Color Error Correction Mode for Digital Camera
p.3706

Tooth Contact Analysis of the Double Circular Arc Tooth Spiral Bevel Gear
p.3711

Research of Motor Fault Diagnosis by Detecting Dynamic Model Parameters
p.3716

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 44-47A Novel Efficient Mining Algorithm for Frequent...

A Novel Efficient Mining Algorithm for Frequent Patterns on Biological Multiple Sequence

Abstract:

In order to overcome the shortcomings of traditional algorithms, the algorithm MSPM was proposed. It used longer patterns for mining, which avoided producing lots of patterns with short length. Meanwhile by the use of prefix tree of primary frequent patterns, we extended the primary patterns which avoided plenty of irrelevant patterns. The experimental results show that MSPM not only improves the performance but also achieves effective mining results.

You might also be interested in these eBooks

Frontiers of Manufacturing and Design Science

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 44-47)

Pages:

3697-3701

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.44-47.3697

Citation:

Cite this paper

Online since:

December 2010

Authors:

Wei Liu, Ling Chen

Keywords:

Biological Multiple Sequence, Prefix Tree, Primary Frequent Pattern

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Srikant R, Agrawal R. Mining sequential patterns: Generalization and performance improvements[C]. In: Apers PMG, Bouzeghoub M, Gardarin G, eds. Advances in Database Technology, Proc. of the 15th Int'l Conf. on Extending Database Technology. London.

Google Scholar

[2] Apostolico A, Prefarata F. Optimal off-line detection of repetitions in a string[J]. Theoretical Computer Science, 1983, 22(3): 297-315.

DOI: 10.1016/0304-3975(83)90109-3

Google Scholar

[3] Delgrange O, Rivals E. STAR: An algorithm to search for tandem approximate repeats[J]. Bioinformatics, 2004, 20(16): 2812-2820.

DOI: 10.1093/bioinformatics/bth335

Google Scholar

[4] Benson G. Tandem repeats finder: A program to analyze DNA sequences[J]. Nucleic Acids Research, 1999, 27(2): 573-580.

DOI: 10.1093/nar/27.2.573

Google Scholar

[5] Xiong Yun, Zhu Yangyong. BioPM: An Efficient Algorithm for Protein Motif Mining[C]. In: Proc. of ICBBE'07. [S. l. ]: IEEE Press, 2007. 394-397.

Google Scholar

[6] Guo Shun, Jiang Qingshan, Wang Beizhan, Shi Liang. A new pattern mining algorithm for protein sequences[J]. Computer Engineering, 2009. 4, 35(8), pp: 208-210.

Google Scholar

[7] Bateman A, Birney E, Cerruti L, et al. The Pfam Protein Families Database[J]. Nucleic Acids Res., 2002, 30(1): 276-288.

DOI: 10.1093/nar/30.1.276

Google Scholar