國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

String processing and information re...

(1998 :)

String processing and information retrieval28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	String processing and information retrievaledited by Thierry Lecroq, Helene Touzet.
其他題名:	28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021 : proceedings /
其他題名:	SPIRE 2021
其他作者:	Lecroq, Thierry.
團體作者:
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	x, 255 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Text processing (Computer science)
電子資源:	https://doi.org/10.1007/978-3-030-86692-1
ISBN:	9783030866921$q(electronic bk.)

String processing and information retrieval28th 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] :SPIRE 2021edited by Thierry Lecroq, Helene Touzet. - Cham :Springer International Publishing :2021. - x, 255 p. :ill., digital ;24 cm. - Lecture notes in computer science,129440302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

210527
Text processing (Computer science)

LC Class. No.: QA76.9.T48

Dewey Class. No.: 005.72

String processing and information retrieval28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021 : proceedings /
LDR:03040nmm a2200373 a 4500 001 609400
003 DE-He213
005 20210927225702.0
006 m d
007 cr nn 008maaau
008 220222s2021 sz s 0 eng d
020 $a 9783030866921$q(electronic bk.)
020 $a 9783030866914$q(paper)
024 7 $a 10.1007/978-3-030-86692-1 $2 doi
035 $a 978-3-030-86692-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.T48
072 7 $a UNH $2 bicssc
072 7 $a COM030000 $2 bisacsh
072 7 $a UNH $2 thema
072 7 $a UND $2 thema
082 0 4 $a 005.72 $2 23
090 $a QA76.9.T48 $b S759 2021
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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, Helene Touzet.
246 3 $a SPIRE 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a x, 255 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12944
490 1 $a Theoretical computer science and general issues
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 Text processing (Computer science) $3 210527
650 0 $a Information retrieval $v Congresses. $3 384500
650 1 4 $a Information Storage and Retrieval. $3 274190
650 2 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Information Systems Applications (incl. Internet) $3 530743
650 2 4 $a Mathematics of Computing. $3 273710
700 1 $a Lecroq, Thierry. $3 294634
700 1 $a Touzet, Helene. $3 729099
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-86692-1
950 $a Computer Science (SpringerNature-11645)