I have many short strings of varying lengths — between a dozen and a few hundred, most likely — and one long string. I need to write code that will find a way to assemble a copy of the long string using as few of the short strings as possible. If it's not possible to assemble a complete copy of the long string, it should assemble a copy with as few and as small gaps as possible. [more inside]
posted on Oct 8, 2006 - 26 answers

Okay, so I'm hoping to apply this winter for Ph.D. programs in computational linguistics. (Thanks for the encouraging advice, guys!) The question is, where? [more inside]
posted on Jul 18, 2006 - 10 answers