A 2D Pattern Matching Algorithm for Comparing Primary Protein Sequences

ISSN: 2212-392X (Online)
ISSN: 1574-8936 (Print)

Volume 12, 6 Issues, 2017

Download PDF Flyer

Current Bioinformatics

This journal supports open access

Aims & ScopeAbstracted/Indexed in

Submit Abstracts Online Submit Manuscripts Online

Yi-Ping Phoebe Chen
Department of Computer Science and Information Technology
La Trobe University

View Full Editorial Board

Subscribe Purchase Articles Order Reprints

Current: 0.77
5 - Year: 0.93

A 2D Pattern Matching Algorithm for Comparing Primary Protein Sequences

Current Bioinformatics, 9(3): 210-217.

Author(s): Guohua Huang, Weiping Huang, Wenping Xie, Yongfan Li, Lixin Xu and Houqing Zhou.

Affiliation: Department of Mathematics, Shaoyang University, Shaoyang, Hunan 422000, China.


Sequence comparison in the form of alignment plays a crucial role in the area of bioinformatics. However, alignment is commonly restricted by the number of aligned sequences. To address this problem, we presented a 2D pattern matching algorithm for comparing protein sequences. The new algorithm which is an alignment-free comparison is capable of allowing fast comparison even among a large number of protein sequences. The simulation on the artificial sequences indicated that our method would be robust. And the experiment on real protein sequences showed that our method would be effective.


Alignment, alignment-free comparison, binary tree, graphical representation, phylogenetic tree, sequence, similarity distance.

Purchase Online Order Reprints Order Eprints Rights and Permissions

Article Details

Volume: 9
Issue Number: 3
First Page: 210
Last Page: 217
Page Count: 8
DOI: 10.2174/1574893609666140516005556
Price: $58

Related Journals

Webmaster Contact: urooj@benthamscience.org Copyright © 2016 Bentham Science