⚠️ Warning: This is a draft ⚠️

This means it might contain formatting issues, incorrect code, conceptual problems, or other severe issues.

If you want to help to improve and eventually enable this page, please fork RosettaGit's repository and open a merge request on GitHub.

==Algo?== Is there an algorithm you can point me at? --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 15:07, 3 May 2013 (UTC) :I don't know any reference, but anyway it's not really different from the Levenshtein distance algorithm. The only difference is that you don't only memoize the distance, you also memoize the alignments.--[[User:Grondilu|Grondilu]] ([[User talk:Grondilu|talk]]) 00:38, 4 May 2013 (UTC) ::It's a trivial derivation from the [[Longest common subsequence|LCS]]. –[[User:Dkf|Donal Fellows]] ([[User talk:Dkf|talk]]) 00:22, 16 January 2014 (UTC)