"overlay" Strings algorithm

Question

Is there a known algorithm for combining strings in a way, so that what most oft the input strings have in common is put in the resulting string? What I mean is this:

input-1: "This is a Tsst"

input-2: "This is Test"

input-3: "Thi5 ia a Test"


result: "This is a Test"

The length in words and characters of the inputs is varying, which creates the problem for me.

Do you necessarily want to output on of the original input, as in your example ? — Damien Prot
– Damien Prot, Commented Sep 22, 2017 at 6:17
sorry, I mispelled a word. My question is : is the result exactly one of the input ? In your example, the result is input-2. So do you have to choose among the input, or can it be a combination of the different inputs ? — Damien Prot
– Damien Prot, Commented Sep 22, 2017 at 8:07
No, it's a mix between what is most common in all of the inputs. In input 2 the 'a' is missing, but in 1 and 3 it is there, therefore it will make it to the result. — l'arbre
– l'arbre, Commented Sep 22, 2017 at 8:47

Malcolm McLean · Accepted Answer · 2017-09-21 19:59:06Z

1

Yes, but it's rtather involved.

You do a multiple alignment of the string sequences using Clustal or a variant. Then you read off the consensus sequence. Clustal accepts a scoring matrix, which is intended for protein sequences, but could be used for English letters (k is similar to c, 5 to s and so on).

answered Sep 21, 2017 at 19:59

Malcolm McLean

6,4201 gold badge19 silver badges18 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

"overlay" Strings algorithm

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related