Please use this identifier to cite or link to this item:
http://hdl.handle.net/10198/4386| 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 |
| URI: | http://hdl.handle.net/10198/4386 |
| ISBN: | 978-3-642-02480-1 |
| Publisher Version: | http://www.springerlink.com/content/k1n60h03r6504847/ |
| Appears in Collections: | ESA - Capítulos de Livros |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Efficient pattern matching in proteomic sequences.pdf | 247 kB | Adobe PDF | View/Open |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
