L. Gasieniec, J. Jansson, A. Lingas, and A. Ostlin. On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization, 3(2--3):183--197, 1999. Previously appeared in COCOON'97. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Approximating the Maximum Isomorphic Agreement Subtree is Hard - Bonizzoni, al. (1 citation) (Correct)
....that MIT shares exactly the same inapproximability properties of MAX CLIQUE [20] implying that there cannot exist a polynomial time n ratio approximation algorithm for each 0, unless NP=ZPP. A similar, but slightly weaker, negative result on the approximability of MHT has been obtained in [19], showing that such problem cannot be approximated within factor n for any 0 9 , since approximating MHT within factor n in polynomial time implies a polynomial time approximation algorithm for MAX CLIQUE with n 3 o(1) guaranteed approximation ratio. 2. Preliminaries All trees we ....
L. Gasieniec, J. Jansson, A. Lingas, and A. Ostlin. On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization, 3(2/3):183-197, 1999.
On the Approximation of Computing of - Evolutionary Trees Research (Correct)
No context found.
L. Gasieniec, J. Jansson, A. Lingas, and A. Ostlin. On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization, 3(2--3):183--197, 1999. Previously appeared in COCOON'97.
Multiple Sequence Alignment and Phylogenetic Reconstruction.. - Vedova (Correct)
No context found.
L. Gasieniec, J. Jansson, A. Lingas, and A. Ostlin. On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization, 3(2/3):183--197, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC