scientific article; zbMATH DE number 1786446
From MaRDI portal
Publication:4547735
zbMATH Open0990.68526MaRDI QIDQ4547735FDOQ4547735
Esko Ukkonen, Gonzalo Navarro, Veli Mäkinen
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2089/20890031
Title of this publication is not available (Why is that?)
Recommendations
- Approximate matching of run-length compressed strings
- Approximate string matching using compressed suffix arrays
- Combinatorial Pattern Matching
- Approximate string matching with compressed indexes
- Compressed Indexes for Approximate String Matching
- Compressed indexes for approximate string matching
- Approximate string matching on Ziv--Lempel compressed text
- scientific article; zbMATH DE number 1790365
- scientific article; zbMATH DE number 1615281
- Algorithms and Computation
Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorics on words (68R15)
Cited In (8)
- Binary jumbled string matching for highly run-length compressible texts
- Random Access to Grammar-Compressed Strings and Trees
- Edit distance of run-length encoded strings.
- Hardness of comparing two run-length encoded strings
- Approximate matching of run-length compressed strings
- Approximate string matching with compressed indexes
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
- Computing similarity of run-length encoded strings with affine gap penalty
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547735)
