On the Weighted Quartet Consensus problem
Authors:
- Manuel LafondManuel Lafond
- Celine ScornavaccaCSCeline Scornavacca
- 1 May 2019
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 769, 1-17
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Natural Sciences and Engineering Research Council of Canada
- Mitacs Globalink Campus France program
This publication has 15 references indexed in Scilit:
- Comparing and aggregating partially resolved treesTheoretical Computer Science, 2011
- New results on optimizing rooted triplets consistencyDiscrete Applied Mathematics, 2010
- On the Complexity of Inferring Rooted Evolutionary TreesElectronic Notes in Discrete Mathematics, 2001
- Constructing Optimal Trees from QuartetsJournal of Algorithms, 2001
- A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its ApplicationSIAM Journal on Computing, 2001
- Polynomial Time Approximation Schemes for Dense Instances of NP-Hard ProblemsJournal of Computer and System Sciences, 1999
- The median procedure for n-treesJournal of Classification, 1986
- Taxonomic Congruence in the Leptopodomorpha Re-ExaminedSystematic Zoology, 1981
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational ExpressionsSIAM Journal on Computing, 1981
- Cyclic ordering is NP-completeTheoretical Computer Science, 1977