Please use this identifier to cite or link to this item: http://hdl.handle.net/1822/17402

TitleEfficient exact pattern-matching in proteomic sequences
Author(s)Deusdado, Sérgio
Carvalho, Paulo
KeywordsExact pattern-matching
Searching algorithms
exact pattern-match
Issue dateJun-2009
PublisherSpringer
JournalLecture Notes in Computer Science
CitationDeusdado 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
Abstract(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.
TypeConference paper
URIhttp://hdl.handle.net/1822/17402
ISBN9783642024801
DOI10.1007/978-3-642-02481-8_178
ISSN0302-9743
Publisher versionhttps://link.springer.com/chapter/10.1007%2F978-3-642-02481-8_178
Peer-Reviewedyes
AccessOpen access
Appears in Collections:DI/CCTC - Artigos (papers)

Files in This Item:
File Description SizeFormat 
Salamanca09-cr.pdfSalamanca09-cr.pdf (paper)247 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID