Implement 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. String Algorithms in C 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.
In 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.You’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.
What You Will Learn
Who This Book Is For
Those with at least some prior programming experience with C or Assembly and have at least prior experience with programming algorithms.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Thomas Mailund is an associate professor in bioinformatics at Aarhus University, Denmark. He has a background in math and computer science, including experience programming and teaching in the C and R programming languages. For the last decade, his main focus has been on genetics and evolutionary studies, particularly comparative genomics, speciation, and gene flow between emerging species.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : BGV Books LLC, Murray, KY, Etats-Unis
Etat : Good. Exact ISBN match. Immediate shipping. No funny business. N° de réf. du vendeur 9781484259191
Quantité disponible : 1 disponible(s)
Vendeur : Lakeside Books, Benton Harbor, MI, Etats-Unis
Etat : New. Brand New! Not Overstocks or Low Quality Book Club Editions! Direct From the Publisher! We're not a giant, faceless warehouse organization! We're a small town bookstore that loves books and loves it's customers! Buy from Lakeside Books! N° de réf. du vendeur OTF-S-9781484259191
Quantité disponible : Plus de 20 disponibles
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9781484259191
Quantité disponible : Plus de 20 disponibles
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur 2bf2ec4bdda84f71237dca954398242e
Quantité disponible : Plus de 20 disponibles
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. 2020. 1st ed. paperback. . . . . . N° de réf. du vendeur V9781484259191
Quantité disponible : 15 disponible(s)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
PF. Etat : New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. N° de réf. du vendeur 6666-IUK-9781484259191
Quantité disponible : 20 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 293 pages. 9.75x7.00x0.75 inches. In Stock. N° de réf. du vendeur x-148425919X
Quantité disponible : 2 disponible(s)
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. 2020. 1st ed. paperback. . . . . . Books ship from the US and Ireland. N° de réf. du vendeur V9781484259191
Quantité disponible : 15 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Implement practical data structures and algorithms for text searchand discover how it is used inside other larger applications. This unique in-depth guide explains string algorithms using the C programming language.String Algorithms in C 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.In 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.You'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.What You Will Learn Use classical exact search algorithms including naive search, borders/border search, Knuth-Morris-Pratt, and Boyer-Moor with or without Horspool Search in trees, use tries and compact tries, and work with the Aho-Carasick algorithm Process suffix trees including the use and development of McCreight's algorithm Work with suffix arrays including binary searches; sorting naive constructions; suffix tree construction; skew algorithms; and the Borrows-Wheeler transform (BWT) Deal with enhanced suffix arrays including longest common prefix (LCP) Carry out approximative pattern searches among suffix trees and approximative BWT searches Who This Book Is ForThose with at least some prior programming experience with C or Assembly and have at least prior experience with programming algorithms. 304 pp. Englisch. N° de réf. du vendeur 9781484259191
Quantité disponible : 2 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In English. N° de réf. du vendeur ria9781484259191_new
Quantité disponible : Plus de 20 disponibles