Pages that link to "Item:Q5204323"
From MaRDI portal
The following pages link to Two strikes against perfect phylogeny (Q5204323):
Displaying 30 items.
- Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
- A simple characterization of the minimal obstruction sets for three-state perfect phylogenies (Q450220) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q1281766) (← 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)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths (Q2146743) (← links)
- The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
- Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074) (← links)
- Chordal bipartite completion of colored graphs (Q2427516) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Identifying phylogenetic trees (Q2570101) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Intervalizing k-colored graphs (Q4645169) (← links)
- Computing the unrooted maximum agreement subtree in sub-quadratic time (Q5054809) (← links)
- (Q5743514) (← links)
- On intervalizing \(k\)-colored graphs for DNA physical mapping (Q5961618) (← links)
- Minimizing phylogenetic number to find good evolutionary trees (Q5961621) (← links)
- Algorithms and complexity of sandwich problems in graphs (extended abstract) (Q6184393) (← links)