title: how to detect the similar unordered sequences?
body: <p>I want to find the similar intersections in a road network. My trick is to find the most similar sequence of names of streets. I have created several lists of names. one of them is the reference and the two others are corresponding ones. I want to find the one which has the same street names and same number of occurrence. </p>
  
  <p>it is necessary to know that the order of name should not matter but only the number of occurrence of the similar names matters.</p>
  
  <p>example:</p>
  
  <p>reference name sequence:<br>
  <code>[u'Barytongatan', u'Tunnlandsgatan', u'Barytongatan']</code></p>
  
  <p>corresponding name sequence of neighbors are :<br>
      <code>{91: [u'Barytongatan', u'Tunnlandsgatan', u'Barytongatan'], 142: [u'Tunnlandsgatan', u'Tunnlandsgatan', u' ']}
  </code>
  first, I need to know if for this problem there is already a solution. second, choosing the list as a container of sequences is a good idea? and finally, if so, how to solve it?</p>
  
  <p>I was think of regular expression but seems no useful as the order is not fix.</p>