Sciweavers

112 search results - page 10 / 23
» The Performance of Phylogenetic Methods on Trees of Bounded ...
Sort
View
BMCBI
2008
104views more  BMCBI 2008»
13 years 7 months ago
Comparison of methods for estimating the nucleotide substitution matrix
Background: The nucleotide substitution rate matrix is a key parameter of molecular evolution. Several methods for inferring this parameter have been proposed, with different math...
Maribeth Oscamou, Daniel McDonald, Von Bing Yap, G...
ANOR
2008
171views more  ANOR 2008»
13 years 7 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
SNPD
2004
13 years 8 months ago
Using extended phylogenetc profiles and support vector machines for protein family classification
We proposed a new approach to compare profiles when the correlations among attributes can be represented as a tree. To account for these correlations, the profile is extended with...
Kishore Narra, Li Liao
SC
1995
ACM
13 years 11 months ago
Parallelizing the Phylogeny Problem
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
Jeff A. Jones, Katherine A. Yelick
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
13 years 11 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster