Noch Fragen? 0800 / 33 82 637

Construction of Fundamental Data Structures for Strings

Produktform: E-Buch Text Elektronisches Buch in proprietärem

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.weiterlesen

Dieser Artikel gehört zu den folgenden Serien

Elektronisches Format: PDF

Sprache(n): Englisch

ISBN: 978-3-030-55108-7 / 978-3030551087 / 9783030551087

Verlag: Springer International Publishing

Erscheinungsdatum: 07.10.2020

Seiten: 104

Autor(en): Guilherme P. Telles, Simon Gog, Felipe A. Louza

58,84 € inkl. MwSt.
Recommended Retail Price
kostenloser Versand

lieferbar - Lieferzeit 10-15 Werktage

zurück