Pages that link to "Item:Q1203103"
From MaRDI portal
The following pages link to The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103):
Displaying 50 items.
- Minimum tree cost quartet puzzling (Q263274) (← links)
- Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors (Q324834) (← links)
- Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
- Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
- Phylogeny- and parsimony-based haplotype inference with constraints (Q418170) (← links)
- Influence of tree topology restrictions on the complexity of haplotyping with missing data (Q428852) (← links)
- A simple characterization of the minimal obstruction sets for three-state perfect phylogenies (Q450220) (← links)
- `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers (Q455729) (← links)
- Reconstructing a phylogenetic level-1 network from quartets (Q486621) (← links)
- Building species trees from larger parts of phylogenomic databases (Q553332) (← links)
- A fast quartet tree heuristic for hierarchical clustering (Q622012) (← links)
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← links)
- Graph triangulations and the compatibility of unrooted phylogenetic trees (Q628277) (← links)
- A property tester for tree-likeness of quartet topologies (Q649111) (← links)
- Slim sets of binary trees (Q654890) (← links)
- Identifying the rooted species tree from the distribution of unrooted gene trees under the coalescent (Q658995) (← links)
- Groves of phylogenetic trees (Q659789) (← links)
- Tree reconstruction from multi-state characters (Q696854) (← links)
- Peeling phylogenetic `oranges' (Q705231) (← links)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
- A colored graph approach to perfect phylogeny with persistent characters (Q728267) (← links)
- A note on convex characters, Fibonacci numbers and exponential-time algorithms (Q730310) (← links)
- Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors (Q845860) (← links)
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets (Q860812) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- Combining tree partitioning, precedence, and incomparability constraints (Q1020493) (← links)
- Consistency of the QNet algorithm for generating planar split networks from weighted quartets (Q1026188) (← links)
- Determining the consistency of partial tree descriptions (Q1028903) (← links)
- Characterizing phylogenetically decisive taxon coverage (Q1049263) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q1281766) (← links)
- Patching up \(X\)-trees (Q1306736) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- Trees, taxonomy, and strongly compatible multi-state characters (Q1364321) (← links)
- Recovering trees from well-separated multi-state characters. (Q1427476) (← links)
- Choosing the tree which actually best explains the data: another look at the bootstrap in phylogenetic reconstruction. (Q1566634) (← links)
- Inferring evolutionary trees with strong combinatorial evidence (Q1575435) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- A supertree method for rooted trees (Q1582076) (← links)
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
- On the weighted quartet consensus problem (Q1737590) (← links)
- The matroid structure of representative triple sets and triple-closure computation (Q1746594) (← links)
- On compatibility and incompatibility of collections of unrooted phylogenetic trees (Q1752481) (← links)
- Quarnet inference rules for level-1 networks (Q1786927) (← links)
- Reconstructing minimal rooted trees. (Q1811070) (← links)
- Exponentially many supertrees (Q1861810) (← links)
- A fixed-parameter algorithm for minimum quartet inconsistency (Q1877704) (← links)
