Sciweavers

2930 search results - page 530 / 586
» The optimal sequence compression
Sort
View
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 9 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
BIBE
2003
IEEE
15 years 9 months ago
An Investigation of Phylogenetic Likelihood Methods
Abstract— We analyze the performance of likelihoodbased approaches used to reconstruct phylogenetic trees. Unlike other techniques such as Neighbor-Joining (NJ) and Maximum Parsi...
Tiffani L. Williams, Bernard M. E. Moret
ISIPTA
2003
IEEE
125views Mathematics» more  ISIPTA 2003»
15 years 9 months ago
Game-Theoretic Learning Using the Imprecise Dirichlet Model
We discuss two approaches for choosing a strategy in a two-player game. We suppose that the game is played a large number of rounds, which allows the players to use observations o...
Erik Quaeghebeur, Gert de Cooman
SPAA
2003
ACM
15 years 9 months ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
Gagan Aggarwal, Rajeev Motwani, An Zhu
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
15 years 9 months ago
Studying the Advantages of a Messy Evolutionary Algorithm for Natural Language Tagging
The process of labeling each word in a sentence with one of its lexical categories (noun, verb, etc) is called tagging and is a key step in parsing and many other language processi...
Lourdes Araujo