title: Searching with Precedence on Array Order
body: <p>My gut feeling is that the answer is no, but is it possible to perform a search in Mongodb comparing the similarity of arrays where order is important?</p>
  
  <p>E.g.
  I have three documents like so</p>
  
  <pre><code>{'_id':1, "my_list": ["A",2,6,8,34,90]},
  {'_id':2, "my_list": ["A","F",2,6,19,8,90,55]},
  {'_id':3, "my_list": [90,34,8,6,3,"A"]}
  </code></pre>
  
  <p>1 and 2 are the most similar, 3 is wildly different irrespective of the fact it contains all of the same values as 1.</p>
  
  <p>Ideally I would do a search similar to <code>{"my_list" : ["A",2,6,8,34,90] }</code> and the results would be document 1 and 2.</p>
  
  <p>It's almost like a regex search with wild cards.  I know I can do this in python easily enough, but speed is important and I'm dealing with 1.3 million documents.</p>