Skip to main content
Figure 1 | BMC Bioinformatics

Figure 1

From: A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees

Figure 1

Two binary trees T 1 and T 2 and the auxiliary graph D . A maximum agreement forest M of T1 and T2 is obtained by deleting the dashed edges. Graph D can be made acyclic by deleting either both filled or both unfilled vertices. Hence, removing either v1 and v2 or v3 and v4 from M makes it an acyclic agreement forest for T1 and T2, see Lemma 3. The acyclic agreement forest M∖{v1,v2} obtained by removing v1 and v2 from M is depicted on the right.

Back to article page

BMC Bioinformatics

ISSN: 1471-2105

Contact us