東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

String processing and information re...

SPIRE (Symposium) (2022 :)

FindBook

Google Book

Amazon

博客來

String processing and information retrieval = 29th international symposium, SPIRE 2022, Concepcion, Chile, November 8-10, 2022 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	String processing and information retrieval/ edited by Diego Arroyuelo, Barbara Poblete.
其他題名:	29th international symposium, SPIRE 2022, Concepcion, Chile, November 8-10, 2022 : proceedings /
其他題名:	SPIRE 2022
其他作者:	Arroyuelo, Diego.
團體作者:	SPIRE (Symposium)
出版者:	Cham :Springer International Publishing : : 2022.,
面頁冊數:	xvii, 332 p. :ill., digital ;24 cm.
內容註:	String Algorithms -- Subsequence Covers of Words -- Maximal Closed Substrings -- Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffx Conditions -- The Complexity of the Co-Occurrence Problem -- Reconstructing Parameterized Strings from Parameterized Suffx and LCP Arrays -- Computing the Parameterized Burrows-Wheeler Transform Online -- Accessing the Suffx Array via ϕ−1 -Forest -- On the Optimisation of the GSACA Suffx Array Construction Algorithm -- String Compression -- Balancing Run-Length Straight-Line Programs -- Substring Complexities on Run-length Compressed Strings -- Information Retrieval -- How Train-Test Leakage Affects Zero-shot Retrieval -- Computational Biology -- Genome Comparison on Succinct Colored de Bruijn Graphs -- Sorting Genomes by Prefix Double-Cut-and-Joins -- KATKA: A KRAKEN-like Tool with k Given at Query Time -- Computing all-vs-all MEMs in Run-Length-Encoded Collections of HiFi Reads -- Space-Effcient Data Structures -- Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries -- Compressed String Dictionaries via Data-Aware Subtrie Compaction -- On representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs -- Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors -- Pattern Matching in Strings, Graphs, and Trees -- Matching Patterns with Variables Under Edit Distance -- On the Hardness of Computing the Edit Distance of Shallow Trees -- Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs -- Pattern Matching under DTW Distance.
Contained By:	Springer Nature eBook
標題:	Text processing (Computer science) - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-031-20643-6
ISBN:	9783031206436

String processing and information retrieval = 29th international symposium, SPIRE 2022, Concepcion, Chile, November 8-10, 2022 : proceedings /
String processing and information retrieval29th international symposium, SPIRE 2022, Concepcion, Chile, November 8-10, 2022 : proceedings /[electronic resource] :SPIRE 2022edited by Diego Arroyuelo, Barbara Poblete. - Cham :Springer International Publishing :2022. - xvii, 332 p. :ill., digital ;24 cm. - Lecture notes in computer science,136170302-9743 ;. - Lecture notes in computer science ;13617..

String Algorithms -- Subsequence Covers of Words -- Maximal Closed Substrings -- Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffx Conditions -- The Complexity of the Co-Occurrence Problem -- Reconstructing Parameterized Strings from Parameterized Suffx and LCP Arrays -- Computing the Parameterized Burrows-Wheeler Transform Online -- Accessing the Suffx Array via ϕ−1 -Forest -- On the Optimisation of the GSACA Suffx Array Construction Algorithm -- String Compression -- Balancing Run-Length Straight-Line Programs -- Substring Complexities on Run-length Compressed Strings -- Information Retrieval -- How Train-Test Leakage Affects Zero-shot Retrieval -- Computational Biology -- Genome Comparison on Succinct Colored de Bruijn Graphs -- Sorting Genomes by Prefix Double-Cut-and-Joins -- KATKA: A KRAKEN-like Tool with k Given at Query Time -- Computing all-vs-all MEMs in Run-Length-Encoded Collections of HiFi Reads -- Space-Effcient Data Structures -- Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries -- Compressed String Dictionaries via Data-Aware Subtrie Compaction -- On representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs -- Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors -- Pattern Matching in Strings, Graphs, and Trees -- Matching Patterns with Variables Under Edit Distance -- On the Hardness of Computing the Edit Distance of Shallow Trees -- Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs -- Pattern Matching under DTW Distance.

This book constitutes the refereed proceedings of the 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022, held in Concepcion, Chile, in November 2022. The 23 full papers presented in this volume were carefully reviewed and selected from 43 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology.

ISBN: 9783031206436

Standard No.: 10.1007/978-3-031-20643-6doiSubjects--Topical Terms:

880608
Text processing (Computer science)
--Congresses.

LC Class. No.: QA76.9.T48 / S65 2022

Dewey Class. No.: 005.72

String processing and information retrieval = 29th international symposium, SPIRE 2022, Concepcion, Chile, November 8-10, 2022 : proceedings /
LDR:03232nmm a2200349 a 4500 001 2304798
003 DE-He213
005 20221031132955.0
006 m d
007 cr nn 008maaau
008 230409s2022 sz s 0 eng d
020 $a 9783031206436 $q (electronic bk.)
020 $a 9783031206429 $q (paper)
024 7 $a 10.1007/978-3-031-20643-6 $2 doi
035 $a 978-3-031-20643-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.T48 $b S65 2022
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.72 $2 23
090 $a QA76.9.T48 $b S918 2022
111 2 $a SPIRE (Symposium) $n (29th : $d 2022 : $c Concepcion, Chile) $3 3607312
245 1 0 $a String processing and information retrieval $h [electronic resource] : $b 29th international symposium, SPIRE 2022, Concepcion, Chile, November 8-10, 2022 : proceedings / $c edited by Diego Arroyuelo, Barbara Poblete.
246 3 $a SPIRE 2022
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xvii, 332 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13617
505 0 $a String Algorithms -- Subsequence Covers of Words -- Maximal Closed Substrings -- Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffx Conditions -- The Complexity of the Co-Occurrence Problem -- Reconstructing Parameterized Strings from Parameterized Suffx and LCP Arrays -- Computing the Parameterized Burrows-Wheeler Transform Online -- Accessing the Suffx Array via ϕ−1 -Forest -- On the Optimisation of the GSACA Suffx Array Construction Algorithm -- String Compression -- Balancing Run-Length Straight-Line Programs -- Substring Complexities on Run-length Compressed Strings -- Information Retrieval -- How Train-Test Leakage Affects Zero-shot Retrieval -- Computational Biology -- Genome Comparison on Succinct Colored de Bruijn Graphs -- Sorting Genomes by Prefix Double-Cut-and-Joins -- KATKA: A KRAKEN-like Tool with k Given at Query Time -- Computing all-vs-all MEMs in Run-Length-Encoded Collections of HiFi Reads -- Space-Effcient Data Structures -- Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries -- Compressed String Dictionaries via Data-Aware Subtrie Compaction -- On representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs -- Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors -- Pattern Matching in Strings, Graphs, and Trees -- Matching Patterns with Variables Under Edit Distance -- On the Hardness of Computing the Edit Distance of Shallow Trees -- Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs -- Pattern Matching under DTW Distance.
520 $a This book constitutes the refereed proceedings of the 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022, held in Concepcion, Chile, in November 2022. The 23 full papers presented in this volume were carefully reviewed and selected from 43 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology.
650 0 $a Text processing (Computer science) $v Congresses. $3 880608
650 0 $a Information retrieval $v Congresses. $3 884379
650 1 4 $a Algorithms. $3 536374
650 2 4 $a Design and Analysis of Algorithms. $3 3538532
650 2 4 $a Computer Engineering and Networks. $3 3538504
650 2 4 $a Data Structures and Information Theory. $3 3382368
650 2 4 $a Numerical Analysis. $3 892626
650 2 4 $a Artificial Intelligence. $3 769149
700 1 $a Arroyuelo, Diego. $3 3607313
700 1 $a Poblete, Barbara. $3 3607314
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13617. $3 3607315
856 4 0 $u https://doi.org/10.1007/978-3-031-20643-6
950 $a Computer Science (SpringerNature-11645)