9781334229756 - efficient string matching with k differences (classic reprint) de landau, gad m. (3 resultados)
- Tapa blanda
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de AmericaPBShop.store US
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 24,15
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 15 disponibles
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
- Tapa blanda
Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 24,17
Envío por EUR 3,84Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 15 disponibles
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
- Tapa blanda
- Impresión bajo demanda
Librería: Forgotten Books, London, Reino UnidoForgotten Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 15,16
Gastos de envío gratisSe envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Paperback. Condición: 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 pa…ttern 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.
