UDAG - unofficial algorithms group
From Bioinformatics Software
Meetings (Wednesdays 12:30pm room 311, for Summer 2008)
18 June 2008, Wednesday, 12:30pm
- SPR and TBR: idea about using them to model movement in natural language parsing
- Could minimal permutation factorization into transpositions be proved to be NP-hard by reduction to SPRs and TBRs?
- Direct reduction using leaves and ordered trees does not work.