![[ICO]](/icons/blank.gif){kind=icon}
![[PARENTDIR]](/icons/back.gif){kind=icon}
![[ ]](/icons/unknown.gif){kind=icon}
![[ ]](/icons/layout.gif){kind=icon}
| Name | Last modified | Size | Description |
|---|---|---|---|---|
| Parent Directory | - | ||
| 20200324_laikl.pptx | 2020-05-17 01:43 | 377K | |
| 20200324_leesx.pptx.pptx | 2020-05-17 01:43 | 731K | |
| 20200324_leeth.pptx | 2020-05-17 01:43 | 292K | |
| A branch-and-cut approach to the repetition-free longest common subsequence problem.pdf | 2020-05-17 01:43 | 315K | |
| An all-substrings common subsequence algorithm1.pdf | 2020-05-17 01:43 | 187K | |
| Finding maximal 2-dimensional palindromes.pdf | 2020-05-17 01:43 | 566K | |