| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428250 | Information Processing Letters | 2006 | 5 Pages |
Abstract
We present a polynomial time algorithm for the Minimum Quartet Inconsistency (MQI) problem when the number of quartet errors is O(n). This improves the previously best algorithmic result saying that if the number of quartet errors is at most (n−3)/2 then the MQI problem can be solved in polynomial time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
