Abstract
In bioinformatics and computational biology, methods for biological sequence comparison play the most important role for the interpretation of complex nucleotide and protein data such as the inference of relationships between genes, proteins and species; and the discovery of novel protein structures and functions. This type of inference is derived by sequence similarity matching on the databases of biological sequences. As many entire genomes have being determined at a rapid rate, computational methods for comparing genomic and protein sequences will be more essential for probing the complexity of genes, genomes, and molecular machines. In this paper we introduce a pattern-comparison algorithm, which is based on the mathematical concepts of linear predictive coding and its cepstral-distortion measures for the analyses of both DNA and protein sequences. The results obtained from several experiments on real datasets have shown the effectiveness of the proposed approach.