Read While You Wait - Get immediate ebook access, if available*, when you order a print book

String Algorithms in C

Efficient Text Representation and Search

Authors: Mailund, Thomas

Download source code Free Preview
  • 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
see more benefits

Buy this book

eBook $29.99
price for USA
  • ISBN 978-1-4842-5920-7
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $39.99
price for USA
  • ISBN 978-1-4842-5919-1
  • Free shipping for individuals worldwide. COVID-19 shipping restrictions apply.
  • Immediate ebook access, if available*, with your print order
  • Usually ready to be dispatched within 3 to 5 business days.
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. 

About the authors

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.

Table of contents (6 chapters)

Table of contents (6 chapters)

Buy this book

eBook $29.99
price for USA
  • ISBN 978-1-4842-5920-7
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $39.99
price for USA
  • ISBN 978-1-4842-5919-1
  • Free shipping for individuals worldwide. COVID-19 shipping restrictions apply.
  • Immediate ebook access, if available*, with your print order
  • Usually ready to be dispatched within 3 to 5 business days.

Services for this book

Loading...

Bibliographic Information

Bibliographic Information
Book Title
String Algorithms in C
Book Subtitle
Efficient Text Representation and Search
Authors
Copyright
2020
Publisher
Apress
Copyright Holder
Thomas Mailund
eBook ISBN
978-1-4842-5920-7
DOI
10.1007/978-1-4842-5920-7
Softcover ISBN
978-1-4842-5919-1
Edition Number
1
Number of Pages
IX, 293
Number of Illustrations
89 b/w illustrations
Topics

*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works and instructor copies are not included.