Fingerprint
Dive into the research topics of 'Computing longest common substring/subsequence of non-linear texts'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Computing longest common substring/subsequence of non-linear texts
Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution