img Leseprobe Leseprobe

Construction of Fundamental Data Structures for Strings

Guilherme P. Telles, Simon Gog, Felipe A. Louza, et al.

PDF
ca. 58,84
Amazon iTunes Thalia.de Weltbild.de Hugendubel Bücher.de ebook.de kobo Osiander Google Books Barnes&Noble bol.com Legimi yourbook.shop Kulturkaufhaus ebooks-center.de
* Affiliatelinks/Werbelinks
Hinweis: Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.

Springer International Publishing img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Informatik

Beschreibung

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.

Weitere Titel in dieser Kategorie
Cover Cyber Operations
Jerry M. Couretas
Cover Cyber Operations
Jerry M. Couretas

Kundenbewertungen

Schlagwörter

Lyndon array, Suffix array, Suffix sorting, LCP array, Document array