Sciweavers

840 search results - page 155 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
SSD
2007
Springer
133views Database» more  SSD 2007»
14 years 3 months ago
Compression of Digital Road Networks
Abstract. In the consumer market, there has been an increasing interest in portable navigation systems in the last few years. These systems usually work on digital map databases st...
Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T...
WABI
2007
Springer
110views Bioinformatics» more  WABI 2007»
14 years 3 months ago
Haplotype Inference Via Hierarchical Genotype Parsing
The within-species genetic variation due to recombinations leads to a mosaic-like structure of DNA. This structure can be modeled, e.g. by parsing sample sequences of current DNA w...
Pasi Rastas, Esko Ukkonen
IPPS
2005
IEEE
14 years 3 months ago
FROST: Revisited and Distributed
FROST (Fold Recognition-Oriented Search Tool) [6] is a software whose purpose is to assign a 3D structure to a protein sequence. It is based on a series of filters and uses a dat...
Vincent Poirriez, Rumen Andonov, Antoine Marin, Je...
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
14 years 3 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
BIRTHDAY
2003
Springer
14 years 3 months ago
Comet in Context
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
Laurent Michel, Pascal Van Hentenryck