國立虎尾科技大學 |

String Processing and Information Retrieval = 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	String Processing and Information Retrieval/ edited by Diego Arroyuelo, Barbara Poblete.
Reminder of title:	29th International Symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022, Proceedings /
other author:	Arroyuelo, Diego.
Description:	XVII, 332 p. 66 illus., 41 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-031-20643-6
ISBN:	9783031206436

String Processing and Information Retrieval = 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022, Proceedings /
String Processing and Information Retrieval29th International Symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022, Proceedings /[electronic resource] :edited by Diego Arroyuelo, Barbara Poblete. - 1st ed. 2022. - XVII, 332 p. 66 illus., 41 illus. in color.online resource. - Lecture Notes in Computer Science,136171611-3349 ;. - Lecture Notes in Computer Science,9324.

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 Concepción, 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:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 518.1

String Processing and Information Retrieval = 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022, Proceedings /
LDR:03558nam a22004095i 4500 001 1085045
003 DE-He213
005 20221031132955.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031206436 $9 978-3-031-20643-6
024 7 $a 10.1007/978-3-031-20643-6 $2 doi
035 $a 978-3-031-20643-6
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 518.1 $2 23
245 1 0 $a String Processing and Information Retrieval $h [electronic resource] : $b 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022, Proceedings / $c edited by Diego Arroyuelo, Barbara Poblete.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XVII, 332 p. 66 illus., 41 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 Lecture Notes in Computer Science, $x 1611-3349 ; $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 Concepción, 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 Algorithms. $3 527865
650 0 $a Computer engineering. $3 569006
650 0 $a Computer networks . $3 1365720
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Information theory. $3 595305
650 0 $a Numerical analysis. $3 527939
650 0 $a Artificial intelligence. $3 559380
650 2 4 $a Design and Analysis of Algorithms. $3 1365721
650 2 4 $a Computer Engineering and Networks. $3 1365733
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Numerical Analysis. $3 671433
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Arroyuelo, Diego. $e editor. $1 https://orcid.org/0000-0002-2509-8097 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1391445
700 1 $a Poblete, Barbara. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1391446
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031206429
776 0 8 $i Printed edition: $z 9783031206443
830 0 $a Lecture Notes in Computer Science, $x 0302-9743 ; $v 9324 $3 1258960
856 4 0 $u https://doi.org/10.1007/978-3-031-20643-6
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)