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

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...
€82,89 EUR
€82,89 EUR
SKU: 9781484259191
Product Type: Books
Please hurry! Only 429 left in stock
Author: Thomas Mailund
Format: Paperback
Language: English
Subtotal: €82,89
10 customers are viewing this product
String Algorithms in C: Efficient Text Representation and Search by Mailund, Thomas

String Algorithms in C: Efficient Text Representation and Search

€82,89
String Algorithms in C: Efficient Text Representation and Search by Mailund, Thomas

String Algorithms in C: Efficient Text Representation and Search

€82,89
Author: Thomas Mailund
Format: Paperback
Language: English
Description

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.



Author: Thomas Mailund
Publisher: Apress
Published: 08/29/2020
Pages: 293
Binding Type: Paperback
Weight: 1.17lbs
Size: 10.00h x 7.00w x 0.64d
ISBN: 9781484259191

About the Author
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.
Shipping & Return

Returns Policy

You may return most new, unopened items within 30 days of delivery for a full refund. We'll also pay the return shipping costs if the return is a result of our error (you received an incorrect or defective item, etc.).

You should expect to receive your refund within four weeks of giving your package to the return shipper, however, in many cases you will receive a refund more quickly. This time period includes the transit time for us to receive your return from the shipper (5 to 10 business days), the time it takes us to process your return once we receive it (3 to 5 business days), and the time it takes your bank to process our refund request (5 to 10 business days).

If you need to return an item, simply login to your account, view the order using the "Complete Orders" link under the My Account menu and click the Return Item(s) button. We'll notify you via e-mail of your refund once we've received and processed the returned item.

Shipping

We can ship to virtually any address in the world. Note that there are restrictions on some products, and some products cannot be shipped to international destinations.

When you place an order, we will estimate shipping and delivery dates for you based on the availability of your items and the shipping options you choose. Depending on the shipping provider you choose, shipping date estimates may appear on the shipping quotes page.

Please also note that the shipping rates for many items we sell are weight-based. The weight of any such item can be found on its detail page. To reflect the policies of the shipping companies we use, all weights will be rounded up to the next full pound.

Review

Related Products

Example product title
€82,89 EUR
€82,89 EUR
Example product title
€82,89 EUR
€82,89 EUR
Example product title
€82,89 EUR
€82,89 EUR
Example product title
€82,89 EUR
€82,89 EUR
Example product title
€82,89 EUR
€82,89 EUR
Example product title
€82,89 EUR
€82,89 EUR
Example product title
€82,89 EUR
€82,89 EUR
Example product title
€82,89 EUR
€82,89 EUR
Example product title
€82,89 EUR
€82,89 EUR
Example product title
€82,89 EUR
€82,89 EUR

Recently Viewed Products