Detailansicht
Construction of Fundamental Data Structures for Strings
SpringerBriefs in Computer Science
ISBN/EAN: 9783030551070
Umbreit-Nr.: 9544762
Sprache:
Englisch
Umfang: ix, 104 S., 15 s/w Illustr., 32 farbige Illustr.,
Format in cm:
Einband:
kartoniertes Buch
Erschienen am 08.10.2020
Auflage: 1/2021
- Zusatztext
- 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.
- Kurztext
- This book features numerous examples, including graphic explanations of sophisticated algorithms that provide a clearer understanding of the main algorithmic ideas for readers interested in the topic of suffix sorting.The main related areas include: Algorithms and Data Structures, String Processing Algorithms and Computational analysis of genomic sequences.
- Autorenportrait
- Felipe Alves Louza, Dr., Prof., Faculdade de Engenharia Elétrica, Universidade Federal de Uberlândia, Uberlândia - MG, Brazil, 38400-902 Simon Gog, Dr., eBay Inc., San Jose - USAGuilherme Pimentel Telles, Dr., Prof., Instituto de Computação, Universidade Estadual de Campinas, Campinas - SP, Brazil, 13083-852