0

Hi
I'd like to align two decimal sequences to calculate the distance between them and be able to perform an sum of them
for example let S1 and S2 be these two sequences :
S1=[0.568,0.469,0.3658,0.31667]
S2=[0.64918,1.16]
This is only a random example to show you my point
I'm currently trying to use the Needleman–Wunsch algorithm to perform that but it's really hard to translate that one to numerical and now i'm trying with Levenshtein distance
But is there an algorithm designed for this kind of problem which is numerical data only ?

  • 1
    it's not at all clear how an alignment of your two sequences should look like. In general the algorithm itself can be applied to any kind of sequences - you just have to define a sensible distance metric. – cel May 16 '17 at 15:35
  • As cel says, NW should work find for numerical data if you have a suitable distance metric between all numbers (and a way to handle periods and commas, perhaps as gaps or as characters themselves) – nbryans May 16 '17 at 15:49
  • 1
    Please don't post the same question more than once. – m69's been on strike for years May 16 '17 at 16:01
  • @m69 I didn't post it twice it's not the same question anymore – Chakib Mataoui May 16 '17 at 16:10

0 Answers0