検索結果をRefWorksへエクスポートします。対象は1件です。
Export
RT Book, Whole SR Electronic DC OPAC T1 String Processing and Information Retrieval : 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26–28, 2023, Proceedings / edited by Franco Maria Nardini, Nadia Pisanti, Rossano Venturini T2 Lecture Notes in Computer Science. ISSN:16113349 A1 Nardini, Franco Maria A1 Pisanti, Nadia A1 Venturini, Rossano A1 SpringerLink (Online service) YR 2023 FD 2023 SP XIX, 394 p. 60 illus., 41 illus. in color K1 Algorithms K1 Computer engineering K1 Computer networks K1 Artificial intelligence K1 Data structures (Computer science) K1 Information theory K1 Numerical analysis K1 Algorithms K1 Design and Analysis of Algorithms K1 Computer Engineering and Networks K1 Artificial Intelligence K1 Data Structures and Information Theory K1 Numerical Analysis ED 1st ed. 2023. PB Springer Nature Switzerland : Imprint: Springer PP Cham SN 9783031439803 LA English (英語) CL LCC:QA76.9.A43 CL DC23:518.1 NO 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 NO 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 NO HTTP:URL=https://doi.org/10.1007/978-3-031-43980-3 NO 書誌ID=EB00003814; LK [E Book]https://doi.org/10.1007/978-3-031-43980-3 OL 30