p-suffix sorting as arithmetic coding

DOI10.1007/978-3-642-25011-8_4MaRDI QIDQ3111639zbMATH OpenOpenAlexFDO

Authors Richard Beal, Donald Adjeroh

Publication date 13 January 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25011-8_4

zbMATH Keywords

arithmetic codingfingerprintsp-matchp-stringparameterized suffix arrayparameterized suffix sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• p-suffix sorting as arithmetic coding
• Lightweight parameterized suffix array construction
• Suffix-sorting via Shannon-Fano-Elias codes
• Faster suffix sorting
• An efficient, versatile approach to suffix sorting

Cited in

(5)

• p-suffix sorting as arithmetic coding
• A brief history of parameterized matching problems
• Sorting parity encodings by reusing variables
• The structural border array
• Parameterized longest previous factor

This page was built for publication: p-suffix sorting as arithmetic coding

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