null

Recently Viewed

New

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

No reviews yet Write a Review
RRP: £54.99
£41.40
Booksplease saves you

  Delivery: We ship to over 200 countries from the UK
  Range: Millions of books available
  Reviews: Booksplease rated "Excellent" on Trustpilot

  FREE UK DELIVERY: When you buy 3 or more books on Booksplease - Use code: FREEUKDELIVERY in your cart!

SKU:
9781484259191
MPN:
9781484259191
Available from Booksplease!
Availability: Usually dispatched within 5 working days

Frequently Bought Together:

Total: Inc. VAT
Total: Ex. VAT

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.



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.


Book Information
ISBN 9781484259191
Author Thomas Mailund
Format Paperback
Page Count 293
Imprint APress
Publisher APress

Reviews

No reviews yet Write a Review

Booksplease  Reviews


J - United Kingdom

Fast and efficient way to choose and receive books

This is my second experience using Booksplease. Both orders dealt with very quickly and despatched. Now waiting for my next read to drop through the letterbox.

J - United Kingdom

T - United States

Will definitely use again!

Great experience and I have zero concerns. They communicated through the shipping process and if there was any hiccups in it, they let me know. Books arrived in perfect condition as well as being fairly priced. 10/10 recommend. I will definitely shop here again!

T - United States

R - Spain

The shipping was just superior

The shipping was just superior; not even one of the books was in contact with the shipping box -anywhere-, not even a corner or the bottom, so all the books arrived in perfect condition. The international shipping took around 2 weeks, so pretty great too.

R - Spain

J - United Kingdom

Found a hard to get book…

Finding a hard to get book on Booksplease and with it not being an over inflated price was great. Ordering was really easy with updates on despatch. The book was packaged well and in great condition. I will certainly use them again.

J - United Kingdom