東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

String processing and information re...

SPIRE (Symposium) (2023 :)

FindBook

Google Book

Amazon

博客來

String processing and information retrieval = 30th International Symposium, SPIRE 2023, Palermo, Italy, September 26-28, 2023 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	String processing and information retrieval/ edited by Franco Maria Nardini, Nadia Pisanti, Rossano Venturini.
其他題名:	30th International Symposium, SPIRE 2023, Palermo, Italy, September 26-28, 2023 : proceedings /
其他題名:	SPIRE 2023
其他作者:	Nardini, Franco Maria.
團體作者:	SPIRE (Symposium)
出版者:	Cham :Springer Nature Switzerland : : 2023.,
面頁冊數:	xix, 394 p. :ill., digital ;24 cm.
內容註:	Longest Common Prefix Arrays for Succinct k-Spectra -- On Suffix Tree Detection -- Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph -- Evaluating Regular Path Queries on Compressed Adjacency Matrices -- Approximate Cartesian Tree Matching: an Approach Using Swaps -- Optimal Wheeler Language Recognition -- Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem -- Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem -- Compressibility Measures for Two-dimensional Data -- From De Bruijn Graphs to Variation Graphs - Relationships between Pangenome Models -- CAGE: Cache-Aware Graphlet Enumeration -- Space-time Trade-offs for the LCP Array of Wheeler DFAs -- Computing all-vs-all MEMs in Grammar-compressed Text -- Sublinear Time Lempel-Ziv (LZ77) Factorization -- New Advances in Rightmost Lempel-Ziv -- Engineering a Textbook Approach to Index Massive String Dictionaries -- Count-min Sketch with Variable Number of Hash Functions: an Experimental Study -- Dynamic Compact Planar Embeddings -- A Simple Grammar-based Index for Finding Approximately Longest Common Substrings -- On the Number of Factors in the LZ-End Factorization -- Non-Overlapping Indexing in BWT-runs Bounded Space -- Efficient Parameterized Pattern Matching in Sublinear Space -- Largest Repetition Factorization of Fibonacci Words -- String Covers of a Tree Revisited -- Compacting Massive Public Transport Data -- Constant Time and Space Updates for the Sigma-Tau Problem -- Generalized Minimal Absent Words of Multiple Strings -- Frequency-Constrained Substring Complexity -- Chaining of Maximal Exact Matches in Graphs -- Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems -- Binary Mixed-digit Data Compression Codes.
Contained By:	Springer Nature eBook
標題:	Text processing (Computer science) - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-031-43980-3
ISBN:	9783031439803

String processing and information retrieval = 30th International Symposium, SPIRE 2023, Palermo, Italy, September 26-28, 2023 : proceedings /
String processing and information retrieval30th International Symposium, SPIRE 2023, Palermo, Italy, September 26-28, 2023 : proceedings /[electronic resource] :SPIRE 2023edited by Franco Maria Nardini, Nadia Pisanti, Rossano Venturini. - Cham :Springer Nature Switzerland :2023. - xix, 394 p. :ill., digital ;24 cm. - Lecture notes in computer science,142400302-9743 ;. - Lecture notes in computer science ;14240..

Longest Common Prefix Arrays for Succinct k-Spectra -- On Suffix Tree Detection -- Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph -- Evaluating Regular Path Queries on Compressed Adjacency Matrices -- Approximate Cartesian Tree Matching: an Approach Using Swaps -- Optimal Wheeler Language Recognition -- Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem -- Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem -- Compressibility Measures for Two-dimensional Data -- From De Bruijn Graphs to Variation Graphs - Relationships between Pangenome Models -- CAGE: Cache-Aware Graphlet Enumeration -- Space-time Trade-offs for the LCP Array of Wheeler DFAs -- Computing all-vs-all MEMs in Grammar-compressed Text -- Sublinear Time Lempel-Ziv (LZ77) Factorization -- New Advances in Rightmost Lempel-Ziv -- Engineering a Textbook Approach to Index Massive String Dictionaries -- Count-min Sketch with Variable Number of Hash Functions: an Experimental Study -- Dynamic Compact Planar Embeddings -- A Simple Grammar-based Index for Finding Approximately Longest Common Substrings -- On the Number of Factors in the LZ-End Factorization -- Non-Overlapping Indexing in BWT-runs Bounded Space -- Efficient Parameterized Pattern Matching in Sublinear Space -- Largest Repetition Factorization of Fibonacci Words -- String Covers of a Tree Revisited -- Compacting Massive Public Transport Data -- Constant Time and Space Updates for the Sigma-Tau Problem -- Generalized Minimal Absent Words of Multiple Strings -- Frequency-Constrained Substring Complexity -- Chaining of Maximal Exact Matches in Graphs -- Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems -- Binary Mixed-digit Data Compression Codes.

This volume LNCS 14240 constitutes the refereed proceedings of the 30th International Symposium on String Processing and Information Retrieval, SPIRE 2023, held in Pisa, Italy, during September 26-28, 2023. The 31 full papers presented were carefully reviewed and selected from 47 submissions. They cover topics such as: data structures; algorithms; constrained Substring complexity; data compression codes; succinct k-spectra; and LCP array of wheeler DFAs.

ISBN: 9783031439803

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

880608
Text processing (Computer science)
--Congresses.

LC Class. No.: QA76.9.T48

Dewey Class. No.: 005.72

String processing and information retrieval = 30th International Symposium, SPIRE 2023, Palermo, Italy, September 26-28, 2023 : proceedings /
LDR:03496nmm a2200349 a 4500 001 2334516
003 DE-He213
005 20230919131509.0
006 m d
007 cr nn 008maaau
008 240402s2023 sz s 0 eng d
020 $a 9783031439803 $q (electronic bk.)
020 $a 9783031439797 $q (paper)
024 7 $a 10.1007/978-3-031-43980-3 $2 doi
035 $a 978-3-031-43980-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.T48
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 S759 2023
111 2 $a SPIRE (Symposium) $n (30th : $d 2023 : $c Palmero, Italy) $3 3666167
245 1 0 $a String processing and information retrieval $h [electronic resource] : $b 30th International Symposium, SPIRE 2023, Palermo, Italy, September 26-28, 2023 : proceedings / $c edited by Franco Maria Nardini, Nadia Pisanti, Rossano Venturini.
246 3 $a SPIRE 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a xix, 394 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 14240
505 0 $a Longest Common Prefix Arrays for Succinct k-Spectra -- On Suffix Tree Detection -- Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph -- Evaluating Regular Path Queries on Compressed Adjacency Matrices -- Approximate Cartesian Tree Matching: an Approach Using Swaps -- Optimal Wheeler Language Recognition -- Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem -- Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem -- Compressibility Measures for Two-dimensional Data -- From De Bruijn Graphs to Variation Graphs - Relationships between Pangenome Models -- CAGE: Cache-Aware Graphlet Enumeration -- Space-time Trade-offs for the LCP Array of Wheeler DFAs -- Computing all-vs-all MEMs in Grammar-compressed Text -- Sublinear Time Lempel-Ziv (LZ77) Factorization -- New Advances in Rightmost Lempel-Ziv -- Engineering a Textbook Approach to Index Massive String Dictionaries -- Count-min Sketch with Variable Number of Hash Functions: an Experimental Study -- Dynamic Compact Planar Embeddings -- A Simple Grammar-based Index for Finding Approximately Longest Common Substrings -- On the Number of Factors in the LZ-End Factorization -- Non-Overlapping Indexing in BWT-runs Bounded Space -- Efficient Parameterized Pattern Matching in Sublinear Space -- Largest Repetition Factorization of Fibonacci Words -- String Covers of a Tree Revisited -- Compacting Massive Public Transport Data -- Constant Time and Space Updates for the Sigma-Tau Problem -- Generalized Minimal Absent Words of Multiple Strings -- Frequency-Constrained Substring Complexity -- Chaining of Maximal Exact Matches in Graphs -- Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems -- Binary Mixed-digit Data Compression Codes.
520 $a This volume LNCS 14240 constitutes the refereed proceedings of the 30th International Symposium on String Processing and Information Retrieval, SPIRE 2023, held in Pisa, Italy, during September 26-28, 2023. The 31 full papers presented were carefully reviewed and selected from 47 submissions. They cover topics such as: data structures; algorithms; constrained Substring complexity; data compression codes; succinct k-spectra; and LCP array of wheeler DFAs.
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 Artificial Intelligence. $3 769149
650 2 4 $a Data Structures and Information Theory. $3 3382368
650 2 4 $a Numerical Analysis. $3 892626
700 1 $a Nardini, Franco Maria. $3 3666168
700 1 $a Pisanti, Nadia. $3 1244235
700 1 $a Venturini, Rossano. $3 2056129
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 14240. $3 3666169
856 4 0 $u https://doi.org/10.1007/978-3-031-43980-3
950 $a Computer Science (SpringerNature-11645)