Please use this identifier to cite or link to this item:
Title: Efficient exact pattern-matching in proteomic sequences
Author: Deusdado, Sérgio
Carvalho, Paulo
Keywords: Exact pattern-match
Searching algorithms
Issue Date: 2009
Publisher: Springer-Verlag
Citation: 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
Abstract: 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
ISBN: 978-3-642-02480-1
Publisher Version:
Appears in Collections:CSE - Capítulos de Livros

Files in This Item:
File Description SizeFormat 
Efficient pattern matching in proteomic sequences.pdf247 kBAdobe PDFView/Open

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.