Please use this identifier to cite or link to this item:
|Title:||DC: a highly efficient and flexible exact pattern-matching algorithm|
|Publisher:||Centro de Ciências e Tecnologias da Computação - Universidade do Minho|
|Citation:||Deusdado, Sérgio; Carvalho, Paulo (2009) - DC: a highly efficient and flexible exact pattern-matching algorithm. Braga: Universidade do Minho. TechReport;DI-CCTC-09-10|
|Abstract:||ware of the need for faster and flexible searching algorithms in fields such as web searching or bioinformatics, we propose DC - a high-performance algorithm for exact pattern matching. Emphasizing the analysis of pattern peculiarities in the pre-processing phase, the algorithm en- compasses a novel search logic based on the examination of multiple alignments within a larger window, selectively tested after a powerful heuristic called compatibility rule is verified. The new algorithm’s performance is, on average, above its best-rated competitors when testing different data types and using a complete suite of pattern extensions and compositions. The flexibility is remarkable and the efficiency is more relevant in quaternary or greater alphabets. Keywords: exact pattern-match, searching algorithms.|
|Appears in Collections:||CSE - Relatórios Técnicos/Científicos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.