Get Free Shipping on orders over $79
Construction of Fundamental Data Structures for Strings : Computer Science (R0) - Felipe A. Louza

Construction of Fundamental Data Structures for Strings

By: Felipe A. Louza, Simon Gog, Guilherme P. Telles

eText | 7 October 2020

At a Glance

eText


$89.99

or 4 interest-free payments of $22.50 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

This books reviews recent theoretical and practical advances on suffix sorting and introduces algorithmic solutions to problems of wide interest for the construction of fundamental data structures that operate efficiently on strings namely, constructing the suffix array, the longest common prefix (LCP) array, the document array and the Lyndon array.

These data structures are the cornerstone of many algorithmic solutions in Bioiformatics, Information Retrieval and Data Compression.

This book introduces the relevant problem areas, their importance, the notation and related algorithms and then presents the algorithmic solutions for indexing data structure constructions.

This book is intended for graduate students, researchers and practitioners from Computer Science and Bioinformatics with a strong interest in algorithmic aspects.

on
Desktop
Tablet
Mobile

More in Computer Science

Amazon.com : Get Big Fast - Robert Spector

eBOOK

Medium Hot : Images in the Age of Heat - Hito Steyerl

eBOOK

RRP $22.66

$18.99

16%
OFF
AI Futures - Evgeny Morozov

eBOOK

RRP $16.88

$13.99

17%
OFF