Kernel and fast algorithm for dense triplet inconsistency
From MaRDI portal
Publication:391097
DOI10.1016/J.TCS.2012.12.032zbMATH Open1294.68091OpenAlexW2177446487MaRDI QIDQ391097FDOQ391097
Authors: Sylvain Guillemot, Matthias Mnich 
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.032
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
- Reconstructing the shape of a tree from observed dissimilarity data
- Aggregating inconsistent information: ranking and clustering
- On problems without polynomial kernels
- The complexity of reconstructing trees from qualitative characters and subtrees
- A fixed-parameter algorithm for minimum quartet inconsistency
- Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
- Title not available (Why is that?)
- Color-coding
- A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Determining the Evolutionary Tree Using Experiments
- Extension operations on sets of leaf-labelled trees
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Fast FAST
- Kernels for feedback arc set in tournaments
- Constructing the maximum consensus tree from rooted Triples
- New fixed-parameter algorithms for the minimum quartet inconsistency problem
- Maximum agreement and compatible supertrees
- Conflict packing yields linear vertex-kernels for \(k\)-FAST, \(k\)-dense RTI and a related problem
- Approximation schemes for the betweenness problem in tournaments and related ranking problems
- Kernel and fast algorithm for dense triplet inconsistency
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- New results on optimizing rooted triplets consistency
- Rooted maximum agreement supertrees
- Analytic solutions for three taxon ML trees with variable rates across sites
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)
