The digital edition of all books may be viewed on our website before purchase. Excerpt from Efficient Parallel and Serial Approximate String Matching
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books.
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. This text has been digitally restored from a historical edition. Some errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vos droits au titre de la garantie légale : Chaque consommateur de l'UE bénéficie d'au moins deux ans de protection au titre de la garantie légale pour tout bien de consommation vendu dans l'UE. Voir plus
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. No Jacket. Print on Demand. Efficient parallel and serial approximate string matching explores how to find pattern occurrences in text when up to k differences are allowed. It presents new algorithms that work in parallel and in series to handle the k-differences problem efficiently.The book explains the problem setup, introduces a three-part approach, and shows how a powerful characterization of the text can lead to fast solutions. It discusses computational models like RAM and PRAM, and compares new methods to classical exact matching algorithms, highlighting where parallelism helps and where it does not.How to model and measure differences between a pattern and text, including mismatches, deletions, and insertions.How to build a compact description of the text that supports fast final search for all valid occurrences.How the serial and parallel algorithms are structured: pattern analysis, text analysis, and locating all matches with at most k differences.What the workload looks like on parallel hardware, including processor counts and time bounds for each stage.Ideal for readers who want a rigorous look at efficient algorithms for approximate string matching and the practical implications of parallel computation in this area. 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. N° de réf. du vendeur 9781333041229_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781333041229
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781333041229
Quantité disponible : 15 disponible(s)