Help on a problem related to LCS.

Правка en2, от Tru3R00T, 2020-12-26 16:06:29

Does LCS guarantee that the distance between the first character and last character used to form the sub-sequence is minimum in the first string?

Example :
String 1 : AABCZZZDEF
String 2 : ABCDEF
So the LCS is ABCDEF, now will LCS, guarantee that I get a string from index 2 -> 10 (1- indexed)?

Or it can give me string from index 1 -> 10? (If i retrieve sub-sequence back using standard parent saving and then the string using first and last character.)

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Tru3R00T 2020-12-26 16:06:29 95
en1 Английский Tru3R00T 2020-12-26 16:04:03 449 Initial revision (published)