| dc.contributor.author | Hamborg, Thomas | |
| dc.contributor.author | Kleffe, Jürgen | |
| dc.contributor.editor | Huson, Daniel | |
| dc.contributor.editor | Kohlbacher, Oliver | |
| dc.contributor.editor | Lupas, Andrei | |
| dc.contributor.editor | Nieselt, Kay | |
| dc.contributor.editor | Zell, Andreas | |
| dc.date.accessioned | 2019-08-12T13:06:19Z | |
| dc.date.available | 2019-08-12T13:06:19Z | |
| dc.date.issued | 2006 | |
| dc.identifier.isbn | 978-3-88579-177-5 | |
| dc.identifier.issn | 1617-5468 | |
| dc.identifier.uri | http://dl.gi.de/handle/20.500.12116/24213 | |
| dc.description.abstract | ClustDB is a tool for the identification of perfect matches in large sets of sequences. It is faster and can handle at least 8 times more data than VMATCH, the most memory efficient exact program currently available. Still ClustDB needs about four hours to compare all Human ESTs. We therefore present a distributed and parallel implementation of ClustDB to reduce the execution time. It uses a message-passing library called MPI and runs on distributed workstation clusters with significant runtime savings. MPI-ClustDB is written in ANSI C and freely available on request from the authors. | en |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | German Conference on Bioinformatics | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-83 | |
| dc.title | MPI-ClustDB: A fast string matching strategy utilizing parallel computing | en |
| dc.type | Text/Conference Paper | |
| dc.pubPlace | Bonn | |
| mci.reference.pages | 33-39 | |
| mci.conference.sessiontitle | Regular Research Papers | |
| mci.conference.location | Tübingen | |
| mci.conference.date | September 19-22, 2006 | |
