By Topic

A polynomial algorithm for the minimum quartet inconsistency problem with O(n) quartet errors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
G. Wu ; Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada ; J. -H. You ; G. Lin

We show that for the Minimum Quartet Inconsistency problem, if the number of quartet errors is O(n), where n is the number of taxa under consideration, then it can be solved in polynomial time. This improves the previously-best algorithmic result saying that if the number of quartet errors is at most (n-3)/2 then the problem can be solved in polynomial time.

Published in:

2005 IEEE Computational Systems Bioinformatics Conference - Workshops (CSBW'05)

Date of Conference:

8-11 Aug. 2005