Repository logo
 
No Thumbnail Available
Publication

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

Use this identifier to reference this record.
Name:Description:Size:Format: 
2009-IJBRA 5404 Deusdado and Carvalho.pdf1.01 MBAdobe PDF Download

Advisor(s)

Abstract(s)

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.

Description

Keywords

Pattern-matching Sequence searching and analisys Motif discovery

Citation

International Journal of Bioinformatics Research and Applications. ISSN 1744-5485. 5:4 (2009) p. 385-401

Research Projects

Organizational Units

Journal Issue

Publisher

Inderscience Publishers

CC License