default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 32
Volume 32, May 2015
- Maxime Crochemore
, Jacqueline W. Daykin, Zsuzsanna Lipták:
StringMasters 2012 & 2013 special issue - volume 2. 1-2 - Bill Smyth:
Perspectives: Journal of Discrete Algorithms Special StringMasters Issue (2015). 3-5 - Ali Alatabbi, M. Sohel Rahman, William F. Smyth:
Inferring an indeterminate string from a prefix graph. 6-13 - Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
A suffix tree or not a suffix tree? 14-23 - Anne Condon, Ján Manuch, Chris Thachuk:
The complexity of string partitioning. 24-43 - Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau:
Computing the Burrows-Wheeler transform in place and in small space. 44-52 - Simon Gog, Gonzalo Navarro, Matthias Petri:
Improved and extended locating functionality on compressed suffix arrays. 53-63 - Travis Gagie, Pawel Gawrychowski, Simon J. Puglisi:
Approximate pattern matching in LZ77-compressed texts. 64-68 - Gonzalo Navarro, Sharma V. Thankachan:
Bottom-k document retrieval. 69-74 - Satoshi Yoshida, Takuya Kida:
An efficient Variable-to-Fixed length encoding using multiplexed parse trees. 75-86
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-04 23:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
