most citedSolving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees

2 citations · 2 across the 1 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2008★ 2 cited

Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees

Sylvain Guillemot, Francois Nicolas

Given a set of leaf-labeled trees with identical leaf sets, the well-known "Maximum Agreement SubTree" problem (MAST) consists of finding a subtree homeomorphically included in all…