000 | 03344nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-030-55108-7 | ||
003 | DE-He213 | ||
005 | 20240423125328.0 | ||
007 | cr nn 008mamaa | ||
008 | 201007s2020 sz | s |||| 0|eng d | ||
020 |
_a9783030551087 _9978-3-030-55108-7 |
||
024 | 7 |
_a10.1007/978-3-030-55108-7 _2doi |
|
050 | 4 | _aQA76.9.D35 | |
050 | 4 | _aQ350-390 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aGPF _2bicssc |
|
072 | 7 |
_aCOM021000 _2bisacsh |
|
072 | 7 |
_aUMB _2thema |
|
072 | 7 |
_aGPF _2thema |
|
082 | 0 | 4 |
_a005.73 _223 |
082 | 0 | 4 |
_a003.54 _223 |
100 | 1 |
_aLouza, Felipe A. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aConstruction of Fundamental Data Structures for Strings _h[electronic resource] / _cby Felipe A. Louza, Simon Gog, Guilherme P. Telles. |
250 | _a1st ed. 2020. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2020. |
|
300 |
_aIX, 104 p. 47 illus., 32 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aSpringerBriefs in Computer Science, _x2191-5776 |
|
505 | 0 | _aPart I. Introduction and Preliminaries -- 1. Introduction -- 2. Background -- 3. Induced Suffix Sorting -- Part II. Augmented Suffix Sorting -- 4. Inducing the LCP Array -- 5. Inducing the Document Array -- 6. Inducing the Lyndon Array -- Part III. Conclusions -- 7. Conclusions -- Index. . | |
520 | _aThis 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. | ||
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aInformation theory. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aBioinformatics. | |
650 | 1 | 4 | _aData Structures and Information Theory. |
650 | 2 | 4 | _aDesign and Analysis of Algorithms. |
650 | 2 | 4 | _aBioinformatics. |
700 | 1 |
_aGog, Simon. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
700 | 1 |
_aTelles, Guilherme P. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030551070 |
776 | 0 | 8 |
_iPrinted edition: _z9783030551094 |
830 | 0 |
_aSpringerBriefs in Computer Science, _x2191-5776 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-55108-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
942 | _cSPRINGER | ||
999 |
_c176766 _d176766 |