September 23rd, 2012 02:33 AM
nuzzle, thanks, i'll try that.
September 21st, 2012 03:37 AM
Well I described the equivalence relation already.
two sequences are equal if they differ by a circular shift, or if they differ by a permutation of lettes (not permutation of position of...
September 21st, 2012 01:40 AM
I want to find the shortest path between two vertices of a unweighted graph.
Is there a better approach than taking Dijkstra with all weights equal to 1?
September 21st, 2012 01:39 AM
No, it's what Peter_B said. I want to find a cannonical form of a given sequence, which is not just sorting it.
e.g. 1212 != 1122
Anyways, I would be satisfied in any canonical form that would...
September 20th, 2012 05:40 AM
We have a circular sequance, where the letters 1,...n repeat twice (and letters can be permuted). I am trying to find a efficient algorithm to return the minimal representation of a sequence.