Abstract: Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approximate string ...
String matching is a fundamental problem in computer science that consists of finding the occurrence of a pattern within a larger text. This problem appears in many real-world applications such as ...
Abstract: Approximate string matching (ASM) functions as the basic operation kernel for a large number of string processing applications. Existing Von-Neumann-based ASM accelerators suffer from huge ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results