Document
Generically Dependent Continuant
RDF description of A consensus algorithm for approximate pattern matching in protein sequences [Un algoritmo de consenso para la búsqueda aproximada de patrones en cadenas de proteínas] - http://orbis.uaslp.mx/vivo/individual/scopus2978
Article
Information Content Entity
A consensus algorithm for approximate pattern matching in protein sequences [Un algoritmo de consenso para la búsqueda aproximada de patrones en cadenas de proteínas]
In bioinformatics, one of the main tools which allow scientists to find common characteristics in protein or DNA sequences of different species is the approximate matching of strings. From the computational point of view, the difficulty of approximate string matching lies in finding adequate measures to efficiently compare two strings, since, in many cases, one is interested in performing searches in real time, within large databases. In this paper we propose a novel method for approximate string matching based on a generalization of the algorithm proposed by Baeza-Yates and Perleberg in 1996 for computing the Hamming distance between two sequences. In addition, a post-processing stage which significantly reduces the number of false positives is presented. The proposed method has been evaluated in synthetic cases of random sequences, and with real cases of plant protein sequences. Results show that the proposed algorithm is highly efficient in computational terms and in specificity, especially when compared against a previously published method, which is based on the phase correlation function.
Approximate string matching; Bioinformatics; Consensus algorithms; Protein sequences
Revista Mexicana de Ingenieria Biomedica