What would be a good / efficient algorithm or approach to find all the largest sequences within a list of chains with varying lengths?
For instance these chains:
0: [4,5,2,1,3,6,8,9] 1: [2,1,3,4,5,6,7,8,10,11] 2: [15,12]
The longest common subsequence would be [2,1,3,6,8] but there is another important subsequence [4,5,6,8] that we would be needed to find.
All other sequences with 2 or more elements would be inside those two chains. For instance [1,3,6] or [5,6,8] or [2,1] are all inside the two resulting chains.
Note: the example uses integers for more clarity but the real data will use floats, and they will be taken as a "match" when both are separate within a given threshold.