Muutke küpsiste eelistusi

E-raamat: String Processing and Information Retrieval: 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings

Edited by , Edited by , Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 74,09 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
String Processing and Information Retrieval: 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, ProceedingsSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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 2628, 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.
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.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830314398032e.html
Märksõnad: