{"product_id":"9781484259191","title":"String Algorithms in C: Efficient Text Representation and Search","description":"\u003ch1\u003eString Algorithms in C: Efficient Text Representation and Search\u003c\/h1\u003e \u003ch2\u003eMailund, Thomas\u003c\/h2\u003e \u003cp\u003e\u003c\/p\u003e\u003cp\u003eImplement practical data structures and algorithms for text search and discover how it is used inside other larger applications. This unique in-depth guide explains string algorithms using the C programming language. \u003ci\u003eString Algorithms in C\u003c\/i\u003e teaches you the following algorithms and how to use them: classical exact search algorithms; tries and compact tries; suffix trees and arrays; approximative pattern searches; and more.   \u003c\/p\u003e\n\nIn this book, author Thomas Mailund provides a library with all the algorithms and applicable source code that you can use in your own programs. There are implementations of all the algorithms presented in this book so there are plenty of examples.  \u003cp\u003e\u003c\/p\u003e\n\n\u003cp\u003eYou’ll understand that string algorithms are used in various applications such as image processing, computer vision, text analytics processing from data science to web applications, information retrieval from databases, network security, and much more.  \u003c\/p\u003e\n\n\u003cp\u003e\u003cb\u003eWhat You Will Learn\u003c\/b\u003e\u003c\/p\u003e\n\n\u003cul\u003e  Use classical exact search      algorithms including naive search, borders\/border search, Knuth-Morris-Pratt,      and Boyer-Moor with or without Horspool   \u003cli\u003eSearch in trees, use tries      and compact tries, and work with the Aho-Carasick algorithm\u003c\/li\u003e  Process suffix trees      including the use and development of McCreight’s algorithm  \u003cli\u003eWork with suffix arrays      including binary searches; sorting naive constructions; suffix tree      construction; skew algorithms; and the Borrows-Wheeler transform (BWT)\u003c\/li\u003e  Deal with enhanced suffix      arrays including longest common prefix (LCP)  \u003cli\u003eCarry out approximative      pattern searches among suffix trees and approximative BWT searches \u003c\/li\u003e\n\u003c\/ul\u003e \u003cp\u003e\u003cb\u003eWho This Book Is For\u003c\/b\u003e \u003c\/p\u003e\n\n\u003cp\u003eThose with at least some prior programming experience with C or Assembly and have at least prior experience with programming algorithms. \u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Apress\u003c\/p\u003e \u003cp\u003ePublication Date: 2020-08-29\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003eISBN-13: 9781484259191\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-1-4842-5920-7\u003c\/p\u003e \u003cp\u003eDimensions: 254cm x178cm\u003c\/p\u003e \u003cp\u003ePages: 293\u003c\/p\u003e ","brand":"Apress","offers":[{"title":"Default Title","offer_id":47710844616844,"sku":"9781484259191","price":62.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9781484259191.jpg?v=1776791181","url":"https:\/\/fh90cf-fv.myshopify.com\/products\/9781484259191","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}