scientific article; zbMATH DE number 1088267

MaRDI QIDQ4364583zbMATH OpenFDO

Authors Jesper Jansson, Anna Östlin, Leszek Gąsieniec, Andrzej Lingas

Publication date 15 December 1997

zbMATH Keywords

tree optimizationmaximum homeomorphic agreement subtree problemmaximum inferred consensus tree problem

Mathematics Subject Classification ID

Problems related to evolution (92D15) Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to biology (92-08)

Recommendations

• On the complexity of constructing evolutionary trees
• On the complexity of comparing evolutionary trees
• scientific article; zbMATH DE number 1303534

Cited in

(27)

• scientific article; zbMATH DE number 1754590 (Why is no real title available?)
• Theoretical Computer Science
• Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
• Selecting the branches for an evolutionary tree.
• scientific article; zbMATH DE number 1615275 (Why is no real title available?)
• Computational complexity of inferring phylogenies from dissimilarity matrices
• The complexity of reconstructing trees from qualitative characters and subtrees
• A constructive algorithm for realizing a distance matrix
• scientific article; zbMATH DE number 2079368 (Why is no real title available?)
• Encoding and constructing 1-nested phylogenetic networks with trinets
• Constructing the maximum consensus tree from rooted Triples
• Computing phylogenetic roots with bounded degrees and errors is NP-complete
• scientific article; zbMATH DE number 53861 (Why is no real title available?)
• Is the protein model assignment problem under linked branch lengths NP-hard?
• A robust model for finding optimal evolutionary tree
• Heuristic algorithms in computational molecular biology
• Approximation algorithms for constrained generalized tree alignment problem
• Fourier calculus on evolutionary trees
• Computing a consensus of multilabeled trees
• On contract-and-refine transformations between phylogenetic trees
• Evolutionary trees can be learned in polynomial time in the two-state general Markov model
• Finding a maximum compatible tree is NP-hard for sequences and trees
• Finding a maximum likelihood tree is hard
• Efficiently Calculating Evolutionary Tree Measures Using SAT
• Aligning sequences via an evolutionary tree: complexity and approximation
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
• Testing the theory of evolution: A novel application of combinatorial optimization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364583)