16093 search results - page 115 / 3219 » On the optimality of the neighbor-joining algorithm |
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
115
click to vote
IBPRIA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In pattern matching based Protein-Protein Interaction Extraction systems, patterns generated manually or automatically exist erroneous and redundancy, which greatly affec...
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
SODA
2000
ACM
15 years 2 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
DAC
2009
ACM
15 years 8 months ago
2009
ACM
This paper proposes an equation-based multi-scenario iterative robust optimization methodology for analog/mixed-signal circuits. We show that due to local circuit performance mono...