Method and arrangement for searching for strings

Abstract

This invention relates to methods of searching for a final number of result strings (-) having a partial or an exact match with a query string () in a database () comprised of many long strings or a long string, said method includes the steps of partitioning the query string in a first number of input query strings (); determining a second number of neighboring strings (---, respectively) for each string in said first number of input query strings, wherein each string in said second number of neighboring strings has a predetermined first number of errors; searching the database for a third number of exact matches (--) for each string in said second number of neighboring strings based on a search method; concatenating said searched exact matched strings from the database into a fourth number of intermediate strings () wherein said searched exact matched strings (--) comprised in each of said intermediate strings are in succession to one another in said database; and determining the final number of result strings (-) based in said fourth number of intermediate strings, wherein each string in the final number of result strings has a maximum of predetermined second number of errors compared to said query string (). This enables for a perfect match or a partial match containing only minor errors with respect to said query string, and for a fast search in larger databases with a relative low use of processing power.