Publicação

GRASPm: An efficient algorithm for exact pattern-matching in genomic sequences

Ver documento

Detalhes bibliográficos
Resumo:In this paper, we propose Genomic-oriented Rapid Algorithm for String Pattern-match (GRASPm), an algorithm centred on overlapped 2-grams analysis, which introduces a novel filtering heuristic – the compatibility rule – achieving significant efficiency gain. GRASPm's foundations rely especially on a wide searching window having the central duplet as reference for fast filtering of multiple alignments. Subsequently, superfluous detailed verifications are summarily avoided by filtering the incompatible alignments using the idcd (involving duplet of central duplet) concept combined with pre-processed conditions, allowing fast parallel testing for multiple alignments. Comparative performance analysis, using diverse genomic data, shows that GRASPm is faster than its competitors.
Autores principais:Deusdado, Sergio
Outros Autores:Carvalho, Paulo
Assunto:pattern-matching sequence searching Motif discovery Sequence searching and analysis
Ano:2009
País:Portugal
Tipo de documento:artigo
Tipo de acesso:acesso restrito
Instituição associada:Universidade do Minho
Idioma:inglês
Origem:RepositóriUM - Universidade do Minho

Registos relacionados

Registos relacionados