String Algorithms in C: Efficient Text Representation and Search

Author:   Thomas Mailund
Publisher:   APress
Edition:   1st ed.
ISBN:  

9781484259191


Pages:   293
Publication Date:   29 August 2020
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $184.77 Quantity:  
Add to Cart

Share |

String Algorithms in C: Efficient Text Representation and Search


Overview

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. 

Full Product Details

Author:   Thomas Mailund
Publisher:   APress
Imprint:   APress
Edition:   1st ed.
Weight:   0.581kg
ISBN:  

9781484259191


ISBN 10:   148425919
Pages:   293
Publication Date:   29 August 2020
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

1. Introduction.- 2. Classical Algorithms for Exact Search 3. Suffix Trees4. Suffix Arrays 5. Approximate Search6. ConclusionsAppendix A: VectorsAppendix B: ListsAppendix C: Queues

Reviews

Author Information

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.

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

NOV RG 20252

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List