Skip to main content
SpringerLink
Log in
Apress
Book cover

String Algorithms in C

Efficient Text Representation and Search

  • Book
  • © 2020

Overview

Authors:
  1. Thomas Mailund

    1. Aarhus N, Denmark

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Focuses exclusively on string algorithms using C

  • Written by an an expert, computational scientist, and teacher with expertise in C and R

  • Contains implementations of all the algorithms presented in this book

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Pages i-ix
    Download chapter PDF

  2. Introduction

    • Thomas Mailund
    Pages 1-10

  3. Classical algorithms for exact search

    • Thomas Mailund
    Pages 11-86

  4. Suffix trees

    • Thomas Mailund
    Pages 87-138

  5. Suffix arrays

    • Thomas Mailund
    Pages 139-234

  6. Approximate search

    • Thomas Mailund
    Pages 235-271

  7. Conclusions

    • Thomas Mailund
    Pages 273-273

  8. Back Matter

    Pages 275-293
    Download chapter PDF
Back to top

Keywords

About this book

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. 

Authors and Affiliations

  • Aarhus N, Denmark

    Thomas Mailund

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation