Dear people,
Problem 1.
A)
I have a set of strings in the English alphabet. I need to find an
arrangement where the strings are arranged one under another - and have
the
maximum common letters positioned together (looking vertically).
e.g. ABCDE, BCAD, DABC, ACDBF.
the output would be
| A B C D E
| B C A D
| D A B C
| A C D B F (in this case, any
position with some common letter is valid, since only one leter is
common).
B) In the above problem, if the strings are allowed to be permuted in
order, that is, the strings can appear in any order (e.g. BCAD after
ACDBF), then what is the optimal alignment.
Please help me with this problem.
sincerely,
mayur
- [algogeeks] String alignment Mayur
- [algogeeks] Re: String alignment Pradeep Muthukrishnan
- [algogeeks] Re: String alignment rajat
- [algogeeks] Re: String alignment Pradeep Muthukrishnan