Search Sciweavers | Sciweavers

4 search results - page 1 / 1

» Maximum agreement and compatible supertrees

click to vote

CORR
2008
Springer

92views Education» more CORR 2008»

Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

13 years 11 months ago

Download drops.dagstuhl.de

Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...

Viet Tung Hoang, Wing-Kin Sung

claim paper

Read More »

click to vote

JDA
2007

63views more JDA 2007»

Maximum agreement and compatible supertrees

13 years 10 months ago

Download www.cs.ucr.edu

Vincent Berry, François Nicolas

claim paper

Read More »

click to vote

CPM
2007
Springer

74views Combinatorics» more CPM 2007»

Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem

14 years 5 months ago

Download www.csd.uwo.ca

Sylvain Guillemot, Vincent Berry

claim paper

Read More »

click to vote

LATIN
2004
Springer

93views Information Technology» more LATIN 2004»

Rooted Maximum Agreement Supertrees

14 years 4 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers