Compressed Indexing with Signature Grammars
| Autor: | Anders Roy Christiansen, Mikko Berggren Ettienne |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Theoretical computer science
Computer science String (computer science) Search engine indexing Representation (systemics) Data_CODINGANDINFORMATIONTHEORY 0102 computer and information sciences 02 engineering and technology Construction grammar 01 natural sciences Signature (logic) High Energy Physics::Theory Rule-based machine translation 010201 computation theory & mathematics 020204 information systems 0202 electrical engineering electronic engineering information engineering Pattern matching |
| Zdroj: | LATIN 2018: Theoretical Informatics ISBN: 9783319774039 LATIN |
| DOI: | 10.1007/978-3-319-77404-6_25 |
| Popis: | The compressed indexing problem is to preprocess a string S of length n into a compressed representation that supports pattern matching queries. That is, given a string P of length m report all occurrences of P in S. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|