國立虎尾科技大學 |

Construction of Fundamental Data Structures for Strings

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Construction of Fundamental Data Structures for Strings/ by Felipe A. Louza, Simon Gog, Guilherme P. Telles.
作者:	Louza, Felipe A.
其他作者:	Telles, Guilherme P.
面頁冊數:	IX, 104 p. 47 illus., 32 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Theory of Computation. -
電子資源:	https://doi.org/10.1007/978-3-030-55108-7
ISBN:	9783030551087

Construction of Fundamental Data Structures for Strings
Louza, Felipe A.

Construction of Fundamental Data Structures for Strings[electronic resource] /by Felipe A. Louza, Simon Gog, Guilherme P. Telles. - 1st ed. 2020. - IX, 104 p. 47 illus., 32 illus. in color.online resource. - SpringerBriefs in Computer Science,2191-5768. - SpringerBriefs in Computer Science,.

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

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.

ISBN: 9783030551087

Standard No.: 10.1007/978-3-030-55108-7doiSubjects--Topical Terms:

669322
Theory of Computation.

LC Class. No.: QA76.9.D35

Dewey Class. No.: 005.73

Construction of Fundamental Data Structures for Strings
LDR:02572nam a22004215i 4500 001 1030232
003 DE-He213
005 20201007062724.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030551087 $9 978-3-030-55108-7
024 7 $a 10.1007/978-3-030-55108-7 $2 doi
035 $a 978-3-030-55108-7
050 4 $a QA76.9.D35
050 4 $a Q350-390
072 7 $a UMB $2 bicssc
072 7 $a COM031000 $2 bisacsh
072 7 $a UMB $2 thema
072 7 $a GPF $2 thema
082 0 4 $a 005.73 $2 23
100 1 $a Louza, Felipe A. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1327080
245 1 0 $a Construction of Fundamental Data Structures for Strings $h [electronic resource] / $c by Felipe A. Louza, Simon Gog, Guilherme P. Telles.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a IX, 104 p. 47 illus., 32 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a SpringerBriefs in Computer Science, $x 2191-5768
505 0 $a Part 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 $a 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.
650 2 4 $a Theory of Computation. $3 669322
650 1 4 $a Data Structures and Information Theory. $3 1211601
650 0 $a Bioinformatics. $3 583857
650 0 $a Computers. $3 565115
650 0 $a Data structures (Computer science). $3 680370
700 1 $a Telles, Guilherme P. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 796193
700 1 $a Gog, Simon. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1327081
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030551070
776 0 8 $i Printed edition: $z 9783030551094
830 0 $a SpringerBriefs in Computer Science, $x 2191-5768 $3 1255334
856 4 0 $u https://doi.org/10.1007/978-3-030-55108-7
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)