83 search results - page 15 / 17 » Upper bounds on maximum likelihood for phylogenetic trees |
ICCS
2005
Springer
14 years 4 months ago
2005
Springer
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
SWAT
1992
Springer
14 years 2 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
ICC
2007
IEEE
14 years 5 months ago
2007
IEEE
Abstract— This paper proposes a new MIMO-OFDM precoding method that minimizes BER of the maximum likelihood detection (MLD). Conventional MIMO precoding methods can approximately...
JOC
2008
13 years 10 months ago
2008
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
ICDE
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...