- 5
- 1
- 1
Vincent Berry
7
Documents
Publications
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 7
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 3
- 1
On the Approximability Results for Maximum Agreement Subtree and Maximum Compatible Tree ProblemsDiscrete Applied Mathematics, 2009, 157 (7), pp.1555-1570. ⟨10.1016/j.dam.2008.06.007⟩
Article dans une revue
lirmm-00371209v1
|
|
|
Fixed-Parameter Tractability of the Maximum Agreement Supertree ProblemIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2009, 7 (2), pp.342-353. ⟨10.1109/TCBB.2008.93⟩
Article dans une revue
lirmm-00324055v1
|
|
Linear time 3-approximation for MAST problemACM Transactions on Algorithms, 2009, 5 (2), pp.1-18. ⟨10.1145/1497290.1497299⟩
Article dans une revue
lirmm-00324073v1
|
|
PhySIC: A Veto Supertree Method with Desirable PropertiesSystematic Biology, 2007, 56 (5), pp.798-817. ⟨10.1080/10635150701639754⟩
Article dans une revue
lirmm-00194235v1
|
|
Fixed-parameter Tractability of the Maximum Agreement Supertree ProblemCPM: Combinatorial Pattern Matching, 2007, Montpellier, France. pp.274-285
Communication dans un congrès
lirmm-00130406v2
|
|
On the Approximation of Computing Evolutionary TreesCOCOON: Computing and Combinatorics Conference, Aug 2005, Kunming, China. pp.115-125, ⟨10.1007/11533719_14⟩
Communication dans un congrès
lirmm-00106451v1
|
|
Finding a Largest Subset of Rooted Triples Identifying a Tree is an NP-hard taskRR-07010, 2007, pp.7
Rapport
lirmm-00143208v1
|