String processing and information retrieval : 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings /: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings. (2017)
- Record Type:
- Book
- Title:
- String processing and information retrieval : 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings /: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings. (2017)
- Main Title:
- String processing and information retrieval : 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings
- Other Titles:
- SPIRE 2017
- Further Information:
- Note: Gabriele Fici, Marinella Sciortino, Rossano Venturini (eds.).
- Editors:
- Fici, Gabriele
Sciortino, Marinella
Venturini, Rossano - Other Names:
- SPIRE (Symposium), 24th
- Contents:
- Greedy shortest common superstring approximation in compact space -- Longest common factor after one edit operation -- Distinct squares in circular words -- LZ78 Compression in Low Main Memory Space -- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.-On suffix tree breadth -- Pattern Matching on Elastic-Degenerate Text with Errors -- Succint Partial Sums and Fenwick Trees -- Tight Bounds for Top Tree Compression -- Efficient Compression and Indexing of Trajectories -- Fast Construction of Compressed Web Graphs -- Constructing a Consensus Phylogeny from a Leaf-Removal Distance -- Listing Maximal Independent Sets with Minimal Space and Bounded Delay -- Fast label extraction in the CDAWG -- Lightweight BWT and LCP Merging via the Gap algorithm -- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries -- Regular Abelian periods and longest common Abelian factors on run-length encoded strings.-Mining bit-parallel LCS-length algorithms -- Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries -- Faster Practical Block Compression for Rank/Select Dictionaries -- Optimal Skeleton Huffman Trees -- Detecting Unary Patterns -- Order preserving pattern matching on trees and DAGs -- A Self-Index on Block Trees -- Counting Palindromes in Substrings -- linear-size CDAWG: new repetition-aware indexing and grammar compression.
- Publisher Details:
- Cham, Switzerland : Springer
- Publication Date:
- 2017
- Extent:
- 1 online resource (xix, 318 pages), illustrations
- Subjects:
- 005.7/2
Computer science
Text processing (Computer science) -- Congresses
Information retrieval -- Congresses
Information retrieval
Text processing (Computer science)
Business & Economics -- Information Management
Computers -- Data Processing
Computers -- Intelligence (AI) & Semantics
Computers -- Database Management -- General
Computers -- Computer Graphics
Information architecture
Public administration
Artificial intelligence
Databases
Image processing
Information storage and retrieva
Information Systems
Artificial intelligence
Database management
Computer vision
Computers -- System Administration -- Storage & Retrieval
Information retrieval
Electronic books
Conference papers and proceedings - Languages:
- English
- ISBNs:
- 9783319674285
3319674285
3319674277
9783319674278 - Related ISBNs:
- 9783319674278
- Notes:
- Note: Includes bibliographical references and author index.
Note: Online resource; title from PDF title page (SpringerLink, viewed September 21, 2017). - Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.366490
- Ingest File:
- 02_345.xml