Mailing List Archive: 49091 messages
  • Home
  • Script library
  • AltME Archive
  • Mailing list
  • Articles Index
  • Site search

[REBOL] Re: OT: Competition - Is this solvable

From: Tom::Conlin::gmail::com at: 24-Nov-2007 11:28

Hi Robert Perhaps not surprisingly I see this as an analog of of a common problem in bioinformatics, where you want to know if stretches of DNA are related. this is a dynamic programming problem with penalties for edits the solution with the smallest edit distance is your goal. The penalties for particular edits can be empirically determined if you have a large set that has been solved or you could come up with a with a scoring matrix wit the penalty for one symbol to become another (or a gap/insertion). basic local alignment search tool BLAST , "smith waterman algorithm" are some search terms that come to mind Robert M. M=FCnch wrote: