title: An improved alignment-free model for DNA sequence similarity metric.
abstract: BACKGROUND
  DNA Clustering is an important technology to automatically find the inherent relationships on a large scale of DNA sequences. But the DNA clustering quality can still be improved greatly. The DNA sequences similarity metric is one of the key points of clustering. The alignment-free methodology is a very popular way to calculate DNA sequence similarity. It normally converts a sequence into a feature space based on words' probability distribution rather than directly matches strings. Existing alignment-free models, e.g. k-tuple, merely employ word frequency information and ignore many types of useful information contained in the DNA sequence, such as classifications of nucleotide bases, position and the like. It is believed that the better data mining results can be achieved with compounded information. Therefore, we present a new alignment-free model that employs compounded information to improve the DNA clustering quality.
  
  
  RESULTS
  This paper proposes a Category-Position-Frequency (CPF) model, which utilizes the word frequency, position and classification information of nucleotide bases from DNA sequences. The CPF model converts a DNA sequence into three sequences according to the categories of nucleotide bases, and then yields a 12-dimension feature vector. The feature values are computed by an entropy based model that takes both local word frequency and position information into account. We conduct DNA clustering experiments on several datasets and compare with some mainstream alignment-free models for evaluation, including k-tuple, DMk, TSM, AMI and CV. The experiments show that CPF model is superior to other models in terms of the clustering results and optimal settings.
  
  
  CONCLUSIONS
  The following conclusions can be drawn from the experiments. (1) The hybrid information model is better than the model based on word frequency only. (2) For DNA sequences no more than 5000 characters, the preferred size of sliding windows for CPF is two which provides a great advantage to promote system performance. (3) The CPF model is able to obtain an efficient stable performance and broad generalization.
authors.affiliation: Department of Computer Science and Technology Xi'an Jiaotong University, West Xianning Road, 710049 Xi'an, P,R, China. baojp@mail.xjtu.edu.cn.
authors.forename: Junpeng
authors.initials: J
authors.lastname: Bao
authors.forename: Ruiyu
authors.initials: R
authors.lastname: Yuan
authors.forename: Zhe
authors.initials: Z
authors.lastname: Bao
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D004247:DNA / Q000235:genetics*; D019277:Entropy; D015233:Models, Statistical; D017422:Sequence Analysis, DNA / Q000379:methods*
chemical_list: D004247:DNA