Combining polynomial running time and fast convergence for the disk-covering method
نویسندگان
چکیده
منابع مشابه
Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction
The evolutionary history of a set of species is represented by a phylogenetic tree, which is a rooted, leaf-labeled tree, where internal nodes represent ancestral species and the leaves represent modern day species. Accurate (or even boundedly inaccurate) topology reconstructions of large and divergent trees from realistic length sequences have long been considered one of the major challenges i...
متن کاملThe Disk - Covering Method for Tree Reconstruction 631
Evolutionary tree reconstruction is a very important step in many biological research problems , and yet is extremely diicult for a variety of computational, statistical, and scientiic reasons. In particular, the reconstruction of very large trees containing signiicant amounts of divergence is especially challenging. We present in this paper a new tree reconstruction method, which we call the D...
متن کاملPolynomial-time algorithms for regular set-covering and threshold synthesis
A set-covering problem is called regular if a cover always remains a cover when any column in it is replaced by an earlier column. From the input of the problem the coefficient matrix of the set-covering inequalities it is possible to check in polynomial time whether the problem is regular or can be made regular by permuting the columns. If it is, then all the minimal covers are generated in po...
متن کاملPolynomial Running Times for Polynomial-Time Oracle Machines
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of oracle Turing machines and avoiding secondorder polynomials, which are notoriously difficult to handle. Furthermore, all machines that witness this st...
متن کاملAn Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
In the bin covering problem there is a group L=(a1; : : : ; an) of items with sizes s̃(ai)∈ (0; 1), and the goal is to 6nd a packing of the items into bins to maximize the number of bins that receive items of total size at least 1. This is a dual problem to the classical bin packing problem. In this paper we present the 6rst asymptotic fully polynomial-time approximation scheme for the problem. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2002
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(02)00005-3