The following pages link to Stefano Beretta (Q306269):
Displaying 8 items.
- Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
- Corrigendum to: ``Parameterized tractability of the maximum-duo preservation string mapping problem''. (Q329729) (← links)
- Correcting gene tree by removal and modification: tractability and approximability (Q491623) (← links)
- Correcting gene trees by leaf insertions: complexity and approximation (Q737083) (← links)
- A hybrid genetic algorithm for the repetition free longest common subsequence problem (Q2450749) (← links)
- (Q3521018) (← links)
- Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability (Q5175876) (← links)
- Covering Pairs in Directed Acyclic Graphs (Q5404906) (← links)