Name
Abstract | ||
|---|---|---|
Comparing genetic sequences is a well-known problem in bioinformatics. Newly determined sequences are being compared to known sequences stored in databases in order to investigate biological functions. In recent years the number of available sequences has increased exponentially. Because of this explosion a speedup in the comparison process is highly required. To meet this demand we implemented a dynamic programming algorithm for sequence alignment on reconfigurable hardware. The algorithm we implemented, Smith-Waterman-Gotoh (SWG) has not been implemented in hardware before. We show a speedup factor of 40 in a design that scales well with the size of the available hardware. We also demonstrate the limits of larger hardware for small problems, and project our design on the largest Field Programmable Gate Array (FPGA) available today. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1145/1146847.1146880 | Infoscale |
Keywords | Field | DocType |
genetic sequence,biological function,speedup factor,reconfigurable hardware,available sequence,comparison process,scalable hardware accelerator,known sequence,larger hardware,protein sequence,dynamic programming algorithm,available hardware,genetics,hardware accelerator,field programmable gate array,sequence alignment,flows,web services | Dynamic programming,Computer science,Field-programmable gate array,Hardware acceleration,Web service,Scalability,Reconfigurable computing,Speedup,Distributed computing | Conference |
ISBN | Citations | PageRank |
1-59593-428-6 | 9 | 0.59 |
References | Authors | |
2 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippe Faes | 1 | 20 | 2.43 |
| Bram Minnaert | 2 | 9 | 0.59 |
| Mark Christiaens | 3 | 149 | 12.79 |
| Eric Bonnet | 4 | 148 | 10.86 |
| Yvan Saeys | 5 | 1981 | 87.58 |
| dirk stroobandt | 6 | 833 | 101.36 |
| Yves Van de Peer | 7 | 947 | 89.02 |