Kernel and fast algorithm for dense triplet inconsistency
From MaRDI portal
(Redirected from Publication:391097)
Recommendations
- Kernel and fast algorithm for dense triplet inconsistency
- Similarity, kernels, and the triangle inequality
- Kernel Methods in Computer Vision
- Kernel affine projection algorithms
- scientific article; zbMATH DE number 2045467
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
Cites work
- scientific article; zbMATH DE number 5485441 (Why is no real title available?)
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A fixed-parameter algorithm for minimum quartet inconsistency
- A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
- Aggregating inconsistent information: ranking and clustering
- Analytic solutions for three taxon ML trees with variable rates across sites
- Approximation schemes for the betweenness problem in tournaments and related ranking problems
- Color-coding
- Conflict packing yields linear vertex-kernels for \(k\)-FAST, \(k\)-dense RTI and a related problem
- Constructing the maximum consensus tree from rooted Triples
- Determining the Evolutionary Tree Using Experiments
- Extension operations on sets of leaf-labelled trees
- Fast FAST
- Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Kernel and fast algorithm for dense triplet inconsistency
- Kernels for feedback arc set in tournaments
- Maximum agreement and compatible supertrees
- New fixed-parameter algorithms for the minimum quartet inconsistency problem
- New results on optimizing rooted triplets consistency
- On problems without polynomial kernels
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- Reconstructing the shape of a tree from observed dissimilarity data
- Rooted maximum agreement supertrees
- The complexity of reconstructing trees from qualitative characters and subtrees
Cited in
(6)- Kernel and fast algorithm for dense triplet inconsistency
- Determining the consistency of resolved triplets and fan triplets
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
- Constructing a consensus phylogeny from a leaf-removal distance (extended abstract)
- Complexity of modification problems for best match graphs
This page was built for publication: Kernel and fast algorithm for dense triplet inconsistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391097)
