Computer Science – Computational Complexity
Scientific paper
2008-02-20
Computer Science
Computational Complexity
Published in Discrete Applied Mathematics
Scientific paper
10.1016/j.dam.2008.06.007
This paper has been withdrawn by the corresponding author because the newest
version is now published in Discrete Applied Mathematics.
Berry Vincent
Guillemot Sylvain
Nicolas Francois
Paul Christophe
No associations
LandOfFree
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-647002