國立高雄大學圖資館 |

登入

回首頁

String processing and information retrieval31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	String processing and information retrievaledited by Zsuzsanna Lipták ... [et al.].
其他題名:	31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024 : proceedings /
其他題名:	SPIRE 2024
其他作者:	Lipták, Zsuzsanna.
團體作者:
出版者:	Cham :Springer Nature Switzerland :2025.
面頁冊數:	xx, 364 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Text processing (Computer science)
電子資源:	https://doi.org/10.1007/978-3-031-72200-4
ISBN:	9783031722004$q(electronic bk.)

String processing and information retrieval31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024 : proceedings /
String processing and information retrieval31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024 : proceedings /[electronic resource] :SPIRE 2024edited by Zsuzsanna Lipták ... [et al.]. - Cham :Springer Nature Switzerland :2025. - xx, 364 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,148991611-3349 ;. - Lecture notes in computer science ;4891..

Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets. -- Bijective BWT based Compression Schemes. -- Indexing Finite-State Automata Using Forward-Stable Partitions. -- Burst Edit Distance. -- Generalization of Repetitiveness Measures for Two-Dimensional Strings. -- On Computing the Smallest Suffixient Set. -- Revisiting the Folklore Algorithm for Random Access to Grammar- Compressed Strings. -- Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts. -- Bounded-Ratio Gapped String Indexing. -- Simultaneously Building and Reconciling a Synteny Tree. -- Quantum Algorithms for Longest Common Substring with a Gap. -- Online Computation of String Net Frequency. -- On the Number of Non-equivalent Parameterized Squares in a String. -- Another virtue of wavelet forests. -- All-Pairs Suffix-Prefix on Dynamic Set of Strings. -- Adaptive Dynamic Bitvectors. -- Compressed Graph Representations for Evaluating Regular Path Queries. -- Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings. -- Faster computation of Chinese frequent strings and their net frequencies. -- Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. -- Computing String Covers in Sublinear Time. -- LZ78 Substring Compression with CDAWGs. -- 2d Side-Sharing Tandems with Mismatches. -- Faster and simpler online/sliding rightmost Lempel-Ziv factorizations. -- Space-efficient SLP Encoding for O(log N)-time Random Access. -- Simple Linear-time Repetition Factorization.

This book constitutes the refereed proceedings of the 31st International Symposium on String Processing and Information Retrieval, SPIRE 2024, held in Puerto Vallarta, Mexico, during September 23-25, 2024. The 22 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 41 submissions. The papers reflect the continuation of the long and well-established tradition of encouraging high-quality research at the broad nexus of string processing, information retrieval, and computational biology.

ISBN: 9783031722004$q(electronic bk.)

Standard No.: 10.1007/978-3-031-72200-4doiSubjects--Topical Terms:

210527
Text processing (Computer science)

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.74

String processing and information retrieval31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024 : proceedings /
LDR:03315nmm a2200349 a 4500 001 678539
003 DE-He213
005 20240919125433.0
006 m d
007 cr nn 008maaau
008 251031s2025 sz s 0 eng d
020 $a 9783031722004$q(electronic bk.)
020 $a 9783031721991$q(paper)
024 7 $a 10.1007/978-3-031-72200-4 $2 doi
035 $a 978-3-031-72200-4
040 $a GP $c GP
041 0 $a eng
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 005.74 $2 23
090 $a QA76.9.A43 $b S759 2024
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a String processing and information retrieval $h [electronic resource] : $b 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024 : proceedings / $c edited by Zsuzsanna Lipták ... [et al.].
246 3 $a SPIRE 2024
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xx, 364 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 14899
505 0 $a Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets. -- Bijective BWT based Compression Schemes. -- Indexing Finite-State Automata Using Forward-Stable Partitions. -- Burst Edit Distance. -- Generalization of Repetitiveness Measures for Two-Dimensional Strings. -- On Computing the Smallest Suffixient Set. -- Revisiting the Folklore Algorithm for Random Access to Grammar- Compressed Strings. -- Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts. -- Bounded-Ratio Gapped String Indexing. -- Simultaneously Building and Reconciling a Synteny Tree. -- Quantum Algorithms for Longest Common Substring with a Gap. -- Online Computation of String Net Frequency. -- On the Number of Non-equivalent Parameterized Squares in a String. -- Another virtue of wavelet forests. -- All-Pairs Suffix-Prefix on Dynamic Set of Strings. -- Adaptive Dynamic Bitvectors. -- Compressed Graph Representations for Evaluating Regular Path Queries. -- Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings. -- Faster computation of Chinese frequent strings and their net frequencies. -- Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. -- Computing String Covers in Sublinear Time. -- LZ78 Substring Compression with CDAWGs. -- 2d Side-Sharing Tandems with Mismatches. -- Faster and simpler online/sliding rightmost Lempel-Ziv factorizations. -- Space-efficient SLP Encoding for O(log N)-time Random Access. -- Simple Linear-time Repetition Factorization.
520 $a This book constitutes the refereed proceedings of the 31st International Symposium on String Processing and Information Retrieval, SPIRE 2024, held in Puerto Vallarta, Mexico, during September 23-25, 2024. The 22 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 41 submissions. The papers reflect the continuation of the long and well-established tradition of encouraging high-quality research at the broad nexus of string processing, information retrieval, and computational biology.
650 0 $a Text processing (Computer science) $3 210527
650 0 $a Information storage and retrieval systems $3 253644
650 1 4 $a Algorithms. $3 184661
650 2 4 $a Design and Analysis of Algorithms. $3 913142
650 2 4 $a Computer Engineering and Networks. $3 913124
650 2 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Numerical Analysis. $3 275681
700 1 $a Lipták, Zsuzsanna. $3 991956
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
856 4 0 $u https://doi.org/10.1007/978-3-031-72200-4
950 $a Computer Science (SpringerNature-11645)