Are there any works that present algorithms for tree reconstruction based on
Steiner tree algorithms?
All I know is that the Steiner problem was used to show the NP-completeness of
tree reconstruction by parsimony (cf. Foulds and Graham, Adv. Appl. Math. 1982,
and Day, Johnson, Sankoff, Math. Biosc. , 1986).
If you post an answer, please cc: a reply directly to me. Thanks in advance,
- Joao Setubal
setubal at dcc.unicamp.br