search - Finding a number sequence in an larger entangled network of sequences -


this wheel has been invented before, i'm looking useful ideas or references relate similar kinds of problems or parts of it.

first, imagine linear sequence of digits. 2 consequtive digits can never same, because sequence defined change. then, imaging sequence branching. , branches allowed cross each other, still never allowing 2 bordering digits same. consider constant "map".

now, sequence of digits observed. want fit given sequence (branched) sequence in "map".

each digit in map has unique address value. want convert observed sequence of digits sequence of addresses on map (be there none, 1 or several).

here's illustration might explaination (although intuitive spatial restriction don't need apply, may multi-dimensional):

 1  4    8  2  6  86295  6541293 6  8  5    4  2  67194138  7287    6     5 

suppose digit sequence "12682" observed. fits top-left corner straight down , result in addresses of 5 digits. "126541" fit top-left turn right @ "6", different addresses last 3 digits.

preferably java implementation if matters.


Comments

Popular posts from this blog

Android layout hidden on keyboard show -

google app engine - 403 Forbidden POST - Flask WTForms -

c - Why would PK11_GenerateRandom() return an error -8023? -