Sciweavers

3320 search results - page 60 / 664
» Heuristics for the Phylogeny Problem
Sort
View
BMCBI
2008
121views more  BMCBI 2008»
13 years 10 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
14 years 2 months ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret
JCB
2008
81views more  JCB 2008»
13 years 10 months ago
Estimating the Ancestral Recombinations Graph (ARG) as Compatible Networks of SNP Patterns
Traditionally nonrecombinant genome, i.e., mtDNA or Y chromosome, has been used for phylogeography, notably for ease of analysis. The topology of the phylogeny structure in this c...
Laxmi Parida, Marta Melé, Francesc Calafell...
EVOW
2007
Springer
14 years 4 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
HEURISTICS
2006
197views more  HEURISTICS 2006»
13 years 10 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa