Hallo! Tracked shipping to Austria with Delivery Duty Paid for just €3.99  

Ship to
Austria
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada String Algorithms in C: Efficient Text Representation and Search
Type
Physical Book
Author
Publisher
Language
English
Pages
293
Format
Paperback
Dimensions
25.4 x 17.8 x 1.6 cm
Weight
0.53 kg.
ISBN13
9781484259191
Categories

String Algorithms in C: Efficient Text Representation and Search

Thomas Mailund (Author) · Apress · Paperback

String Algorithms in C: Efficient Text Representation and Search - Mailund, Thomas

Cheaper New Book Imported to Austria
Delivery: 24 Aug - 01 Sep Shipping: 12 to 16 business days.
64,13 €
Faster New Book Imported to Austria
Delivery: 12 Aug - 14 Aug Shipping: 4 to 5 business days.
86,40 €
Import costs and 10% VAT included in the price ✅
64,13 €

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "String Algorithms in C: Efficient Text Representation and Search"

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 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 For Those with at least some prior programming experience with C or Assembly and have at least prior experience with programming algorithms.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews