Isbn: 9781333041229 - efficient parallel and serial approximate string matching (classic reprint) (3 resultados)

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condición: New. Print on Demand. This book presents two algorithms for the string matching problem with mismatches, where differences between characters are allowed. The first is a parallel algorithm that has three main parts: pattern analysis, text analysis, and finding occurrences of the pattern in the text. The second is a serial algorithm that uses a new approach to text handling. Prior to this book, no algorithm was able to cope with mismatches in the string matching problem. The new serial algorithm is considerably easier to implement, running in O(kn) time for fixed-size alphabets and O(knlogm) for general input, where k is the number of mismatches and n, m are the lengths of input text and pattern respectively. The parallel algorithm takes O(logm) time using m^2 processors for the first two parts, and O(k) time using n processors for the third part. Both algorithms have a space requirement of O(n). The book's insights offer a significant leap from previous algorithms that were not able to handle mismatches, opening new possibilities for practical applications like analyzing unreliable data in real-time scenarios. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…