A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm
From MaRDI portal
Publication:2942275
DOI10.1007/978-3-319-19929-0_32zbMATH Open1432.68609OpenAlexW2402943835MaRDI QIDQ2942275FDOQ2942275
Authors: 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
Recommendations
- scientific article; zbMATH DE number 5050583
- Probabilistic Analyses of Lattice Reduction Algorithms
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
- A probabilistic analysis of a pattern matching problem
- scientific article; zbMATH DE number 2127733
- Checking Big Suffix and LCP Arrays by Probabilistic Methods
- An estimation of the size of non-compact suffix trees
Cites Work
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Dynamical sources in information theory: Fundamental intervals and word prefixes
- Markov Chains
- Suffix Arrays: A New Method for On-Line String Searches
- Space efficient linear time construction of suffix arrays
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- Title not available (Why is that?)
- Linear-time construction of suffix arrays (extended abstract)
- Combinatorial pattern matching. 14th annual symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25--27, 2003. Proceedings.
- Automata, languages and programming. 30th international colloquium, ICALP 2003, Eindhoven, The Netherland, June 30 -- July 4, 2003. Proceedings
Cited In (1)
This page was built for publication: A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942275)
