A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm

DOI10.1007/978-3-319-19929-0_32zbMath1432.68609OpenAlexW2402943835MaRDI QIDQ2942275

Cyril Nicaud

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-01719172/file/cpm15.pdf

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Automata, languages and programming. 30th international colloquium, ICALP 2003, Eindhoven, The Netherland, June 30 -- July 4, 2003. Proceedings
• Dynamical sources in information theory: Fundamental intervals and word prefixes
• Combinatorial pattern matching. 14th annual symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25--27, 2003. Proceedings.
• Suffix Arrays: A New Method for On-Line String Searches
• Linear-Time Construction of Suffix Arrays
• Space Efficient Linear Time Construction of Suffix Arrays
• Markov Chains
• Two Efficient Algorithms for Linear Time Suffix Array Construction

This page was built for publication: A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm