Sequential Exact String Matching
نویسندگان
چکیده
منابع مشابه
A fast parallel algorithm to determine edit distance
We consider the problem of determining in parallel the cost of converting a source string to a destination string by a sequence of insert, delete and transform operations. Each operation has an integer cost in some fixed range. We present an algorithm that runs in <9(logmlogrt) time and uses mn processors on a CRCW PRAM, where m and n are the lengths of the strings. The best known sequential al...
متن کاملTight Comparison Bounds for the String Prefix-Matching Problem
In the string preex-matching problem one is interested in nding the longest preex of a pattern string of length m that occurs starting at each position of a text string of length n. This is a natural generalization of the string matching problem where only occurrences of the whole pattern are sought. The Knuth-Morris-Pratt string matching algorithm can be easily adapted to solve the string pree...
متن کاملSequential and indexed two-dimensional combinatorial template matching allowing rotations
We present new and faster algorithms to search for a 2-dimensional pattern in a 2-dimensional text allowing any rotation of the pattern. This has applications such as image databases and computational biology. We consider the cases of exact and approximate matching under several matching models, using a combinatorial approach that generalizes string matching techniques. We focus on sequential a...
متن کاملApproximate String Matching with Address Bit Errors
Motivation In the " old " days: Pattern and text are given in correct sequential order. It is possible that the .content is erroneous New paradigm: Content is exact, but the order of .the pattern symbols may be scrambled Why? Transmitted asynchronously? ? The nature of the application Example:Swaps Tehse kni ds of typing mistakes are very common So when searching for patternThese we are seeking...
متن کاملExact String Matching Animation in Java
We present an animation in Java for exact string matching algorithms 3]. This system provides a framework to animate in a very straightforward way any string matching algorithm which uses characters comparisons. Already 27 string matching algorithms have been animated with this system. It is a good tool to understand all these algorithms.
متن کامل