Muutke küpsiste eelistusi

E-raamat: String Processing and Information Retrieval: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings

Edited by , Edited by , Edited by
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 55,56 €*
  • * 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: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, 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 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.

Greedy Shortest Common Superstring Approximation in Compact Space
1(13)
Jarno Alanko
Tuukka Norri
Longest Common Factor After One Edit Operation
14(13)
Amihood Amir
Panagiotis Charalampopoulos
Costas S. Iliopoulos
Solon P. Pissis
Jakub Radoszewski
Distinct Squares in Circular Words
27(11)
Mika Amit
Pawel Gawrychowski
LZ78 Compression in Low Main Memory Space
38(13)
Diego Arroyuelo
Rodrigo Cdnovas
Gonzalo Navarro
Rajeev Raman
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation
51(17)
Golnaz Badkobeh
Travis Gagie
Shunsuke Inenaga
Tomasz Kociumaka
Dmitry Kosolobov
Simon J. Puglisi
On Suffix Tree Breadth
68(6)
Golnaz Badkobeh
Juha Karkkdinen
Simon J. Puglisi
Bella Zhukova
Pattern Matching on Elastic-Degenerate Text with Errors
74(17)
Giulia Bernardini
Nadia Pisanti
Solon P. Pissis
Giovanna Rosone
Succinct Partial Sums and Fenwick Trees
91(6)
Philip Bille
Anders Roy Christiansen
Nicola Prezza
Frederik Rye Skjoldjensen
Tight Bounds for Top Tree Compression
97(6)
Philip Bille
Finn Fernstrom
Inge Li Gørtz
Efficient Compression and Indexing of Trajectories
103(13)
Nieves R. Brisaboa
Travis Gagie
Adrian Gomez-Brandon
Gonzalo Navarro
Jose R. Parama
Fast Construction of Compressed Web Graphs
116(13)
Jan Broß
Simon Gog
Matthias Hauck
Marcus Paradies
Constructing a Consensus Phylogeny from a Leaf-Removal Distance I (Extended Abstract)
129(15)
Cedric Chauve
Mark Jones
Manuel Lafond
Celine Scornavacca
Mathias Weller
Listing Maximal Independent Sets with Minimal Space and Bounded Delay
144(17)
Alessio Conte
Roberto Grossi
Andrea Marino
Takeaki Uno
Luca Versari
Fast Label Extraction in the CDAWG
161(15)
Djamal Belazzougui
Fabio Cunial
Lightweight BWT and LCP Merging via the Gap Algorithm
176(15)
Lavinia Egidi
Giovanni Manzini
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
191(17)
Johannes Fischer
Dominik Koppl
Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings
208(6)
Szymon Grabowski
Mining Bit-Parallel LCS-length Algorithms
214(7)
Heikki Hyyro
Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries
221(13)
Shunsuke Kanda
Kazuhiro Morita
Masao Fuketa
Faster Practical Block Compression for Rank/Select Dictionaries
234(7)
Yusaku Kaneta
Optimal Skeleton Huffman Trees
241(13)
Shmuel T. Klein
Tamar C. Serebro
Dana Shapira
Detecting One-Variable Patterns
254(17)
Dmitry Kosolobov
Florin Manea
Dirk Nowotka
Order Preserving Pattern Matching on Trees and DAGs
271(7)
Temma Nakamura
Shunsuke Inenaga
Hideo Bannai
Masayuki Takeda
A Self-Index on Block Trees
278(12)
Gonzalo Navarro
Counting Palindromes in Substrings
290(14)
Mikhail Rubinchik
Arseny M. Shur
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression
304(13)
Takuya Takagi
Keisuke Goto
Yuta Fujishige
Shunsuke Inenaga
Hiroki Arimura
Author Index 317
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97833196742856e.html
Märksõnad: