Autor(es): Deusdado, Sérgio ; Carvalho, Paulo
Data: 2009
Identificador Persistente: https://hdl.handle.net/1822/17402
Origem: RepositóriUM - Universidade do Minho
Assunto(s): Exact pattern-matching; Searching algorithms; exact pattern-match
Detalhes do Documento
Efficient exact pattern-matching in proteomic sequences
Descrição
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.
Tipo de Documento
Comunicação em conferência
Idioma Inglês
Contribuidor(es) RepositóriUM - Universidade do Minho
Idioma Inglês
Contribuidor(es) RepositóriUM - Universidade do Minho
