Author(s): Deusdado, Sérgio ; Carvalho, Paulo
Date: 2009
Persistent ID: https://hdl.handle.net/1822/17402
Origin: RepositóriUM - Universidade do Minho
Subject(s): Exact pattern-matching; Searching algorithms; exact pattern-match
Author(s): Deusdado, Sérgio ; Carvalho, Paulo
Date: 2009
Persistent ID: https://hdl.handle.net/1822/17402
Origin: RepositóriUM - Universidade do Minho
Subject(s): Exact pattern-matching; Searching algorithms; exact pattern-match
This paper proposes a novel algorithm for complete exact pattern-matching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficient considering larger alphabets. The searching strategy uses large search windows allowing multiple alignments per iteration. A new filtering heuristic, named compatibility rule, contributed decisively to the efficiency improvement. The new algorithm’s performance is, on average, superior in comparison with its best-rated competitors.