Abstract: A method, apparatus, system, and computer program code for determining string alignment with insensitivity to translocation. A computer system arranges a pair of strings in a similarity matrix. The computer system determines a match score for an optimal local alignment of whole-word sequences between the pair of strings. The computer system masks the whole-word sequences of the optimal local alignment to generate word-masked strings. Using the word-masked strings, the computer system repeats the arranging, determining, and masking steps a number of times to generate a number of match scores. The computer system combines the number of match scores into a combined score that represents similarities between the pair of strings, wherein the combined score is insensitive to translocation and word truncations. Based on the combined score, the computer system determines alignment between the pair of strings.

Abstract: Systems and method to store closing documents. Some embodiments include receiving data of one or more parties to a transaction acquire a transaction document set including one or more documents and identifying each document in the document set to associate a document description and one or more parties to receive a copy of each identified document. Some such embodiments further include receiving service provider data of each of one or more service providers providing service to each of the one or more parties and generating a computer readable medium for each party to the transaction. The computer readable medium can include a portion of the document set, a document description link index linking each document description to the description's respective document written to the computer readable medium, and service provider data of at least one service provider.