Maximal common subsequence algorithms

Sakai, Y

Sakai, Y (reprint author), Tohoku Univ, Grad Sch Agr Sci, Aoba Ku, 468-1 Aza Aoba, Sendai, Miyagi 9800845, Japan.

THEORETICAL COMPUTER SCIENCE, 2019; 793 (): 132

Abstract

A common subsequence of two strings is maximal if inserting any character into it no longer yields a common subsequence. The present article proposes ......

Full Text Link