This book constitutes the proceedings of the 24th International Symposium on String Processing and Information Retrieval, SPIRE 2017, held in Palermo, Italy, in September 2017. The 26 papers presented in this volume were carefully reviewed and selected from 71 submissions. They focus on fundamental studies on string processing and information retrieval, as well as on computational biology.

Produktinformation

Utgivningsdatum2017-09-06
Mått155 x 235 x 19 mm
Vikt517 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor318
Upplaga17001
FörlagSpringer International Publishing AG
ISBN9783319674278

Tillhör följande kategorier

Hårdvara inom Data och IT
Databaser inom Data och IT
Människa – datorinteraktion inom Data och IT

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 Implementationof 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.

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

729 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

729 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Du kanske också är intresserad av

Del 11147

String Processing and Information Retrieval

Travis Gagie, Alistair Moffat, Gonzalo Navarro, Ernesto Cuadros-Vargas

Häftad, 2018

749 kr

String Processing and Information Retrieval

Nivio Ziviani, Ricardo Baeza-Yates

Häftad, 2007

749 kr

Del 8799

String Processing and Information Retrieval

Edleno Moura, Maxime Crochemore

Häftad, 2014

719 kr

String Processing and Information Retrieval

Alberto Apostolico, Massimo Melucci

Häftad, 2004

749 kr

Del 12944

String Processing and Information Retrieval

Thierry Lecroq, Hélène Touzet

Häftad, 2021

969 kr

Del 9954

String Processing and Information Retrieval

Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai

Häftad, 2016

749 kr

Del 9309

String Processing and Information Retrieval

Costas Iliopoulos, Simon Puglisi, Emine Yilmaz

Häftad, 2015

749 kr

Del 8214

String Processing and Information Retrieval

Oren Kurland, Moshe Lewenstein, Ely Porat

Häftad, 2013

749 kr

Del 16073

String Processing and Information Retrieval

Golnaz Badkobeh, Jakub Radoszewski, Nicola Tonellotto, Ricardo Baeza-Yates

Häftad, 2025

989 kr

String Processing and Information Retrieval

Amihood Amir, Andrew Turpin, Alistair Moffat

Häftad, 2008

749 kr

Del 10508 i serien Lecture Notes in Computer Science

String Processing and Information Retrieval

24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings

Häftad, Engelska, 2017

AvGabriele Fici,Marinella Sciortino,Rossano Venturini

749 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

969 kr

Skickas inom 10-15 vardagar

Häftad

1 119 kr

Skickas inom 10-15 vardagar

Häftad

1 119 kr

Skickas inom 10-15 vardagar

Häftad

969 kr

Skickas inom 5-8 vardagar

Häftad

989 kr

Skickas inom 5-8 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum2017-09-06
Mått155 x 235 x 19 mm
Vikt517 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor318
Upplaga17001
FörlagSpringer International Publishing AG
ISBN9783319674278

Tillhör följande kategorier

Hårdvara inom Data och IT
Databaser inom Data och IT
Människa – datorinteraktion inom Data och IT

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 Implementationof 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.