Sciweavers

575 search results - page 25 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
BMCBI
2004
156views more  BMCBI 2004»
13 years 7 months ago
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
Martin Schmollinger, Kay Nieselt, Michael Kaufmann...
IPPS
2005
IEEE
14 years 1 months ago
Modeling and Taming Parallel TCP on the Wide Area Network
— Parallel TCP flows are broadly used in the high performance distributed computing community to enhance network throughput, particularly for large data transfers. Previous rese...
Dong Lu, Yi Qiao, Peter A. Dinda, Fabián E....
PODC
2009
ACM
14 years 8 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
EUROPAR
2004
Springer
13 years 11 months ago
Imprecise Exceptions in Distributed Parallel Components
Abstract. Modern microprocessors have sacrificed the exactness of exceptions for improved performance long ago. This is a side effect of reordering instructions so that the micropr...
Kostadin Damevski, Steven G. Parker
TVLSI
2008
90views more  TVLSI 2008»
13 years 7 months ago
A Special-Purpose Architecture for Solving the Breakpoint Median Problem
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
Jason D. Bakos, Panormitis E. Elenis