Logo des Repositoriums
 

MPI-ClustDB: A fast string matching strategy utilizing parallel computing

dc.contributor.authorHamborg, Thomas
dc.contributor.authorKleffe, Jürgen
dc.contributor.editorHuson, Daniel
dc.contributor.editorKohlbacher, Oliver
dc.contributor.editorLupas, Andrei
dc.contributor.editorNieselt, Kay
dc.contributor.editorZell, Andreas
dc.date.accessioned2019-08-12T13:06:19Z
dc.date.available2019-08-12T13:06:19Z
dc.date.issued2006
dc.description.abstractClustDB 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.identifier.isbn978-3-88579-177-5
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/24213
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofGerman Conference on Bioinformatics
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-83
dc.titleMPI-ClustDB: A fast string matching strategy utilizing parallel computingen
dc.typeText/Conference Paper
gi.citation.endPage39
gi.citation.publisherPlaceBonn
gi.citation.startPage33
gi.conference.dateSeptember 19-22, 2006
gi.conference.locationTübingen
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
33.pdf
Größe:
217.61 KB
Format:
Adobe Portable Document Format