On the Complexity of Constructing Evolutionary Trees

Leszek Gasieniec (), Jesper Jansson (), Andrzej Lingas () and Anna Östlin ()
Additional contact information
Leszek Gasieniec: University of Liverpool
Jesper Jansson: Lund Institute of Technology
Andrzej Lingas: Lund University
Anna Östlin: Lund University

Journal of Combinatorial Optimization, 1999, vol. 3, issue 2, No 3, 183-197

Abstract: Abstract In this paper we study a few important tree optimization problems with applications to computational biology. These problems ask for trees that are consistent with an as large part of the given data as possible. We show that the maximum homeomorphic agreement subtree problem cannot be approximated within a factor of $$N^\varepsilon$$ , where N is the input size, for any 0 ≤ $$\varepsilon

Keywords: algorithm; time complexity; evolutionary tree; homeomorphism; consensus tree (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009833626004 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:3:y:1999:i:2:d:10.1023_a:1009833626004

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009833626004

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().