國立虎尾科技大學 |

String Processing and Information Retrieval = 28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	String Processing and Information Retrieval/ edited by Thierry Lecroq, Hélène Touzet.
Reminder of title:	28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings /
other author:	Lecroq, Thierry.
Description:	X, 255 p. 47 illus., 29 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Information storage and retrieval systems. -
Online resource:	https://doi.org/10.1007/978-3-030-86692-1
ISBN:	9783030866921

String Processing and Information Retrieval = 28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings /
String Processing and Information Retrieval28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings /[electronic resource] :edited by Thierry Lecroq, Hélène Touzet. - 1st ed. 2021. - X, 255 p. 47 illus., 29 illus. in color.online resource. - Theoretical Computer Science and General Issues,129442512-2029 ;. - Theoretical Computer Science and General Issues,12865.

Invited papers -- r-indexing the eBWT -- Unicode at Gigabytes per Second -- Combinatorics -- Longest Common Rollercoasters -- Minimal unique palindromic substrings after single-character substitution -- Permutation-constrained Common String Partitions with Applications -- All instantiations of the greedy algorithm for the shortest superstring problem are equivalent -- String Covers of a Tree -- Compression -- Grammar Index By Induced Suffix Sorting -- An LMS-based Grammar Self-index with Local Consistency Properties -- On the approximation ratio of LZ-End to LZ77 -- Data Structures -- Computing the original eBWT faster, simpler, and with less memory -- Extracting the Sparse Longest Common Pre x Array from the Suffix Binary Search Tree -- findere: fast and precise approximate membership query -- Repeats -- Improved Topic Modeling in Twitter through Community Pooling -- Lower Bounds for the Number of Repetitions in 2D Strings -- On Stricter Reachable Repetitiveness Measures -- Information Retrieval -- Improved Topic modeling in Twitter through Community Pooling -- TSXor: A Simple Time Series Compression Algorithm -- Pattern Matching -- Exploiting Pseudo-Locality of Interchange Distance -- Position Heaps for Cartesian-tree Matching on Strings and Tries.

This book constitutes the refereed proceedings of the 27th International Symposium on String Processing and Information Retrieval, SPIRE 2021, held in Lille, France, in October 2021.* The 14 full papers and 4 short papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 30 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology. *The symposium was held virtually.

ISBN: 9783030866921

Standard No.: 10.1007/978-3-030-86692-1doiSubjects--Topical Terms:

561170
Information storage and retrieval systems.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 025.04

String Processing and Information Retrieval = 28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings /
LDR:03351nam a22004335i 4500 001 1059254
003 DE-He213
005 20220223114530.0
007 cr nn 008mamaa
008 220414s2021 sz | s |||| 0|eng d
020 $a 9783030866921 $9 978-3-030-86692-1
024 7 $a 10.1007/978-3-030-86692-1 $2 doi
035 $a 978-3-030-86692-1
050 4 $a QA75.5-76.95
072 7 $a UNH $2 bicssc
072 7 $a UND $2 bicssc
072 7 $a COM030000 $2 bisacsh
072 7 $a UNH $2 thema
072 7 $a UND $2 thema
082 0 4 $a 025.04 $2 23
245 1 0 $a String Processing and Information Retrieval $h [electronic resource] : $b 28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings / $c edited by Thierry Lecroq, Hélène Touzet.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a X, 255 p. 47 illus., 29 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 Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12944
505 0 $a Invited papers -- r-indexing the eBWT -- Unicode at Gigabytes per Second -- Combinatorics -- Longest Common Rollercoasters -- Minimal unique palindromic substrings after single-character substitution -- Permutation-constrained Common String Partitions with Applications -- All instantiations of the greedy algorithm for the shortest superstring problem are equivalent -- String Covers of a Tree -- Compression -- Grammar Index By Induced Suffix Sorting -- An LMS-based Grammar Self-index with Local Consistency Properties -- On the approximation ratio of LZ-End to LZ77 -- Data Structures -- Computing the original eBWT faster, simpler, and with less memory -- Extracting the Sparse Longest Common Pre x Array from the Suffix Binary Search Tree -- findere: fast and precise approximate membership query -- Repeats -- Improved Topic Modeling in Twitter through Community Pooling -- Lower Bounds for the Number of Repetitions in 2D Strings -- On Stricter Reachable Repetitiveness Measures -- Information Retrieval -- Improved Topic modeling in Twitter through Community Pooling -- TSXor: A Simple Time Series Compression Algorithm -- Pattern Matching -- Exploiting Pseudo-Locality of Interchange Distance -- Position Heaps for Cartesian-tree Matching on Strings and Tries.
520 $a This book constitutes the refereed proceedings of the 27th International Symposium on String Processing and Information Retrieval, SPIRE 2021, held in Lille, France, in October 2021.* The 14 full papers and 4 short papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 30 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology. *The symposium was held virtually.
650 0 $a Information storage and retrieval systems. $3 561170
650 0 $a Artificial intelligence. $3 559380
650 0 $a Application software. $3 528147
650 0 $a Computer science—Mathematics. $3 1253519
650 1 4 $a Information Storage and Retrieval. $3 593926
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Computer and Information Systems Applications. $3 1365732
650 2 4 $a Mathematics of Computing. $3 669457
700 1 $a Lecroq, Thierry. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 566359
700 1 $a Touzet, Hélène. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1264874
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030866914
776 0 8 $i Printed edition: $z 9783030866938
830 0 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12865 $3 1365719
856 4 0 $u https://doi.org/10.1007/978-3-030-86692-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)