scientific article; zbMATH DE number 1786446

MaRDI QIDQ4547735zbMATH OpenFDO

Authors Veli Mäkinen, Esko Ukkonen, Gonzalo Navarro

Publication date 21 August 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2089/20890031

Mathematics Subject Classification ID

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)

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

Cited in

(11)

• Binary jumbled string matching for highly run-length compressible texts
• Efficient retrieval of approximate palindromes in a run-length encoded string
• Edit distance of run-length encoded strings.
• Hardness of comparing two run-length encoded strings
• Approximate matching of run-length compressed strings
• Random access to grammar-compressed strings and trees
• Approximate string matching with compressed indexes
• Identifying approximate palindromes in run-length encoded strings
• A fully compressed algorithm for computing the edit distance of run-length encoded strings
• Computing similarity of run-length encoded strings with affine gap penalty
• Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard

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)