Sciweavers

377 search results - page 2 / 76
» A Fast Heuristic Algorithm for a Probe Mapping Problem
Sort
View
CSB
2003
IEEE
13 years 10 months ago
Fast and Accurate Probe Selection Algorithm for Large Genomes
The oligo microarray (DNA chip) technology in recent years has a significant impact on genomic study. Many fields such as gene discovery, drug discovery, toxicological research ...
Wing-Kin Sung, Wah-Heng Lee
HPCC
2011
Springer
12 years 5 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
13 years 9 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
EOR
2008
107views more  EOR 2008»
13 years 5 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
COR
2006
75views more  COR 2006»
13 years 5 months ago
A new heuristic recursive algorithm for the strip rectangular packing problem
A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on heurist...
Defu Zhang, Yan Kang, Ansheng Deng