Itsik Pe'er, Ron Shamir: The median problems for breakpoints are NP- complete, Electronic Colloquium on Computational Complexity TR98-071 (1998). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Combinatorial Methods in Comparative Genomics - Eriksen (2003) (Correct)
....genomes as leaves. Computing the median of three genomes is hard. Considering the complications of the hurdles in computing the reversal distance, it comes as no surprise that computing the reversal median is NP hard [17] but it turns out that computing the breakpoint median is also NP hard [49]. Still, most methods for tree reconstruction use the median. We shall now review several di#erent ways to do this. 1.4.4 BPAnalysis and Grappa Given a fixed topology (tree structure) with given genomes at all vertices, including inner vertices, any inner vertex can be recalculated as the median ....
Itsik Pe'er, Ron Shamir: The median problems for breakpoints are NP- complete, Electronic Colloquium on Computational Complexity TR98-071 (1998).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC