Utilize este identificador para referenciar este registo: http://hdl.handle.net/10198/4386
Título: Efficient exact pattern-matching in proteomic sequences
Autor: Deusdado, Sérgio
Carvalho, Paulo
Palavras-chave: Exact pattern-match
Searching algorithms
Data: 2009
Editora: Springer-Verlag
Citação: Deusdado, Sérgio; Carvalho, Paulo (2009) - Efficient exact pattern-matching in proteomic sequences. In Omatu, Sigeru [et al.] Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living. Berlin: Springer-Verlag. p. 1178-1186. ISBN 978-3-642-02480-1
Resumo: 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.
Peer review: yes
URI: http://hdl.handle.net/10198/4386
ISBN: 978-3-642-02480-1
Versão do Editor: http://www.springerlink.com/content/k1n60h03r6504847/
Aparece nas colecções:CSE - Capítulos de Livros

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
Efficient pattern matching in proteomic sequences.pdf247 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.