Sciweavers

1075 search results - page 75 / 215
» Comparison of Genomes Using High-Performance Parallel Comput...
Sort
View
ICS
1993
Tsinghua U.
14 years 1 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
BMCBI
2010
108views more  BMCBI 2010»
13 years 6 months ago
BIGSdb: Scalable analysis of bacterial genome variation at the population level
Background: The opportunities for bacterial population genomics that are being realised by the application of parallel nucleotide sequencing require novel bioinformatics platforms...
Keith A. Jolley, Martin C. J. Maiden
GRID
2008
Springer
13 years 10 months ago
Which network measurement tool is right for you? a multidimensional comparison study
Network performance measurement and prediction is one of the most prominent and indispensable components in distributed computing environments. The selection of the most advantage...
Esma Yildirim, Ibrahim H. Suslu, Tevfik Kosar
PDP
2009
IEEE
14 years 3 months ago
Two Formal Semantics of a Subset of the Paderborn University BSPlib
PUB (Paderborn University BSPLib) is a C library supporting the development of Bulk-Synchronous Parallel (BSP) algorithms. The BSP model allows an estimation of the execution time...
Frédéric Gava, Jean Fortin
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
13 years 9 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen