Timeline for Given two sequences of the same size, how many longest common subsequences can they have?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 3, 2014 at 10:52 | comment | added | jsguy | Sorry for not replying earlier, I forgot about this question. They are not consecutive, but subsequences, I think my method was wrong. | |
| Nov 3, 2014 at 10:38 | vote | accept | jsguy | ||
| Oct 30, 2014 at 17:43 | comment | added | Yuval Filmus | Perhaps $C(N,i) = \binom{N}{i}$? Also, are the subsequences consecutive (i.e. $a_i,a_{i+1},\ldots,a_j$) or not (any subset of elements in the same order)? Your mention of $C(N,i)$ prompts me to think you mean the latter. | |
| Oct 30, 2014 at 17:05 | answer | added | Danny | timeline score: 1 | |
| Oct 30, 2014 at 16:06 | comment | added | john_leo | Do you mean different substrings? | |
| Oct 30, 2014 at 14:35 | comment | added | Yuval Filmus | Please include the question in the body of the question. Also. I have no idea what $C(N,i)$ means. | |
| Oct 30, 2014 at 13:49 | history | asked | jsguy | CC BY-SA 3.0 |