Longest Common Subsequence Identification Task

From GM-RKB
Jump to: navigation, search

A Longest Common Subsequence Identification Task is string search task that can find the longest subsequence common to two or more strings.



References

2014

2010

2009a

2009b

2003

2002

2000

1978

1975

1974