Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/17402| Título: | Efficient exact pattern-matching in proteomic sequences |
| Autor(es): | Deusdado, Sérgio Carvalho, Paulo |
| Palavras-chave: | Exact pattern-matching Searching algorithms exact pattern-match |
| Data: | Jun-2009 |
| Editora: | Springer |
| Revista: | Lecture Notes in Computer Science |
| Citação: | Deusdado S., Carvalho P. (2009) Efficient Exact Pattern-Matching in Proteomic Sequences. In: Omatu S. et al. (eds) Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living. IWANN 2009. Lecture Notes in Computer Science, vol 5518. Springer, Berlin, Heidelberg |
| Resumo(s): | 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: | Artigo em ata de conferência |
| URI: | https://hdl.handle.net/1822/17402 |
| ISBN: | 9783642024801 |
| DOI: | 10.1007/978-3-642-02481-8_178 |
| ISSN: | 0302-9743 |
| Versão da editora: | https://link.springer.com/chapter/10.1007%2F978-3-642-02481-8_178 |
| Arbitragem científica: | yes |
| Acesso: | Acesso aberto |
| Aparece nas coleções: | DI/CCTC - Artigos (papers) |
Ficheiros deste registo:
| Ficheiro | Descrição | Tamanho | Formato | |
|---|---|---|---|---|
| Salamanca09-cr.pdf | Salamanca09-cr.pdf (paper) | 247 kB | Adobe PDF | Ver/Abrir |
