scientific article; zbMATH DE number 2087050

MaRDI QIDQ4737696zbMATH OpenFDO

Authors Wing-Kai Hon, Kunihiko Sadakane

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2373/23730144.htm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Analysis of algorithms (68W40) Protein sequences, DNA sequences (92D20)

Recommendations

• Space-time trade-offs for finding shortest unique substrings and maximal unique matches
• Fast matching statistics in small space
• scientific article; zbMATH DE number 1945184
• Space-time trade-offs for the shortest unique substring problem
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)

Cited in

(9)

• Space-time trade-offs for finding shortest unique substrings and maximal unique matches
• A general Sequential Time-Space Tradeoff for Finding Unique Elements
• Approximate all-pairs suffix/prefix overlaps
• scientific article; zbMATH DE number 1945184 (Why is no real title available?)
• Fast matching statistics in small space
• Space-efficient parallel construction of succinct representations of suffix tree topologies
• Space efficient search for maximal repetitions
• Computing all-vs-all MEMs in grammar-compressed text
• Replacing suffix trees with enhanced suffix arrays

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 Q4737696)