Thomas Mailund: String Algorithms in C

Um unseren Shop nutzen zu können, müssen Sie Javascript in Ihrem Browser aktivieren.

Cover: 9781484259191 | String Algorithms in C | Efficient Text Representation and Search | IX

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

55,70 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 4-7 Werktage

Sie können kein Produkt in den Warenkorb legen, da Javascript und technisch notwendige Cookies aktiviert sein müssen.

Kategorien:

Der Artikel ist nicht in deutscher Sprache verfasst.
Die Sprache der Produktbeschreibung und Details kann in Englisch angegeben sein. Sollten Sie Verständnisprobleme haben, wenden Sie sich gerne an uns.

Beschreibung

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.

Yoü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.

Über den Autor

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.

Zusammenfassung

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

Inhaltsverzeichnis

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.

Erscheinungsjahr:	2020
Fachbereich:	Programmiersprachen
Genre:	Informatik
Rubrik:	Naturwissenschaften & Technik
Medium:	Taschenbuch
Seiten:	304
Inhalt:	ix 293 S. 89 s/w Illustr. 293 p. 89 illus.
ISBN-13:	9781484259191
ISBN-10:	148425919X
Sprache:	Englisch
Ausstattung / Beilage:	Paperback
Einband:	Kartoniert / Broschiert
Autor:	Mailund, Thomas
Auflage:	1st ed.
Hersteller:	Apress Apress L.P.
Maße:	254 x 178 x 17 mm
Von/Mit:	Thomas Mailund
Erscheinungsdatum:	29.08.2020
Gewicht:	0,576 kg

Ähnliche Produkte