Items related to Efficient String Matching With K Differences (Classic...
Synopsis
Excerpt from Efficient String Matching With K Differences
Department of Computer Science, Courant Institute of Mathematical Sciences, New York University and (present address) Department of Computer Science, School of Mathematical Sciences.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
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.
"synopsis" may belong to another edition of this title.
- PublisherForgotten Books
- Publication date2024
- ISBN 10 1334229759
- ISBN 13 9781334229756
- BindingPaperback
- LanguageEnglish
- Number of pages25
Buy New
View this item
US$ 17.05
Shipping:
FREE
From United Kingdom to U.S.A.
Search results for Efficient String Matching With K Differences (Classic...
Stock Image
Efficient String Matching With K Differences (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book examines the String Matching with k Differences problem in computer science. String matching, or pattern matching, is an essential and fundamental problem in computer science. This book investigates a particular type of string matching problem: finding all occurrences of a pattern in a text with at most k differences. In this problem, the differences between characters of the pattern and text can be mismatches, superfluous characters in the text, or superfluous characters in the pattern. The author presents an efficient algorithm for solving the k differences problem, running in 0(m2En) time for a fixed alphabet size and 0(mEn) time for general input. The algorithm has two implementations, the first prioritizing time complexity and the second prioritizing space complexity. The book also discusses the broader context of string matching, including the history of the problem, existing algorithms, and applications in fields such as molecular biology. By providing a comprehensive analysis of the k differences problem, this book serves as a valuable resource for researchers, practitioners, and students in computer science and related fields. 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. Seller Inventory # 9781334229756_0
Quantity: Over 20 available
Stock Image
Efficient String Matching With K Differences Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781334229756
Quantity: 15 available
Stock Image
Efficient String Matching With K Differences Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781334229756
Quantity: 15 available