Skip to main navigation Skip to search Skip to main content

Cache-based parallelization of multiple sequence alignment problem

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

5 Scopus citations

Abstract

In this paper we present new approach to the problem of parallel multiple sequence alignment. The proposed method is based on the application of caching technique and is aimed to solve, with high precision, large alignment instances on the heterogeneous clusters. The cache is used to store partial alignment guiding trees which can be reused in future computations, and is applied to eliminate redundancy of computations in parallel environment. We describe an implementation based on the CaLi library, the software designed for caches implementation. We report preliminary experimental results and finally, we propose some extensions of our method.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsMarco Danelutto, Marco Vanneschi, Domenico Laforenza
PublisherSpringer Verlag
Pages1005-1012
Number of pages8
ISBN (Print)3540229248
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3149

Fingerprint

Dive into the research topics of 'Cache-based parallelization of multiple sequence alignment problem'. Together they form a unique fingerprint.

Cite this