|
|
|
|
| LEADER |
03407nam a22004455i 4500 |
| 001 |
000292236 |
| 005 |
20211005091940.0 |
| 007 |
cr nn 008mamaa |
| 008 |
170905s2017 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319674285
|
| 024 |
7 |
|
|a 10.1007/978-3-319-67428-5
|2 doi
|
| 040 |
|
|
|a Sistema de Bibliotecas del Tecnológico de Costa Rica
|
| 245 |
1 |
0 |
|a String Processing and Information Retrieval :
|b 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings /
|c edited by Gabriele Fici, Marinella Sciortino, Rossano Venturini.
|
| 250 |
|
|
|a 1st ed. 2017.
|
| 260 |
# |
# |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2017.
|
| 300 |
|
|
|a XIX, 318 p. 65 illus. :
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues ;
|v 10508
|
| 505 |
0 |
|
|a 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. .
|
| 650 |
|
0 |
|a Information storage and retrieval.
|
| 650 |
|
0 |
|a Management information systems.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Application software.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Database management.
|
| 650 |
|
0 |
|a Optical data processing.
|
| 650 |
1 |
4 |
|a Information Storage and Retrieval.
|
| 650 |
2 |
4 |
|a Management of Computing and Information Systems.
|
| 650 |
2 |
4 |
|a Computer Appl. in Administrative Data Processing.
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|
| 650 |
2 |
4 |
|a Database Management.
|
| 650 |
2 |
4 |
|a Image Processing and Computer Vision.
|
| 700 |
1 |
|
|a Fici, Gabriele.
|e editor.
|0 (orcid)0000-0002-3536-327X
|1 https://orcid.org/0000-0002-3536-327X
|
| 700 |
1 |
|
|a Sciortino, Marinella.
|e editor.
|0 (orcid)0000-0001-6928-0168
|1 https://orcid.org/0000-0001-6928-0168
|
| 700 |
1 |
|
|a Venturini, Rossano.
|e editor.
|0 (orcid)0000-0002-9830-3936
|1 https://orcid.org/0000-0002-9830-3936
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 900 |
|
|
|a Libro descargado a ALEPH en bloque (proveniente de proveedor)
|