Prefix burrows-wheeler transformations for creating and searching a merged lexeme set

Abstract

Systems and methods to create a merged lexeme set from a first lexeme set and a second lexeme set such that an existential lexeme search may be performed on both data originally from the first lexeme set and data originally from the second lexeme set via the merged lexeme set, and wherein information in the merged lexeme set includes information as to which lexeme set a lexeme originated. Specifically Prefix Burrows-Wheeler Transform (“PBWT”) systems and techniques are applied to the scenario where a plurality lexeme sets are merged to a single merged lexeme set. Additionally, applications of PBWT systems and techniques as applied to genome sequence data and k-Mer searches are disclosed.

What is claimed is: 
     
         1 . A method as substantially shown and described herein, and equivalents. 
     
     
         2 . A system as substantially shown and described herein, and equivalents. 
     
     
         3 . One or more computer-readable media as substantially shown and described herein, and equivalents.