Sumários
Longest Increasing Subsequence
27 novembro 2014, 11:00 • Luís Manuel Silveira Russo
An O(n log n) algorithm for the LIS problem. Adapting shift-and for the edit distance.
Speeding up edit distance
25 novembro 2014, 11:00 • Luís Manuel Silveira Russo
Four Russian approach. The SMAWK algorithm.
Implementing Ukkonen's algorithm
21 novembro 2014, 15:30 • Luís Manuel Silveira Russo
Implementing a suffix tree to compute matching statistics.
Refining core edits.
20 novembro 2014, 11:00 • Luís Manuel Silveira Russo
Faster algorithms for bounded differences. Suffix tree aplications. Monge matrices.
Alignments
18 novembro 2014, 11:00 • Luís Manuel Silveira Russo
Edit graphs. String similarity. Local alignment. Computing alignments in linear space.