String matching over compressed text on handheld devices using tagged sub-optimal code (TSC)

DOI10.1007/S11241-005-6886-9zbMATH Open1083.68566OpenAlexW2047542636MaRDI QIDQ813136FDOQ813136

Iehab Al Rassan, Abdelghani Bellaachia

Publication date: 30 January 2006

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-005-6886-9

Recommendations

• scientific article; zbMATH DE number 2185629
• Practical and flexible pattern matching over Ziv-Lempel compressed text.
• scientific article; zbMATH DE number 2140438
• scientific article; zbMATH DE number 2087042
• Compressed matching in dictionaries

zbMATH Keywords

pattern matchingstring matchinghandheldPDAsearching compressed text

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)

Cites Work

• A fast string searching algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Let sleeping files lie: Pattern matching in Z-compressed files.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• String matching over compressed text on handheld devices using tagged sub-optimal code (TSC)

Cited In (1)

• String matching over compressed text on handheld devices using tagged sub-optimal code (TSC)

This page was built for publication: String matching over compressed text on handheld devices using tagged sub-optimal code (TSC)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813136)