Abstract: Systems and methods for determining structure of two or more binary data strings. The method may comprise the steps of: (1) sorting the data strings by similarity; (2) recursively aligning the data strings; and (3) creating a length-based schema map of similar segments in the data strings. Global and/or local recursive alignment algorithms may be used to align the data strings. The Needleman-Wunsch algorithm could be used for the global alignment and the Smith-Waterman algorithm could be used for the local alignment. A Bayesian classifier could be used to sort the data strings by similarity. Also, the sorted data strings could be scored for similarity prior to the recursive alignment.