Pages that link to "Item:Q1167073"
From MaRDI portal
The following pages link to The Steiner problem in phylogeny is NP-complete (Q1167073):
Displaying 49 items.
- On the maximum parsimony distance between phylogenetic trees (Q259724) (← links)
- Characterizing local optima for maximum parsimony (Q309903) (← links)
- Mathematical aspects of phylogenetic groves (Q360362) (← links)
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
- On the low-dimensional Steiner minimum tree problem in Hamming metric (Q393125) (← links)
- Probability Steiner trees and maximum parsimony in phylogenetic analysis (Q393567) (← links)
- Non-hereditary maximum parsimony trees (Q455749) (← links)
- Computing the blocks of a quasi-median graph (Q477343) (← links)
- Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion (Q542000) (← links)
- Reconstructing evolution of sequences subject to recombination using parsimony (Q584109) (← links)
- Groves of phylogenetic trees (Q659789) (← links)
- On better heuristics for Steiner minimum trees (Q687085) (← links)
- The full Steiner tree problem (Q702772) (← links)
- A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- Approximating the selected-internal Steiner tree (Q995588) (← links)
- Quasi-median hulls in Hamming space are Steiner hulls (Q1003664) (← links)
- A new recombination lower bound and the minimum perfect phylogenetic forest problem (Q1029702) (← links)
- Testing the theory of evolution: A novel application of combinatorial optimization (Q1084042) (← links)
- The computational complexity of inferring rooted phylogenies by parsimony (Q1086183) (← links)
- Computational complexity of inferring phylogenies from dissimilarity matrices (Q1091978) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
- Distributions on bicoloured binary trees arising from the principle of parsimony (Q1208487) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q1281766) (← links)
- Geometry of the space of phylogenetic trees (Q1604344) (← links)
- PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion (Q1715640) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem (Q1802347) (← links)
- Landscapes on spaces of trees (Q1855800) (← links)
- On component-size bounded Steiner trees (Q1894356) (← links)
- Walks in phylogenetic treespace (Q1944961) (← links)
- Search-based structured prediction (Q1959488) (← links)
- Tropical geometric variation of tree shapes (Q2172654) (← links)
- Combinatorial views on persistent characters in phylogenetics (Q2182613) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- Most parsimonious likelihood exhibits multiple optima for compatible characters (Q2299315) (← links)
- On the quirks of maximum parsimony and likelihood on phylogenetic networks (Q2399624) (← links)
- Cases in which ancestral maximum likelihood will be confusingly misleading (Q2402545) (← links)
- Inferring phylogenetic trees using answer set programming (Q2467563) (← links)
- Scatter search with path relinking for phylogenetic inference (Q2570151) (← links)
- An algorithm for the maximum likelihood problem on evolutionary trees (Q2576441) (← links)
- Is the protein model assignment problem under linked branch lengths NP-hard? (Q2637350) (← links)
- Regular Language Constrained Sequence Alignment Revisited (Q3000526) (← links)
- On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric (Q3010411) (← links)
- Matchings and phylogenetic trees (Q4230635) (← links)
- A survey on pairwise compatibility graphs (Q5012383) (← links)
- Topology reconstruction using time series data in telecommunication networks (Q6196883) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q6487426) (← links)
