The Megerd Longest Common Subsequence Problem and Block Variant

Department of Computer Science and Engineering, National Sun Yat-sen University
Kuo-Tsung Tseng(曾國尊), De-Sheng Chan(詹德勝), Chang-Biau Yang(楊昌彪), Shou-Fu Lo(羅守莆)

• Introduction
• Implementation
  • Our Algorithm_MLCS(Diagonal Extension and Domination, 2017)
  • Our Algorithm_BMLCS(Diagonal Extension and Domination, 2017)
  • Rahman and Rahman Algorithm_MLCS(Bounded heap, 2014)
  • Rahman and Rahman Algorithm_BMLCS(Bounded heap, 2014)
  • Deorowicz and Danek Algorithm_MLCS(Bit-Parallel, 2013)
  • Deorowicz and Danek Algorithm_BMLCS(Bit-Parallel, 2014)
  • Peng et al. Algorithm_MLCS(Sparse Dynamic Programming, 2010)
  • Peng et al. Algorithm_BMLCS(Sparse Dynamic Programming, 2010)
  • Huang et al. Algorithm_MLCS(Dynamic programming, 2008)
  • Huang et al. Algorithm_BMLCS(Dynamic programming, 2008)
  • Huang et al. Algorithm_BMLCS(S-table, 2008)
• Data Generation
• Experimental Results
• Data download