String Algorithms in C

Efficient Text Representation and Search

Thomas Mailund

$116.95 $93.60

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

APress
29 August 2020

Algorithms & data structures; Compilers

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.

By: Thomas Mailund
Imprint: APress
Country of Publication: United States
Edition: 1st ed.
Dimensions: Height: 254mm, Width: 178mm,
Weight: 581g
ISBN: 9781484259191
ISBN 10: 148425919X
Pages: 293
Publication Date: 29 August 2020
Audience: Professional and scholarly , Undergraduate
Format: Paperback
Publisher's Status: Active

1. Introduction.- 2. Classical Algorithms for Exact Search.- 3. Suffix Trees.- 4. Suffix Arrays.- 5. Approximate Search.- 6. Conclusions.- Appendix A: Vectors.- Appendix B: Lists.- Appendix C: Queues.

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.