Utilize este identificador para referenciar este registo: http://hdl.handle.net/1822/52726

TítuloGRASPm: An efficient algorithm for exact pattern-matching in genomic sequences
Autor(es)Deusdado, Sergio
Carvalho, Paulo
Palavras-chavepattern-matching
sequence searching
Motif discovery
Sequence searching and analysis
Data2009
EditoraInderscience
RevistaInternational Journal of Bioinformatics Research and Applications
Resumo(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.
Tipoarticle
Descriçãohttp://www.inderscience.com/search/index.php?action=record&rec_id=27510&prevQuery=&ps=10&m=or
URIhttp://hdl.handle.net/1822/52726
DOI10.1504/IJBRA.2009.027510
ISSN1744-5493
1744-5485
Versão da editorahttp://www.inderscience.com/browse/index.php?journalID=155
Arbitragem científicayes
AcessorestrictedAccess
Aparece nas coleções:DI/CCTC - Artigos (papers)

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
IJBRA 5404 Deusdado and Carvalho.pdfpaper (preprint)1,03 MBAdobe PDFVer/Abrir  Solicitar cópia ao autor!

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu Currículo DeGóis