000 04429nam a22005775i 4500
001 978-3-319-11918-2
003 DE-He213
005 20200421112234.0
007 cr nn 008mamaa
008 141010s2014 gw | s |||| 0|eng d
020 _a9783319119182
_9978-3-319-11918-2
024 7 _a10.1007/978-3-319-11918-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUNH
_2bicssc
072 7 _aUND
_2bicssc
072 7 _aCOM030000
_2bisacsh
082 0 4 _a025.04
_223
245 1 0 _aString Processing and Information Retrieval
_h[electronic resource] :
_b21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings /
_cedited by Edleno Moura, Maxime Crochemore.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXIV, 279 p. 65 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8799
505 0 _aCompression -- Strategic Pattern Search in Factor-Compressed Test -- Relative Lempel-Ziv with Constant-Time Random Access -- Efficient Compressed Indexing for Approximate Top-k String Retrieval -- Grammar Compressed Sequences with Rank/Select Support -- Indexing -- Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings -- Relative FM-Indexes -- Efficient Indexing and Representation of Web Access Logs -- A Compressed Suffix-Array Strategy for Temporal-Graph Indexing -- Succinct Indexes for Reporting Discriminating and Generic Words -- Fast Construction of Wavelet Trees -- Order Preserving Prefix Tables -- Genome and Related Topics -- Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time -- A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Gene Prediction Task -- Improved Filters for the Approximate Suffix-Prefix Overlap Problem -- Sequences and Strings Sequence Decision -- Diagrams -- Shortest Unique Queries on Strings -- Online Multiple Palindrome Pattern Matching -- Indexed Matching Statistics and Shortest Unique Substrings -- Search -- I/O-Efficient Dictionary Search with One Edit Error -- Online Pattern Matching for String Edit Distance with Moves -- K2-Treaps: Range Top-k Queries in Compact Space -- Performance Improvements for Search Systems Using an Integrated Cache of Lists + Intersections -- Mining and Recommending Information-Theoretic Term Selection for New Item Recommendation -- On the String Consensus Problem and the Manhattan Sequence Consensus Problem -- Context-Aware Deal Size Prediction -- Simple and Efficient String Algorithms for Query Suggestion Metrics Computation.
520 _aThis book constitutes the proceedings of the 21st International Symposium on String Processing and Information Retrieval, SPIRE 2014, held in Ouro Preto, Brazil, in October 2014. The 20 full and 6 short papers included in this volume were carefully reviewed and selected from 45 submissions. The papers focus not only on fundamental algorithms in string processing and information retrieval, but address also application areas such as computational biology, Web mining and recommender systems. They are organized in topical sections on compression, indexing, genome and related topics, sequences and strings, search, as well as on mining and recommending.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aDatabase management.
650 0 _aData mining.
650 0 _aInformation storage and retrieval.
650 0 _aPattern recognition.
650 1 4 _aComputer Science.
650 2 4 _aInformation Storage and Retrieval.
650 2 4 _aPattern Recognition.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aData Mining and Knowledge Discovery.
650 2 4 _aDatabase Management.
700 1 _aMoura, Edleno.
_eeditor.
700 1 _aCrochemore, Maxime.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319119175
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8799
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-11918-2
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c58181
_d58181