UDAG - unofficial algorithms group

From Bioinformatics Software
Revision as of 16:58, 18 June 2008 by Vlado (talk | contribs)
Jump to navigationJump to search


Meetings

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.
Retrieved from "https://beikolab.cs.dal.ca/software/index.php?title=UDAG_-_unofficial_algorithms_group&oldid=104"